The compactness of adaptive routing tables

DOI10.1016/S1570-8667(03)00027-3MaRDI QIDQ1827290zbMATH OpenFDO

Authors Cyril Gavoille, A. Zemmari

Publication date 6 August 2004

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

zbMATH Keywords

Adaptive routingCompact routing tablesInterval routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)

Recommendations

• The Compactness of Interval Routing
• Compact routing for flat networks
• scientific article; zbMATH DE number 3940741
• Lower bounds for compact routing (extended abstract)
• Publication:4733694

Cites work

• scientific article; zbMATH DE number 3940741 (Why is no real title available?)
• scientific article; zbMATH DE number 1340883 (Why is no real title available?)
• scientific article; zbMATH DE number 1517100 (Why is no real title available?)
• A survey on interval routing
• A trade-off between space and efficiency for routing tables
• Characterization results of all shortest paths interval routing schemes
• Compact routing on chordal rings of degree 4
• Interval Routing
• Interval routing schemes
• Labelling and Implicit Routing in Networks
• Lower bounds for compact routing (extended abstract)
• Memory requirement for routing in distributed networks
• On devising Boolean Routing Schemes
• On the complexity of multi-dimensional interval routing schemes
• Space-Efficient Message Routing inc-Decomposable Networks
• The Compactness of Interval Routing
• The Complexity of Interval Routing on Random Graphs
• The complexity of shortest path and dilation bounded interval routing
• The complexity of the characterization of networks supporting shortest-path interval routing.
• Worst Case Bounds for Shortest Path Interval Routing

Cited in

(6)

• Compact Routing In Chordal Grids And Other Networks
• All-shortest-path 2-interval routing is NP-complete
• Searching among intervals and compact routing tables
• Ordered interval routing schemes
• Compressing two-dimensional routing tables
• On the complexity of compressing two dimensional routing tables with order

This page was built for publication: The compactness of adaptive routing tables

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