The compactness of adaptive routing tables
From MaRDI portal
Publication:1827290
DOI10.1016/S1570-8667(03)00027-3zbMATH Open1100.68002MaRDI QIDQ1827290FDOQ1827290
Authors: Cyril Gavoille, A. Zemmari 
Publication date: 6 August 2004
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Cites Work
- The Compactness of Interval Routing
- Space-Efficient Message Routing inc-Decomposable Networks
- Interval Routing
- A survey on interval routing
- Memory requirement for routing in distributed networks
- Labelling and Implicit Routing in Networks
- A trade-off between space and efficiency for routing tables
- Interval routing schemes
- Title not available (Why is that?)
- Worst Case Bounds for Shortest Path Interval Routing
- Title not available (Why is that?)
- Compact routing on chordal rings of degree 4
- The complexity of shortest path and dilation bounded interval routing
- The complexity of the characterization of networks supporting shortest-path interval routing.
- Characterization results of all shortest paths interval routing schemes
- The Complexity of Interval Routing on Random Graphs
- On devising Boolean Routing Schemes
- On the complexity of multi-dimensional interval routing schemes
- Title not available (Why is that?)
- Lower bounds for compact routing (extended abstract)
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)
