On the complexity of multi-dimensional interval routing schemes

DOI10.1016/S0304-3975(99)00284-4MaRDI QIDQ1575745zbMATH OpenOpenAlexWikidataFDO

Authors Peter Ružička, D. Štefankovič

Publication date 21 August 2000

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

Full work available at URL https://doi.org/10.1016/s0304-3975(99)00284-4

zbMATH Keywords

congestioninterconnection networksinterval routingspace complexity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Multidimensional interval routing schemes
• Characterization of networks supporting multi-dimensional linear interval routing schemes
• Static and dynamic low-congested interval routing schemes
• Interval routing schemes

Cites work

• Compact routing schemes with low stretch factor
• Edge Separators of Planar and Outerplanar Graphs With Applications
• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• scientific article; zbMATH DE number 1760012 (Why is no real title available?)
• scientific article; zbMATH DE number 1361484 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Interval Routing
• Interval routing schemes
• Labelling and Implicit Routing in Networks
• Lower bounds for compact routing (extended abstract)
• Memory requirement for routing in distributed networks
• Memory requirement for universal routing schemes
• Multidimensional interval routing schemes
• On forwarding indices of networks
• On Multi-Label Linear Interval Routing Schemes
• The Complexity of Interval Routing on Random Graphs

Cited in

(14)

• Multidimensional interval routing schemes
• A survey on interval routing
• Static and dynamic low-congested interval routing schemes
• The complexity of routing with collision avoidance
• The compactness of adaptive routing tables
• The complexity of the characterization of networks supporting shortest-path interval routing.
• Searching among intervals and compact routing tables
• On the hardness of minimizing space for all-shortest-path interval routing schemes
• On the computational complexity of continuous routing
• scientific article; zbMATH DE number 2172795 (Why is no real title available?)
• scientific article; zbMATH DE number 1424540 (Why is no real title available?)
• Compact and localized distributed data structures
• Multi-dimensional Interval Routing Schemes
• Characterization of networks supporting multi-dimensional linear interval routing schemes

This page was built for publication: On the complexity of multi-dimensional interval routing schemes

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