Multidimensional interval routing schemes
From MaRDI portal
Recommendations
Cites work
- A trade-off between space and efficiency for routing tables
- Counting sequences
- Designing networks with compact routing tables
- Efficient Message Routing in Planar Networks
- scientific article; zbMATH DE number 3940741 (Why is no real title available?)
- scientific article; zbMATH DE number 4085576 (Why is no real title available?)
- Improved routing strategies with succinct tables
- Interval Routing
- Interval routing schemes
- Labelling and Implicit Routing in Networks
- On Multi-Label Linear Interval Routing Schemes
- Space-Efficient Message Routing inc-Decomposable Networks
- The complexity of interval routing on random graphs
Cited in
(16)- Ordered interval routing schemes
- Interval routing in some planar networks.
- A survey on interval routing
- On the complexity of multi-dimensional interval routing schemes
- Static and dynamic low-congested interval routing schemes
- FIR: an efficient routing strategy for tori and meshes
- Characterization results of all shortest paths interval routing schemes
- Low-congested interval routing schemes for hypercubelike networks
- scientific article; zbMATH DE number 2172795 (Why is no real title available?)
- scientific article; zbMATH DE number 1424540 (Why is no real title available?)
- Deadlock-free interval routing schemes
- Compact and localized distributed data structures
- A fault-tolerant routing scheme in dynamic networks
- Multi-dimensional Interval Routing Schemes
- Characterization of networks supporting multi-dimensional linear interval routing schemes
- Average stretch analysis of compact routing schemes
This page was built for publication: Multidimensional interval routing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1275073)