Characterization of networks supporting multi-dimensional linear interval routing schemes

DOI10.1016/J.TCS.2004.06.013MaRDI QIDQ703538zbMATH OpenOpenAlexFDO

Authors Yashar Ganjali, Mohammad T. Hajiaghayi

Publication date 11 January 2005

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

Full work available at URL https://doi.org/10.1016/j.tcs.2004.06.013

zbMATH Keywords

Computer networksCharacterizationGraph theoryInterval routing schemesMulti-dimensional

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Multidimensional interval routing schemes
• scientific article; zbMATH DE number 2172795
• On the complexity of multi-dimensional interval routing schemes
• Partial characterizations of networks supporting shortest path interval labeling schemes
• Interval routing schemes

Cites work

• scientific article; zbMATH DE number 2172795 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• A characterization of networks supporting linear interval routing
• A survey on interval routing
• Designing networks with compact routing tables
• Efficient Message Routing in Planar Networks
• Graph theory
• Improved routing strategies with succinct tables
• Interval Routing
• Interval routing schemes
• Labelling and Implicit Routing in Networks
• Multidimensional interval routing schemes
• Partial characterizations of networks supporting shortest path interval labeling schemes

Cited in

(2)

• scientific article; zbMATH DE number 2172795 (Why is no real title available?)
• Multi-dimensional Interval Routing Schemes

This page was built for publication: Characterization of networks supporting multi-dimensional linear interval routing schemes

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