Efficient routing in networks with long range contacts (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2180, Issue , 2001, Pages 270-284

  Barrière, Lali ^a   Fraigniaud, Pierre ^b   Kranakis, Evangelos ^c   Krizanc, Danny ^d  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITÉ PARIS SACLAY   (France)

^c CARLETON UNIVERSITY   (Canada)

^d WESLEYAN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; NETWORK ROUTING; TOPOLOGY;

DISTRIBUTED ROUTING PROTOCOLS; EFFICIENT ROUTING; EXTENDED ABSTRACTS; HARMONIC DISTRIBUTION; LONG RANGE CONTACTS; SMALL WORLD PHENOMENON; UNDERLYING NETWORKS; UPPER AND LOWER BOUNDS;

PROBABILITY DISTRIBUTIONS;

EID: 84957020501     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45414-4_19     Document Type: Conference Paper

References (18)

1. 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.
2. B. Bollobas, “Random graphs”, Academic Press, 1985.
3. B. Bollobas and F. Chung, “The Diameter of a Cycle Plus a Random Matching”, SIAM Journal on Discrete Mathematics 1:328-333, 1988.
4. 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.
5. F. Chung and M. Garey, “Diameter Bounds for Altered Graphs”, Journal of Graph Theory, 8:511-534, 1984.
6. 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.
7. B. Hayes, “Graph Theory in Practice: Part I”, American Scientist, January- February, Vol. 88, No. 1, 2000.
8. B. Hayes, “Graph Theory in Practice: Part II”, American Scientist, March-April, Vol. 88, No. 2, 2000.
9. R. Karp, “Probabilistic Recurrence Relations”, in Proceedings of 23rd Annual Symposium on Theory of Computing, pages 190-197, 1991.
10. R. Karp, E. Upfal, and A. Wigderson, “Constructing a Perfect Matching is in Random NC”, Combinatorica, 6:35-48, 1986.
11. J. Kleinberg, “The Small-World Phenomenon: An Algorithmic Perspective”, in 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000.
12. 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.
13. D. Knuth, “The Art of Computer Programming: Sorting and Searching”, Vol. 3, 2nd edition, Addison-Wesley, 1998.
14. R. Motwani and P. Raghavan, “Randomized Algorithms”, Cambridge University Press, 1995.
15. S. Ross, “Stochastic Processes”, 2nd ed., John Wiley and Sons, 1996.
16. D. Watts, “Small World: The Dynamics of Networks between Order and Randomness”, Princeton University Press, 1999.
17. D. Watts and S. Strogatz, “Collective Dynamics of Small-World Networks”, Nature 393:440-442, 1998.
18. G. K. Zipf, “Human Behavior and the Principle of Least Effort”, Addison Wesley, Cambridge MA, 1949, Reprint New York, Hefner, 1972.