scientific article; zbMATH DE number 4119974

MaRDI QIDQ4733694zbMATH OpenFDO

Authors Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg

Publication date 1989

zbMATH Keywords

arbitrary edge costscommunication networkhierarchical schemesrouting schemestretch factor

Mathematics Subject Classification ID

Theory of operating systems (68N25) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Communication theory (94A05)

Recommendations

• A trade-off between space and efficiency for routing tables
• Routing with Polynomial Communication-Space Trade-Off
• Compact name-independent routing with minimum stretch
• Improved routing strategies with succinct tables
• Compact Routing with Name Independence

Cited in

(30)

• Designing networks with compact routing tables
• On sparse spanners of weighted graphs
• Compact routing messages in self-healing trees
• The compactness of adaptive routing tables
• Name-independent compact routing in trees
• Distributed distance computation and routing with small messages
• Improved routing strategies with succinct tables
• scientific article; zbMATH DE number 4203676 (Why is no real title available?)
• Space-Efficient Message Routing inc-Decomposable Networks
• Compact Multicast Routing
• Virtual Ring Routing Trends
• Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
• Routing with Polynomial Communication-Space Trade-Off
• Prefix routing schemes in dynamic networks
• scientific article; zbMATH DE number 1756017 (Why is no real title available?)
• A complete characterization of the path layout construction problem for ATM networks with given hop count and load
• A trade-off between space and efficiency for routing tables
• Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
• Generating sparse spanners for weighted graphs
• Compact and localized distributed data structures
• Viceroy, a scalable and dynamic emulation of the butterfly
• Near-optimal distributed routing with low memory
• Distributed Routing in Tree Networks with Few Landmarks
• Compact Routing with Name Independence
• Compact roundtrip routing with topology-independent node names
• Interval routing schemes
• Multi-dimensional Interval Routing Schemes
• Certification of compact low-stretch routing schemes
• Compact routing schemes for dynamic ring networks
• Average stretch analysis of compact routing schemes

This page was built for publication:

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