Multidimensional interval routing schemes

DOI10.1016/S0304-3975(97)00070-4zbMath0913.68087MaRDI QIDQ1275073

Richard B. Tan, Michele Flammini, Giorgio Gambosi, Umberto Nanni

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

dimensionsinterconnection networksproduct graphsinterval routing schemescompact routing methods

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items

Average stretch analysis of compact routing schemes ⋮ Compact and localized distributed data structures ⋮ Characterization results of all shortest paths interval routing schemes ⋮ Characterization of networks supporting multi-dimensional linear interval routing schemes ⋮ A survey on interval routing ⋮ On the complexity of multi-dimensional interval routing schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Designing networks with compact routing tables
• Improved routing strategies with succinct tables
• Labelling and Implicit Routing in Networks
• Space-Efficient Message Routing inc-Decomposable Networks
• The complexity of interval routing on random graphs
• Interval Routing
• Efficient Message Routing in Planar Networks
• Counting sequences
• A trade-off between space and efficiency for routing tables
• On Multi-Label Linear Interval Routing Schemes
• Interval routing schemes