Compact Routing with Name Independence

DOI10.1137/04062053MaRDI QIDQ5757388zbMATH OpenOpenAlexFDO

Authors Marta Arias, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka, Lenore J. Cowen

Publication date 6 September 2007

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

compact routingname independencenetworksrouting tablestretch

Mathematics Subject Classification ID

Distance in graphs (05C12) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Recommendations

• Compact name-independent routing with minimum stretch
• A trade-off between space and efficiency for routing tables
• Publication:4733694
• Compact routing schemes with improved stretch
• Compact roundtrip routing with topology-independent node names

Cited in

(16)

• Designing networks with compact routing tables
• Sparse covers for planar graphs and graphs that exclude a fixed minor
• Name-independent compact routing in trees
• Optimal scale-free compact routing schemes in networks of low doubling dimension
• Improved routing strategies with succinct tables
• Compact Multicast Routing
• scientific article; zbMATH DE number 3940741 (Why is no real title available?)
• scientific article; zbMATH DE number 4119974 (Why is no real title available?)
• Scale-free compact routing schemes in networks of low doubling dimension
• Compact name-independent routing with minimum stretch
• Distributed Computing
• Compact policy routing
• Compact routing for flat networks
• Compact roundtrip routing with topology-independent node names
• Compact policy routing
• Certification of compact low-stretch routing schemes

This page was built for publication: Compact Routing with Name Independence

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