A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Journal of Algorithms
The Compactness of Interval Routing
SIAM Journal on Discrete Mathematics
Theoretical Computer Science
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
The Compactness of Interval Routing for Almost All Graphs
SIAM Journal on Computing
Improved Compact Routing Scheme for Chordal Graphs
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Routing in Networks with Low Doubling Dimension
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Greedy routing in tree-decomposed graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Ultimate generalizations of LexBFS and LEX m
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Distributed computing of efficient routing schemes in generalized chordal graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Simulating Routing Schemes on Large-Scale Topologies
PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
Distributed computing of efficient routing schemes in generalized chordal graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Hi-index | 0.00 |
Efficient algorithms for computing routing tables should take advantage of the particular properties arising in large scale networks. There are in fact at least two properties that any routing scheme must consider: low (logarithmic) diameter and high clustering coefficient. High clustering coefficient implies the existence of few large induced cycles. Therefore, we propose a routing scheme that computes short routes in the class of k-chordal graphs, i.e., graphs with no chordless cycles of length more than k. We study the tradeoff between the length of routes and the time complexity for computing them. In the class of k-chordal graphs, our routing scheme achieves an additive stretch of at most k−1, i.e., for all pairs of nodes, the length of the route never exceeds their distance plus k−1. In order to compute the routing tables of any n-node graph with diameter D we propose a distributed algorithm which uses O(logn)-bit messages and takes O(D) time. We then propose a slightly modified version of the algorithm for computing routing tables in time O( min {ΔD , n}), where Δ is the the maximum degree of the graph. Using these tables, our routing scheme achieves a better additive stretch of 1 in chordal graphs (notice that chordal graphs are 3-chordal graphs). The routing scheme uses addresses of size logn bits and local memory of size 2(d−1) logn bits in a node of degree d.