一类分层结构数据网络的快速分布式最短路径算法

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI:10.1109/INFCOM.1989.101451

J. Antonio, Garng M. Huang, W. Tsai

{"title":"一类分层结构数据网络的快速分布式最短路径算法","authors":"J. Antonio, Garng M. Huang, W. Tsai","doi":"10.1109/INFCOM.1989.101451","DOIUrl":null,"url":null,"abstract":"A distributed algorithm is presented which finds the shortest path from every node in the network to a given destination node. The network topology is assumed to be organizable into a generalized balanced-tree hierarchy (BH). The BH topology is introduced and characterized, and it is shown that most large interconnected data networks are of this type. It is also shown that the algorithm converges in an asynchronous environment. Therefore, some of the difficulties associated with synchronizing the order of events can be avoided in the actual implementation of the proposed algorithm.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"141 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"64","resultStr":"{\"title\":\"A fast distributed shortest path algorithm for a class of hierarchically structured data networks\",\"authors\":\"J. Antonio, Garng M. Huang, W. Tsai\",\"doi\":\"10.1109/INFCOM.1989.101451\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A distributed algorithm is presented which finds the shortest path from every node in the network to a given destination node. The network topology is assumed to be organizable into a generalized balanced-tree hierarchy (BH). The BH topology is introduced and characterized, and it is shown that most large interconnected data networks are of this type. It is also shown that the algorithm converges in an asynchronous environment. Therefore, some of the difficulties associated with synchronizing the order of events can be avoided in the actual implementation of the proposed algorithm.<<ETX>>\",\"PeriodicalId\":275763,\"journal\":{\"name\":\"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies\",\"volume\":\"141 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"64\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1989.101451\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1989.101451","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 64

摘要

提出了一种从网络中每个节点到给定目标节点的最短路径的分布式算法。假设网络拓扑结构可组织为广义平衡树层次结构(BH)。介绍了BH拓扑结构并对其进行了表征，结果表明，大多数大型互联数据网络都属于这种类型。结果表明，该算法在异步环境下具有收敛性。因此，在实际实现所提出的算法时，可以避免与同步事件顺序相关的一些困难。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A fast distributed shortest path algorithm for a class of hierarchically structured data networks

A distributed algorithm is presented which finds the shortest path from every node in the network to a given destination node. The network topology is assumed to be organizable into a generalized balanced-tree hierarchy (BH). The BH topology is introduced and characterized, and it is shown that most large interconnected data networks are of this type. It is also shown that the algorithm converges in an asynchronous environment. Therefore, some of the difficulties associated with synchronizing the order of events can be avoided in the actual implementation of the proposed algorithm.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies

自引率

0.00%

发文量