Designing networks with compact routing tables
From MaRDI portal
Publication:1104109
DOI10.1007/BF01762113zbMath0646.68087MaRDI QIDQ1104109
Greg N. Frederickson, Ravi Janardan
Publication date: 1988
Published in: Algorithmica (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10)
Related Items
An optimal message routing algorithm for double-loop networks, Deadlock-free interval routing schemes, Efficient parallel algorithms for shortest paths in planar graphs, Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems, Searching among intervals and compact routing tables, Efficient distributed algorithms for single-source shortest paths and related problems on plane networks, Searching among intervals and compact routing tables, Average stretch analysis of compact routing schemes, Minimum cycle bases of weighted outerplanar graphs, On interval routing schemes and treewidth, On devising Boolean Routing Schemes, Algorithmic graph embeddings, Optimal layouts on a chain ATM network, Multi-dimensional Interval Routing Schemes, On Interval Routing Schemes and treewidth, Interval routing in some planar networks., On multi-label linear interval routing schemes, Unnamed Item, Interval Routing Schemes for Circular-Arc Graphs, On the efficiency of routing in sensor networks, Interval routing schemes allow broadcasting with linear message-complexity, Compact and localized distributed data structures, Characterization results of all shortest paths interval routing schemes, Efficient parallel algorithms for shortest paths in planar digraphs, Algorithmic graph embeddings, Graphs with bounded induced distance, Representing graphs implicitly using almost optimal space, Characterization of networks supporting multi-dimensional linear interval routing schemes, Unnamed Item, Interval routing schemes, Low-congested interval routing schemes for hypercubelike networks, Compact policy routing, Multidimensional interval routing schemes, Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems, A survey on interval routing, Ordered interval routing schemes, The complexity of the characterization of networks supporting shortest-path interval routing., Static and dynamic low-congested interval routing schemes, Graph theoretical issues in computer networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implicit data structures for fast search and update
- Labelling and Implicit Routing in Networks
- Interval Routing
- Space-efficient and fault-tolerant message routing in outerplanar networks
- A Separator Theorem for Planar Graphs
- Implicit Data Structures for the Dictionary Problem
- Approximation Algorithms for Some Postman Problems
- A Theorem on Boolean Matrices
