The compactness of adaptive routing tables

DOI10.1016/S1570-8667(03)00027-3zbMath1100.68002MaRDI QIDQ1827290

Cyril Gavoille, Akka Zemmari

Publication date: 6 August 2004

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

Adaptive routing; Compact routing tables; Interval routing

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68M10: Network design and communication in computer systems

Related Items

Ordered interval routing schemes, All-shortest-path 2-interval routing is NP-complete

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compact routing on chordal rings of degree 4
• On devising Boolean Routing Schemes
• The complexity of shortest path and dilation bounded interval routing
• A survey on interval routing
• On the complexity of multi-dimensional interval routing schemes
• The complexity of the characterization of networks supporting shortest-path interval routing.
• Characterization results of all shortest paths interval routing schemes
• Memory requirement for routing in distributed networks
• Labelling and Implicit Routing in Networks
• Space-Efficient Message Routing inc-Decomposable Networks
• Interval Routing
• The Complexity of Interval Routing on Random Graphs
• Worst Case Bounds for Shortest Path Interval Routing
• Lower bounds for compact routing
• The Compactness of Interval Routing
• A trade-off between space and efficiency for routing tables
• Interval routing schemes