Lali Barrière, Pierre Fraigniaud, Evangelos Kranakis, Danny Krizanc  Home/Search
Context Related
| lri.fr/~pierre/POSTSCRIPTS/disc01.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lri.fr/~pierre/...biblio_par_date (more) Homepages: P.Fraigniaud |
Rate this article:      (best)Comment on this article |
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. To model the vagueness of this knowledge, this extra link is set up randomly according to some probability distributions p. Long Range Contact... (Update)
Cited by: More
GeoPeer: A Location-Aware Peer-To-Peer System - Araujo, Rodrigues (2003) (Correct)
Similar documents (at the sentence level):
45.9%: Efficient Routing in Networks with Long Range Contacts.. - Barrière, al. (2001) (Correct)
Active bibliography (related documents): More All
0.1: The Structure and Function of Complex Networks - Newman (2003) (Correct)
0.1: Graph Theory in Practice: Part II - Hayes (1992) (Correct)
0.1: The Small-World Phenomenon: An Algorithmic Perspective - Kleinberg (2000) (Correct)
Similar documents based on text: More All
0.3: Robust Position-Based Routing in Wireless Ad Hoc.. - Barrière.. (2001) (Correct)
0.3: Strategies for Hotlink Assignments - Bose, Czyzowicz, Gasieniec.. (2000) (Correct)
0.3: Random Constraint Satisfaction: A More Accurate Picture - Achlioptas, Kirousis.. (1997) (Correct)
BibTeX entry: (Update)
L. Barri ere, P. Fraigniaud, E. Kranakis, and D. Krizanc, "Efficient routing in networks with long range contacts (extended abstract)," in 15th Internation Conference on Distributed Computing, ser. Lecture Notes in Computer Science, J. Welch, Ed., no. LNCS 2180. Lisbon, Portugal: Springer, October 2001. http://citeseer.ist.psu.edu/ere01efficient.html More
@article{ barriere01efficient,
author = "Lali Barri{\`e}re and Pierre Fraigniaud and Evangelos Kranakis and Danny Krizanc",
title = "Efficient Routing in Networks with Long Range Contacts",
journal = "Lecture Notes in Computer Science",
volume = "2180",
pages = "270+",
year = "2001",
url = "citeseer.ist.psu.edu/ere01efficient.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan et al. - 1995
375 On Power-Law Relationships of the Internet Topology - Faloutsos, Faloutsos et al. - 1999
331 Stochastic Processes (context) - Ross - 1996
283 Random graphs (context) - Bollobas - 1985
188 Collective Dynamics of Small-World Networks (context) - Watts, Strogatz - 1998
157 The Art of Computer Programming: Sorting and Searching (context) - Knuth - 1998
140 Graph Structure in the Web (context) - Broder, Kumar et al. - 2000
104 A Random Graph Model for Massive Graphs - Aiello, Chung et al. - 2000
96 The Small-World Phenomenon: An Algorithmic Perspective - Kleinberg - 2000
72 The Web as a Graph: Measurements (context) - Kleinberg, Kumar et al. - 1999
70 Small World: The Dynamics of Networks between Order and Rand.. (context) - Watts - 1999
41 Constructing a Perfect Matching is in Random NC (context) - Karp, Upfal et al. - 1986
40 Probabilistic Recurrence Relations (context) - Karp - 1991
36 Human Behavior and the Principle of Least E ort (context) - Zipf - 1949
20 Graph Theory in Practice: Part II - Hayes - 2000
12 The Diameter of a Cycle Plus a Random Matching (context) - Bollobas, Chung - 1988
11 Diameter Bounds for Altered Graphs (context) - Chung, Garey - 1984
10 Graph Theory in Practice: Part - Hayes - 2000
Documents on the same site (http://www.lri.fr/~pierre/ma_biblio_par_date.html): More
A General Theory for Deadlock Avoidance in Wormhole-Routed.. - Fraigniaud (1998) (Correct)
Strategies for Path-Based Multicasting in Wormhole-Routed.. - Fleury, Fraigniaud (1997) (Correct)
Hierarchical Broadcast Networks - Fraigniaud (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC