Interval routing in some planar networks.
From MaRDI portal
Publication:1401175
DOI10.1016/S0304-3975(02)00067-1zbMath1044.68007MaRDI QIDQ1401175
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
68M10: Network design and communication in computer systems
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Designing networks with compact routing tables
- A survey on interval routing
- Decomposition and \(l_1\)-embedding of weakly median graphs
- The complexity of the characterization of networks supporting shortest-path interval routing.
- Cellular bipartite graphs
- Graphs of some CAT(0) complexes
- Distance-preserving subgraphs of hypercubes
- Improved routing strategies with succinct tables
- Space-Efficient Message Routing inc-Decomposable Networks
- Interval Routing
- Interval Routing onk-Trees
- A trade-off between space and efficiency for routing tables
- Deadlock-free interval routing schemes
- Geometry of cuts and metrics
- Interval routing schemes