Abstract
We investigate the notion of Long Range Contact graphs. Roughly speaking, such a graph is defined by (1) an underlying network topology G, and (2) one (or possibly more) extra link connecting every node u to a “long distance” neighbor, called the long range contact of u. This extra link represents the a priori knowledge that a node has about far nodes and is set up randomly according to some probability distributions p. To illustrate the claim that Long Range Contact graphs are a good model for the small world phenomenon, we study greedy routing in these graphs. Greedy routing is the distributed routing protocol in which a node u makes use of its long range contact to progress toward a target, if this contact is closer to the target, than the other neighbors. We give upper and lower bounds on greedy routing on the n-node ring C n augmented with links chosen using the r-harmonic distributions. In particular, we show a tight Θ(log2 n)-bound for the expected number of steps required for routing in C n augmented using the 1-harmonic distribution. Hence, our study shows that the model of Kleinberg [11] can be simplified by using the ring rather than the mesh while preserving the main features of the model. Our study also demonstrates the signifi- cant difference (in term of both diameter and routing) between the ring augmented with long range contacts chosen with the harmonic distribution and the ring augmented with a random matching as introduced by Bollobas and Chung [3]. Finally, using epimorphisms of a graph onto another, for any network G, we show how to define a probability distribution p and study the performance of greedy routing in G augmented with p. For appropriate embeddings (if they exist), this performance turns out to be O(log2 n).
Part of this work was done while the first and third author were visiting LRI at Orsay (additional support from Université Paris-Sud), and while the first and second authors were visiting Carleton University. Additional support from Carleton University, NATO, and MITACS(Mathematics of Information Technology and Complex Systems) grants.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. Aiello, F. Chung, and L. Lu, “A Random Graph Model for Massive Graphs”, in 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000.
B. Bollobas, “Random graphs”, Academic Press, 1985.
B. Bollobas and F. Chung, “The Diameter of a Cycle Plus a Random Matching”, SIAM Journal on Discrete Mathematics 1:328–333, 1988.
A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, J. Wiener, “Graph Structure in the Web”, in 9th International World Wide Web Conference, Amsterdam, May 15-19, 2000.
F. Chung and M. Garey, “Diameter Bounds for Altered Graphs”, Journal of Graph Theory, 8:511–534, 1984.
M. Faloutsos, P. Faloutsos, C. Faloutsos, “On Power-Law Relationships of the Internet Topology”, in ACM annual Technical Conference of the Special Interest Group on Data Communication (SIGCOMM), 1999.
B. Hayes, “Graph Theory in Practice: Part I”, American Scientist, January-February, Vol. 88, No. 1, 2000.
B. Hayes, “Graph Theory in Practice: Part II”, American Scientist, March-April, Vol. 88, No. 2, 2000.
R. Karp, “Probabilistic Recurrence Relations”, in Proceedings of 23rd Annual Symposium on Theory of Computing, pages 190–197, 1991.
R. Karp, E. Upfal, and A. Wigderson, “Constructing a Perfect Matching is in Random NC”, Combinatorica, 6:35–48, 1986.
J. Kleinberg, “The Small-World Phenomenon: An Algorithmic Perspective”, in 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000.
J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, “The Web as a Graph: Measurements, Models, and Methods”, in 5th International Conference on Computing and Combinatorics, Tokyo, July 26-28, 1999.
D. Knuth, “The Art of Computer Programming: Sorting and Searching“, Vol. 3, 2nd edition, Addison-Wesley, 1998.
R. Motwani and P. Raghavan, “Randomized Algorithms”, Cambridge University Press, 1995.
S. Ross, “Stochastic Processes”, 2nd ed., John Wiley and Sons, 1996.
D. Watts, “Small World: The Dynamics of Networks between Order and Randomness”, Princeton University Press, 1999.
D. Watts and S. Strogatz, “Collective Dynamics of Small-World Networks”, Nature 393:440–442, 1998.
G. K. Zipf, “Human Behavior and the Principle of Least Effort”, Addison Wesley, Cambridge MA, 1949, Reprint New York, Hefner, 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlag Heidelberg
About this paper
Cite this paper
Barriére, L., Fraigniaud, P., Kranakis, E., Krizanc, D. (2001). Efficient Routing in Networks with Long Range Contacts. In: Welch, J. (eds) Distributed Computing. DISC 2001. Lecture Notes in Computer Science, vol 2180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45414-4_19
Download citation
DOI: https://doi.org/10.1007/3-540-45414-4_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42605-9
Online ISBN: 978-3-540-45414-4
eBook Packages: Springer Book Archive