Show simple item record

dc.contributor.authorHumblet, Pierre A.
dc.date.accessioned2016-05-18T22:50:15Z
dc.date.available2016-05-18T22:50:15Z
dc.date.issued1978-11
dc.identifier.issn0884-5123
dc.identifier.issn0074-9079
dc.identifier.urihttp://hdl.handle.net/10150/609766
dc.descriptionInternational Telemetering Conference Proceedings / November 14-16, 1978 / Hyatt House Hotel, Los Angeles, Californiaen_US
dc.description.abstractThe 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.sponsorshipInternational Foundation for Telemeteringen
dc.language.isoen_USen
dc.publisherInternational Foundation for Telemeteringen
dc.relation.urlhttp://www.telemetry.org/en
dc.rightsCopyright © International Foundation for Telemeteringen
dc.titleA Distributed Shortest - Path Algorithmen_US
dc.typetexten
dc.typeProceedingsen
dc.contributor.departmentMassachusetts Institute of Technologyen
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.description.collectioninformationProceedings 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.dateFOA2018-04-26T10:33:10Z
html.description.abstractThe 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.


Files in this item

Thumbnail
Name:
ITC_1978_78-03-3.pdf
Size:
108.6Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record