An improved interval routing scheme for almost all networks based on dominating cliques

Authors:
Martin Nehéz;Daniel Olejár
Affiliations:
Department of Computer Science and Engineering, FEE CTU Prague, Praha 2, Czech Republic;Department of Computer Science, FMPI, Comenius University in Bratislava, Bratislava, Slovak Republic
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 10
Cited 2

Interval routing

The Computer Journal
Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method

SIAM Journal on Computing
Kolmogorov Random Graphs and the Incompressibility Method

SIAM Journal on Computing
A survey on interval routing

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Compactness of Interval Routing for Almost All Graphs

SIAM Journal on Computing
Peer-to-Peer Membership Management for Gossip-Based Protocols

IEEE Transactions on Computers
Small k-Dominating Sets in Planar Graphs with Applications

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Probabilistic Reliable Dissemination in Large-Scale Systems

IEEE Transactions on Parallel and Distributed Systems
Interval routing in reliability networks

Theoretical Computer Science - Foundations of software science and computation structures

Threshold dominating cliques in random graphs and interval routing

Journal of Discrete Algorithms
A detailed study of the dominating cliques phase transition in random graphs

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by the peer-to-peer content sharing systems in large-scale networks, we will study interval routing schemes in Erdös-Rényi random graphs. C. Gavoille and D. Peleg [13] posed an open question of whether almost all networks support a shortest-path interval routing scheme with 1 interval. In this paper, we answer this question partially by proving that in almost all networks, there is an interval routing scheme with 1 interval up to additive stretch 2. Our proof is based on the properties of dominating cliques in random graphs.