Static and dynamic low-congested interval routing schemes

DOI10.1016/S0304-3975(01)00279-1zbMath1002.68002WikidataQ127972144 ScholiaQ127972144MaRDI QIDQ1605315

Michele Flammini, Gabriele Di Stefano, Serafino Cicerone

Publication date: 15 July 2002

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

zbMATH Keywords

congestioncompetitivenessinterval routing schemes

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Related Items (1)

A survey on interval routing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Designing networks with compact routing tables
• On the complexity of multi-dimensional interval routing schemes
• Expanding and forwarding
• On forwarding indices of networks
• The complexity of the characterization of networks supporting shortest-path interval routing.
• The forwarding index of communication networks
• Complexity of the Forwarding Index Problem
• Improved routing strategies with succinct tables
• Labelling and Implicit Routing in Networks
• The complexity of interval routing on random graphs
• Interval Routing
• Efficient Message Routing in Planar Networks
• Forwarding indices of consistent routings and their complexity
• A trade-off between space and efficiency for routing tables
• On Multi-Label Linear Interval Routing Schemes
• A characterization of networks supporting linear interval routing
• Interval routing schemes
• Interval routing schemes

This page was built for publication: Static and dynamic low-congested interval routing schemes