Interval routing schemes

DOI10.1007/BF01944351zbMath0860.68014MaRDI QIDQ5916403

S. Salomone, Michele Flammini, Giorgio Gambosi

Publication date: 29 January 1997

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

shortest pathsdistributed networkrouting messages

Mathematics Subject Classification ID

Computer system organization (68M99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (13)

Deadlock-free interval routing schemes ⋮ All-shortest-path 2-interval routing is NP-complete ⋮ On devising Boolean Routing Schemes ⋮ The parameterized complexity of stabbing rectangles ⋮ Compact and localized distributed data structures ⋮ Modeling recreational systems using optimization techniques and information technologies ⋮ Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices ⋮ On the hardness of minimizing space for all-shortest-path interval routing schemes ⋮ Characterization results of all shortest paths interval routing schemes ⋮ Multidimensional interval routing schemes ⋮ Ordered interval routing schemes ⋮ A note on the consecutive ones submatrix problem. ⋮ Static and dynamic low-congested interval routing schemes

Cites Work

• Unnamed Item
• 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
• Interval Routing
• Efficient Message Routing in Planar Networks
• Stochastic performance evaluation of hierarchical routing for large networks
• Optimal clustering structures for hierarchical topological design of large computer networks
• Routing with Polynomial Communication-Space Trade-Off
• Interval routing schemes
• A trade-off between space and efficiency for routing tables
• A characterization of networks supporting linear interval routing

This page was built for publication: Interval routing schemes