Distributed Multi-Destination Routing: The Constraints of Local Information

DOI10.1137/0214062MaRDI QIDQ3694713zbMATH OpenOpenAlexFDO

Authors Jeffrey M. Jaffe

Publication date 1985

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0214062

zbMATH Keywords

computer networksdistributed algorithmsspanning treesSteiner trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Bounding the locality of distributed routing algorithms
• Bounding the locality of distributed routing algorithms
• On the computational complexity of continuous routing
• scientific article; zbMATH DE number 3940741
• scientific article; zbMATH DE number 139789

Cited in

(8)

• Distributed multicast routing in point-to-point networks
• Bounding the locality of distributed routing algorithms
• A LOCAL INFORMATION-BASED ROUTING STRATEGY ON THE SCALE-FREE NETWORK
• An axiomatic approach to routing
• Bounding the locality of distributed routing algorithms
• Steiner shallow-light trees are exponentially lighter than spanning ones
• A note on distributed multicast routing in point-to-point networks
• Low-light trees, and tight lower bounds for Euclidean spanners

This page was built for publication: Distributed Multi-Destination Routing: The Constraints of Local Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694713)