A Distributed Shortest - Path Algorithm
dc.contributor.author | Humblet, Pierre A. | |
dc.date.accessioned | 2016-05-18T22:50:15Z | |
dc.date.available | 2016-05-18T22:50:15Z | |
dc.date.issued | 1978-11 | |
dc.identifier.issn | 0884-5123 | |
dc.identifier.issn | 0074-9079 | |
dc.identifier.uri | http://hdl.handle.net/10150/609766 | |
dc.description | International Telemetering Conference Proceedings / November 14-16, 1978 / Hyatt House Hotel, Los Angeles, California | en_US |
dc.description.abstract | The problem of routing in a data network is often treated by assigning traffic dependent lengths to the links of the network and routing traffic from node i to node j along the shortest path from i to j . We present a distributed algorithm in which the nodes cooperate to find all shortest paths. It runs asynchronously in every node and does not require the network topology, or even the number of nodes in the network, to be known a priori by the nodes. | |
dc.description.sponsorship | International Foundation for Telemetering | en |
dc.language.iso | en_US | en |
dc.publisher | International Foundation for Telemetering | en |
dc.relation.url | http://www.telemetry.org/ | en |
dc.rights | Copyright © International Foundation for Telemetering | en |
dc.title | A Distributed Shortest - Path Algorithm | en_US |
dc.type | text | en |
dc.type | Proceedings | en |
dc.contributor.department | Massachusetts Institute of Technology | en |
dc.identifier.journal | International Telemetering Conference Proceedings | en |
dc.description.collectioninformation | Proceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection. | en |
refterms.dateFOA | 2018-04-26T10:33:10Z | |
html.description.abstract | The problem of routing in a data network is often treated by assigning traffic dependent lengths to the links of the network and routing traffic from node i to node j along the shortest path from i to j . We present a distributed algorithm in which the nodes cooperate to find all shortest paths. It runs asynchronously in every node and does not require the network topology, or even the number of nodes in the network, to be known a priori by the nodes. |