Low-congested interval routing schemes for hypercubelike networks

DOI10.1002/1097-0037(200010)36:3%3C191::AID-NET6%3E3.0.CO;2-KMaRDI QIDQ4520243zbMATH OpenOpenAlexFDO

Authors Serafino Cicerone, Gabriele Di Stefano, Michele Flammini

Publication date 12 December 2000

Full work available at URL https://doi.org/10.1002/1097-0037(200010)36:3%3C191::aid-net6%3E3.0.co;2-k

zbMATH Keywords

congestionedge-forwarding indexcube-connected cycleinterval routing

Mathematics Subject Classification ID

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

Recommendations

• Static and dynamic low-congested interval routing schemes
• Multidimensional interval routing schemes
• The complexity of shortest path and dilation bounded interval routing
• scientific article; zbMATH DE number 2206367
• scientific article; zbMATH DE number 1760012

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 1256753 (Why is no real title available?)
• scientific article; zbMATH DE number 1340884 (Why is no real title available?)
• scientific article; zbMATH DE number 1760012 (Why is no real title available?)
• scientific article; zbMATH DE number 1424540 (Why is no real title available?)
• A survey on interval routing
• Complexity of the Forwarding Index Problem
• Designing networks with compact routing tables
• Expanding and forwarding
• Interval Routing
• Labelling and Implicit Routing in Networks
• On Multi-Label Linear Interval Routing Schemes
• On forwarding indices of networks
• The Complexity of Interval Routing on Random Graphs
• The forwarding index of communication networks
• Worst Case Bounds for Shortest Path Interval Routing

Cited in

(3)

• Static and dynamic low-congested interval routing schemes
• A conflict sense routing protocol and its performance for hypercubes
• scientific article; zbMATH DE number 1775423 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520243)