{"id":"https://openalex.org/W2014683405","doi":"https://doi.org/10.1080/10798587.2000.10768165","title":"Two Approaches for Aggregation of Peer Group Topology in Hierarchical PNNI Networks","display_name":"Two Approaches for Aggregation of Peer Group Topology in Hierarchical PNNI Networks","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2014683405","doi":"https://doi.org/10.1080/10798587.2000.10768165","mag":"2014683405"},"language":"en","primary_location":{"id":"doi:10.1080/10798587.2000.10768165","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10798587.2000.10768165","pdf_url":null,"source":{"id":"https://openalex.org/S40639465","display_name":"Intelligent Automation & Soft Computing","issn_l":"1079-8587","issn":["1079-8587","2326-005X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Automation & Soft Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020930091","display_name":"Kiran R. Bhutani","orcid":"https://orcid.org/0000-0003-4823-0887"},"institutions":[{"id":"https://openalex.org/I168959743","display_name":"University of America","ror":"https://ror.org/03s0c9350","country_code":"US","type":"education","lineage":["https://openalex.org/I168959743"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kiran R. Bhutani","raw_affiliation_strings":["Department of Mathematics The Catholic University of America Washington D.C"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics The Catholic University of America Washington D.C","institution_ids":["https://openalex.org/I168959743"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024100219","display_name":"Abdella Battou","orcid":"https://orcid.org/0000-0003-3071-842X"},"institutions":[{"id":"https://openalex.org/I1288214837","display_name":"United States Naval Research Laboratory","ror":"https://ror.org/04d23a975","country_code":"US","type":"facility","lineage":["https://openalex.org/I1288214837","https://openalex.org/I1330347796","https://openalex.org/I175003984","https://openalex.org/I3130687028"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abdella Battou","raw_affiliation_strings":["Center for Computational Science Naval Research Laboratory Washington D.C"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Computational Science Naval Research Laboratory Washington D.C","institution_ids":["https://openalex.org/I1288214837"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091193777","display_name":"Bilal Khan","orcid":"https://orcid.org/0000-0002-0382-4502"},"institutions":[{"id":"https://openalex.org/I1288214837","display_name":"United States Naval Research Laboratory","ror":"https://ror.org/04d23a975","country_code":"US","type":"facility","lineage":["https://openalex.org/I1288214837","https://openalex.org/I1330347796","https://openalex.org/I175003984","https://openalex.org/I3130687028"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bilal Khan","raw_affiliation_strings":["ITT Systems and Sciences Corp. Naval Research Laboratory Washington D.C"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITT Systems and Sciences Corp. Naval Research Laboratory Washington D.C","institution_ids":["https://openalex.org/I1288214837"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7046,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86783703,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"2","first_page":"125","last_page":"134"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8815874457359314},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5633782148361206},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5451674461364746},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.5297556519508362},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4410642385482788},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3564499616622925},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3545404374599457},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.14536529779434204},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.06666219234466553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.05252563953399658}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8815874457359314},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5633782148361206},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5451674461364746},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.5297556519508362},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4410642385482788},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3564499616622925},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3545404374599457},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.14536529779434204},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.06666219234466553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.05252563953399658},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10798587.2000.10768165","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10798587.2000.10768165","pdf_url":null,"source":{"id":"https://openalex.org/S40639465","display_name":"Intelligent Automation & Soft Computing","issn_l":"1079-8587","issn":["1079-8587","2326-005X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Intelligent Automation & Soft Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320337628","display_name":"U.S. Naval Research Laboratory","ror":"https://ror.org/04d23a975"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1494474111","https://openalex.org/W1591736593","https://openalex.org/W2100471534","https://openalex.org/W2105810661","https://openalex.org/W4233981066"],"related_works":["https://openalex.org/W1504892994","https://openalex.org/W27372636","https://openalex.org/W1534520929","https://openalex.org/W2155647216","https://openalex.org/W1920820941","https://openalex.org/W1559031748","https://openalex.org/W2137426847","https://openalex.org/W1496963452","https://openalex.org/W2099776868","https://openalex.org/W3041586895"],"abstract_inverted_index":{"ABSTRACTWe":[0],"propose":[1],"two":[2,71],"methods":[3,17],"for":[4,84,96],"aggregation":[5,16],"of":[6,41,57,136,146,156],"peer":[7,21,45,111],"group":[8,22],"topology":[9],"in":[10,33,66,75,128,143],"hierarchical":[11],"ATM":[12],"networks.":[13],"Both":[14,104],"proposed":[15,106,158],"transform":[18],"a":[19,24,34,51],"given":[20],"into":[23],"star":[25],"graph":[26],"representation.":[27,69],"Our":[28,47],"first":[29,80],"approach":[30,49],"optimally":[31],"preserves,":[32],"least":[35],"square":[36],"sense,":[37],"the":[38,44,55,58,64,67,76,79,92,105,125,137,144,157],"original":[39],"costs":[40],"routing":[42],"through":[43],"group.":[46],"second":[48,93],"assigns":[50],"weighted":[52],"vector":[53],"to":[54],"nucleus":[56],"Logical":[59],"Group":[60],"Node,":[61],"which":[62],"quantifies":[63],"error":[65],"compact":[68],"The":[70,134,154],"schemes":[72,107],"are":[73,89,108],"dual,":[74],"sense":[77],"that":[78],"is":[81,94,140],"best":[82],"suited":[83,95],"peergroups":[85,97],"where":[86,98],"traffic":[87,99],"patterns":[88,100],"unpredictable,":[90],"and":[91,118,149],"can":[101,150],"be":[102,151],"characterized.":[103],"practical:":[109],"For":[110],"groups":[112],"with":[113],"nodes":[114,121],"V,":[115,124],"links":[116],"E,":[117],"n":[119],"border":[120,147],"B":[122],"\u2282":[123],"approaches":[126],"run":[127],"O(n|V|log|V|":[129],"+":[130],"n|E|+":[131],"poly(n))":[132],"time.":[133],"size":[135],"final":[138],"representation":[139],"small":[141],"(linear":[142],"number":[145],"nodes)":[148],"computed":[152],"efficiently.":[153],"scalability":[155],"algorithms":[159],"makes":[160],"them":[161],"well-suited...":[162]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}