A simple algorithm for computing minimum spanning trees in the internet
A central problem in wide-area networks is to efficiently multicast a message to all members ( hosts) of a target group. One of the most effective methods to multicast a message is to send the message along the edges of a spanning tree connecting all the members of the group. In this paper, we propo...
Gespeichert in:
| Veröffentlicht in: | Information sciences Jg. 101; H. 1; S. 47 - 69 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Inc
1997
|
| ISSN: | 0020-0255, 1872-6291 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | A central problem in wide-area networks is to efficiently multicast a message to all members (
hosts) of a target group. One of the most effective methods to multicast a message is to send the message along the edges of a spanning tree connecting all the members of the group. In this paper, we propose a new fully distributed algorithm to build a minimum spanning tree (MST) in a generic communication network. During the execution, the algorithm maintains a collection of disjoint trees spanning all the group members. Every tree, which initially consists of only one node,
independently expands by joining the closest tree, until all of the nodes are connected in a single tree. The resulting communication topology is both robust (there are no singularities subject to failures) and scalable (every node stores a limited amount of local information that is independent of the size of the network). |
|---|---|
| AbstractList | A central problem in wide-area networks is to efficiently multicast a message to all members (
hosts) of a target group. One of the most effective methods to multicast a message is to send the message along the edges of a spanning tree connecting all the members of the group. In this paper, we propose a new fully distributed algorithm to build a minimum spanning tree (MST) in a generic communication network. During the execution, the algorithm maintains a collection of disjoint trees spanning all the group members. Every tree, which initially consists of only one node,
independently expands by joining the closest tree, until all of the nodes are connected in a single tree. The resulting communication topology is both robust (there are no singularities subject to failures) and scalable (every node stores a limited amount of local information that is independent of the size of the network). A central problem in wide-area networks is to efficiently multicast a message to all members (hosts) of a target group. One of the most effective methods to multicast a message is to send the message along the edges of a spanning tree connecting all the members of the group. In this paper, we propose a new fully distributed algorithm to build a minimum spanning tree (MST) in a generic communication network. During the execution, the algorithm maintains a collection of disjoint trees spanning all the group members. Every tree, which initially consists of only one node, independently expands by joining the closest tree, until all of the nodes are connected in a single tree. The resulting communication topology is both robust (there are no singularities subject to failures) and scalable (every node stores a limited amount of local information that is independent of the size of the network). |
| Author | Wilson, K. Sultan, F. Abdel-Wahab, H. Stoica, I. |
| Author_xml | – sequence: 1 givenname: H. surname: Abdel-Wahab fullname: Abdel-Wahab, H. – sequence: 2 givenname: I. surname: Stoica fullname: Stoica, I. – sequence: 3 givenname: F. surname: Sultan fullname: Sultan, F. – sequence: 4 givenname: K. surname: Wilson fullname: Wilson, K. |
| BookMark | eNqFkEFLwzAUx4MouE0_gtCT6KGapG2y4kHG0CkMPKjnkKYvW6RNapIKfnvbTTx42bv84fH7Px6_KTq2zgJCFwTfEEzY7SvGFKeYFsVVya_xMDQtj9CEzDlNGS3JMZr8IadoGsLHwOScsQlaLZJg2q6BRDYb503ctol2PlGu7fpo7CZpjTVt3yahk9aOi-gBQmJsErcwRARvIZ6hEy2bAOe_OUPvjw9vy6d0_bJ6Xi7WqcqyeUzLOs9KgpmuZVVIqomsKza8KFkttc5ZxTQBTQjMi5JLzYFWhQYpMzWnmap5NkOX-7udd589hChaExQ0jbTg-iAoz3JOWDmAd3tQeReCBy2UiTIaZ6OXphEEi1Ge2MkToxlRcrGTJ8Z28a_dedNK_32wd7_vweDgy4AXQRmwCmrjQUVRO3Pgwg_qQoos |
| CitedBy_id | crossref_primary_10_1016_j_ins_2014_10_012 crossref_primary_10_1209_epl_i2005_10232_x |
| Cites_doi | 10.1145/78952.78953 10.1109/2.274996 10.1016/0020-0190(80)90021-6 10.1109/35.9125 10.1145/166237.166246 10.1145/357195.357200 |
| ContentType | Journal Article |
| Copyright | 1997 |
| Copyright_xml | – notice: 1997 |
| DBID | AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/S0020-0255(97)00002-9 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Library & Information Science |
| EISSN | 1872-6291 |
| EndPage | 69 |
| ExternalDocumentID | 10_1016_S0020_0255_97_00002_9 S0020025597000029 |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN ABAOU ABBOA ABEFU ABFNM ABJNI ABMAC ABTAH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LG9 LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SST SSV SSW SSZ T5K TN5 TWZ UHS WH7 WUQ XPP YYP ZMT ZY4 ~02 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 7SP 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c338t-9d439106fdab5a2f1adb6629a6daff46b6f1ef11e8597af7e2b5feaa3c823cd73 |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1016_S0020_0255_97_00002_9&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-0255 |
| IngestDate | Sun Nov 09 11:26:58 EST 2025 Sat Nov 29 02:42:25 EST 2025 Tue Nov 18 19:41:57 EST 2025 Fri Feb 23 02:16:26 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c338t-9d439106fdab5a2f1adb6629a6daff46b6f1ef11e8597af7e2b5feaa3c823cd73 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 27347169 |
| PQPubID | 23500 |
| PageCount | 23 |
| ParticipantIDs | proquest_miscellaneous_27347169 crossref_citationtrail_10_1016_S0020_0255_97_00002_9 crossref_primary_10_1016_S0020_0255_97_00002_9 elsevier_sciencedirect_doi_10_1016_S0020_0255_97_00002_9 |
| PublicationCentury | 1900 |
| PublicationDate | 1997-00-00 |
| PublicationDateYYYYMMDD | 1997-01-01 |
| PublicationDate_xml | – year: 1997 text: 1997-00-00 |
| PublicationDecade | 1990 |
| PublicationTitle | Information sciences |
| PublicationYear | 1997 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Deering (BIB9) 1991 Perlman (BIB17) 1992 Abdel-Wahab, Stoica, Sultan (BIB2) Nov. 1994 Gallager, Humblet, Spira (BIB11) 1983; 5 Moy (BIB14) July 1993 Perlman (BIB16) Sept. 1985 Macedonia, Brutzman (BIB13) Apr. 1994 Chin, Ting (BIB6) Oct. 1985 Bollobas (BIB5) 1979 Abdel-Wahab, Guan, Nievergelt (BIB1) 1988; 26 Dijkstra, Scholten (BIB10) 1980; 11 Karp (BIB12) 1972 Awerbuch (BIB3) May 1987 pp. 85–94. T. Ballardie, P. Francis, and J. Crowcroft, Core based trees (CBT)—An architecture for scalable inter-domain multicast routing, in Deering (BIB8) 1990; 8 Noronha, Tobagi (BIB15) 1994; Vol. 3 Cormen, Leiserson, Rivest (BIB7) 1992 Perlman (10.1016/S0020-0255(97)00002-9_BIB16) 1985 Noronha (10.1016/S0020-0255(97)00002-9_BIB15) 1994; Vol. 3 Abdel-Wahab (10.1016/S0020-0255(97)00002-9_BIB2) 1994 Abdel-Wahab (10.1016/S0020-0255(97)00002-9_BIB1) 1988; 26 10.1016/S0020-0255(97)00002-9_BIB4 Deering (10.1016/S0020-0255(97)00002-9_BIB9) 1991 Macedonia (10.1016/S0020-0255(97)00002-9_BIB13) 1994 Awerbuch (10.1016/S0020-0255(97)00002-9_BIB3) 1987 Cormen (10.1016/S0020-0255(97)00002-9_BIB7) 1992 Karp (10.1016/S0020-0255(97)00002-9_BIB12) 1972 Deering (10.1016/S0020-0255(97)00002-9_BIB8) 1990; 8 Moy (10.1016/S0020-0255(97)00002-9_BIB14) 1993 Perlman (10.1016/S0020-0255(97)00002-9_BIB17) 1992 Bollobas (10.1016/S0020-0255(97)00002-9_BIB5) 1979 Dijkstra (10.1016/S0020-0255(97)00002-9_BIB10) 1980; 11 Chin (10.1016/S0020-0255(97)00002-9_BIB6) 1985 Gallager (10.1016/S0020-0255(97)00002-9_BIB11) 1983; 5 |
| References_xml | – volume: 26 start-page: 10 year: 1988 end-page: 16 ident: BIB1 article-title: Shared workspaces for group collaboration: An experiment using Internet and UNIX interprocess communications publication-title: IEEE Commun. Mag. – start-page: 174 year: Nov. 1994 end-page: 177 ident: BIB2 article-title: The design and implementation of an Internet conference information system publication-title: Proc. Joint Conf. Inform. Sci. – volume: 8 start-page: 85 year: 1990 end-page: 110 ident: BIB8 article-title: Multicast routing in internetworks and extended LANs publication-title: ACM Trans. Comput. Syst. – year: 1992 ident: BIB7 article-title: Introduction to Algorithms – year: 1991 ident: BIB9 article-title: Multicast routing in a datagram internetworking publication-title: Ph.D. Thesis – start-page: 230 year: May 1987 end-page: 240 ident: BIB3 article-title: Optimal distributed algorithms for minimum spanning trees publication-title: Proc. ACM Symp. Theory of Computing – year: 1979 ident: BIB5 article-title: Graph Theory, An Introductory Course – start-page: 85 year: 1972 end-page: 103 ident: BIB12 article-title: Reducibility among combinatorial problems publication-title: Complexity of Communications – volume: 11 start-page: 1 year: 1980 end-page: 4 ident: BIB10 article-title: Termination detection for diffusing computations publication-title: Inform. Processing Lett. – start-page: 30 year: Apr. 1994 end-page: 35 ident: BIB13 article-title: MBone provides video and audio across the Internet publication-title: IEEE Comput. – reference: , pp. 85–94. – start-page: 257 year: Oct. 1985 end-page: 266 ident: BIB6 article-title: An almost linear time and publication-title: Proc. 26th Symp. Foundations of Comput. Sci. – volume: 5 start-page: 66 year: 1983 end-page: 77 ident: BIB11 article-title: A distributed algorithm for minimum-weight spanning trees publication-title: ACM Trans. Programming Languages and Syst. – volume: Vol. 3 start-page: 865 year: 1994 end-page: 873 ident: BIB15 article-title: Optimum routing of multicast streams publication-title: Proc. IEEE 13th Ann. Joint Conf. Comput. and Commun. – year: July 1993 ident: BIB14 article-title: Multicast extensions to OSPF publication-title: IETF Draft – year: 1992 ident: BIB17 article-title: Interconnections – start-page: 44 year: Sept. 1985 end-page: 53 ident: BIB16 article-title: An algorithm for distributed computation of a spanning tree in an extended LAN publication-title: Proc. 9th Data Commun. Symp. – reference: T. Ballardie, P. Francis, and J. Crowcroft, Core based trees (CBT)—An architecture for scalable inter-domain multicast routing, in: – volume: 8 start-page: 85 issue: 2 year: 1990 ident: 10.1016/S0020-0255(97)00002-9_BIB8 article-title: Multicast routing in internetworks and extended LANs publication-title: ACM Trans. Comput. Syst. doi: 10.1145/78952.78953 – start-page: 30 year: 1994 ident: 10.1016/S0020-0255(97)00002-9_BIB13 article-title: MBone provides video and audio across the Internet publication-title: IEEE Comput. doi: 10.1109/2.274996 – start-page: 44 year: 1985 ident: 10.1016/S0020-0255(97)00002-9_BIB16 article-title: An algorithm for distributed computation of a spanning tree in an extended LAN – year: 1991 ident: 10.1016/S0020-0255(97)00002-9_BIB9 article-title: Multicast routing in a datagram internetworking – start-page: 230 year: 1987 ident: 10.1016/S0020-0255(97)00002-9_BIB3 article-title: Optimal distributed algorithms for minimum spanning trees – year: 1992 ident: 10.1016/S0020-0255(97)00002-9_BIB17 – volume: 11 start-page: 1 year: 1980 ident: 10.1016/S0020-0255(97)00002-9_BIB10 article-title: Termination detection for diffusing computations publication-title: Inform. Processing Lett. doi: 10.1016/0020-0190(80)90021-6 – volume: 26 start-page: 10 issue: 11 year: 1988 ident: 10.1016/S0020-0255(97)00002-9_BIB1 article-title: Shared workspaces for group collaboration: An experiment using Internet and UNIX interprocess communications publication-title: IEEE Commun. Mag. doi: 10.1109/35.9125 – start-page: 174 year: 1994 ident: 10.1016/S0020-0255(97)00002-9_BIB2 article-title: The design and implementation of an Internet conference information system – ident: 10.1016/S0020-0255(97)00002-9_BIB4 doi: 10.1145/166237.166246 – year: 1993 ident: 10.1016/S0020-0255(97)00002-9_BIB14 article-title: Multicast extensions to OSPF publication-title: IETF Draft – year: 1992 ident: 10.1016/S0020-0255(97)00002-9_BIB7 – start-page: 257 year: 1985 ident: 10.1016/S0020-0255(97)00002-9_BIB6 article-title: An almost linear time and O(n log n +e) messages distributed algorithm for minimum-weight spanning trees – start-page: 85 year: 1972 ident: 10.1016/S0020-0255(97)00002-9_BIB12 article-title: Reducibility among combinatorial problems – volume: Vol. 3 start-page: 865 year: 1994 ident: 10.1016/S0020-0255(97)00002-9_BIB15 article-title: Optimum routing of multicast streams – volume: 5 start-page: 66 issue: 1 year: 1983 ident: 10.1016/S0020-0255(97)00002-9_BIB11 article-title: A distributed algorithm for minimum-weight spanning trees publication-title: ACM Trans. Programming Languages and Syst. doi: 10.1145/357195.357200 – year: 1979 ident: 10.1016/S0020-0255(97)00002-9_BIB5 |
| SSID | ssj0004766 |
| Score | 1.5310997 |
| Snippet | A central problem in wide-area networks is to efficiently multicast a message to all members (
hosts) of a target group. One of the most effective methods to... A central problem in wide-area networks is to efficiently multicast a message to all members (hosts) of a target group. One of the most effective methods to... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 47 |
| Title | A simple algorithm for computing minimum spanning trees in the internet |
| URI | https://dx.doi.org/10.1016/S0020-0255(97)00002-9 https://www.proquest.com/docview/27347169 |
| Volume | 101 |
| WOSCitedRecordID | wos10_1016_S0020_0255_97_00002_9&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6291 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004766 issn: 0020-0255 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fb9MwELZKxwM8IBggNhj4ASFQ5bIkTWw_VmhjgDQhMUTfItuxWaU0ndZ025_P-UecDoQGSLxErWXHku_L-Xy--w6hl5miieRUk0RlgkyUnBCRM0VEwVWl86TihrliE_T4mM1m_PNgcNnlwlzUtGnY1RU_-6-ihjYQtk2d_Qtxx5dCA_wGocMTxA7PPxL8dLSaW8rfkai_L-Hof7pwoYTKlW-wjgHLJrJYL0agS1y9Ihts7sKynBE6dy5Cfc1lH3KWHFTClhlN8amsdE2-iVPhbnaOxtFn0y4BAE4H9W3ruvUe18PY1hNGfhr3PggbmdK7xLq0mGtRm9YGJfaw4jcZr1kZTUmR-tJcUfUGR8Ymxrwi9TScYUv2xVx-Ufbe7_AlzgYmuaUVtmVQQc3zfoeLcYeurz9FuU78FtpKKfwboq3ph4PZxz6llvpr7u7dffLX237C15y-CZP9zqz5aYN3VsvJfXQvHDfw1MPkARroZhvd3SCh3EZ7IXUFv8IbcsZB6T9E76fYAwpHQGHohiOgcAAU7gCFHaDwvMEAKNwB6hH6enhw8u6IhPIbRGUZawmvbFb2fmEqIXORmkRUsgAJiqISxkwKWZhEmyTRDBZQGKpTmRstRKZYmqmKZo_RsFk2-gnCGj75wigpBZz-c1h-meQSjFdeMWZNxB006VavVIGb3pZIqcs-CBEWvbSLXvqIif205DtoHIedeXKWmwawTjRl-Fy85VgCpm4a-qITZQka2F6riUYv16vSEkRZzqndf3_5U3TH0yJb194zNGzP13oP3VYX7Xx1_jxg8wd9XqaX |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+simple+algorithm+for+computing+minimum+spanning+trees+in+the+internet&rft.jtitle=Information+sciences&rft.au=Abdel-Wahab%2C+H.&rft.au=Stoica%2C+I.&rft.au=Sultan%2C+F.&rft.au=Wilson%2C+K.&rft.date=1997&rft.pub=Elsevier+Inc&rft.issn=0020-0255&rft.eissn=1872-6291&rft.volume=101&rft.issue=1&rft.spage=47&rft.epage=69&rft_id=info:doi/10.1016%2FS0020-0255%2897%2900002-9&rft.externalDocID=S0020025597000029 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0255&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0255&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0255&client=summon |