Low-congested interval routing schemes for hypercubelike networks

DOI<191::AID-NET6>3.0.CO;2-K 10.1002/1097-0037(200010)36:3<191::AID-NET6>3.0.CO;2-KzbMath1029.90015OpenAlexW2062019211MaRDI QIDQ4520243

Gabriele Di Stefano, Michele Flammini, Serafino Cicerone

Publication date: 12 December 2000

Full work available at URL: https://doi.org/10.1002/1097-0037(200010)36:3<191::aid-net6>3.0.co;2-k

zbMATH Keywords

congestionedge-forwarding indexcube-connected cycleinterval routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Designing networks with compact routing tables
• A survey on interval routing
• Expanding and forwarding
• On forwarding indices of networks
• The forwarding index of communication networks
• Complexity of the Forwarding Index Problem
• Labelling and Implicit Routing in Networks
• Interval Routing
• The Complexity of Interval Routing on Random Graphs
• Worst Case Bounds for Shortest Path Interval Routing
• On Multi-Label Linear Interval Routing Schemes

This page was built for publication: Low-congested interval routing schemes for hypercubelike networks