TY - JOUR

T1 - Universal augmentation schemes for network navigability

AU - Fraigniaud, Pierre

AU - Gavoille, Cyril

AU - Kosowski, Adrian

AU - Lebhar, Emmanuelle

AU - Lotker, Zvi

N1 - Funding Information:
This work was partially done while Zvi Lotker was visiting LRI at University Paris Sud, supported by the COST Action 295 ‘‘DYNAMO’’, and while Adrian Kosowski was visiting LaBRI at University of Bordeaux, also supported by the COST Action 295 ‘‘DYNAMO’’.

PY - 2009/5/17

Y1 - 2009/5/17

N2 - Augmented graphs were introduced for the purpose of analyzing the "six degrees of separation between individuals" observed experimentally by the sociologist Standley Milgram in the 60's. We define an augmented graph as a pair (G, M) where G is an n-node graph with nodes labeled in {1, ..., n}, and M is an n × n stochastic matrix. Every node u ∈ V (G) is given an extra link, called a long range link, pointing to some node v, called the long range contact of u. The head v of this link is chosen at random by Pr {u → v} = Mu, v. In augmented graphs, greedy routing is the oblivious routing process in which every intermediate node chooses from among all its neighbors (including its long range contact) the one that is closest to the target according to the distance measured in the underlying graph G, and forwards to it. The best augmentation scheme known so far ensures that, for any n-node graph G, greedy routing performs in O (sqrt(n)) expected number of steps. Our main result is the design of an augmentation scheme that overcomes the O (sqrt(n)) barrier. Precisely, we prove that for any n-node graph G whose nodes are arbitrarily labeled in {1, ..., n}, there exists a stochastic matrix M such that greedy routing in (G, M) performs in over(O, ̃) (n1 / 3), where the over(O, ̃) notation ignores the polylogarithmic factors. We prove additional results when the stochastic matrix M is universal to all graphs. In particular, we prove that the O (sqrt(n)) barrier can still be overcame for large graph classes even if the matrix M is universal. This however requires an appropriate labeling of the nodes. If the node labeling is arbitrary, then we prove that the O (sqrt(n)) barrier cannot be overcome with universal matrices.

AB - Augmented graphs were introduced for the purpose of analyzing the "six degrees of separation between individuals" observed experimentally by the sociologist Standley Milgram in the 60's. We define an augmented graph as a pair (G, M) where G is an n-node graph with nodes labeled in {1, ..., n}, and M is an n × n stochastic matrix. Every node u ∈ V (G) is given an extra link, called a long range link, pointing to some node v, called the long range contact of u. The head v of this link is chosen at random by Pr {u → v} = Mu, v. In augmented graphs, greedy routing is the oblivious routing process in which every intermediate node chooses from among all its neighbors (including its long range contact) the one that is closest to the target according to the distance measured in the underlying graph G, and forwards to it. The best augmentation scheme known so far ensures that, for any n-node graph G, greedy routing performs in O (sqrt(n)) expected number of steps. Our main result is the design of an augmentation scheme that overcomes the O (sqrt(n)) barrier. Precisely, we prove that for any n-node graph G whose nodes are arbitrarily labeled in {1, ..., n}, there exists a stochastic matrix M such that greedy routing in (G, M) performs in over(O, ̃) (n1 / 3), where the over(O, ̃) notation ignores the polylogarithmic factors. We prove additional results when the stochastic matrix M is universal to all graphs. In particular, we prove that the O (sqrt(n)) barrier can still be overcame for large graph classes even if the matrix M is universal. This however requires an appropriate labeling of the nodes. If the node labeling is arbitrary, then we prove that the O (sqrt(n)) barrier cannot be overcome with universal matrices.

KW - Informative labeling schemes

KW - Routing

KW - Small world phenomenon

UR - http://www.scopus.com/inward/record.url?scp=64549160205&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2008.12.061

DO - 10.1016/j.tcs.2008.12.061

M3 - Article

AN - SCOPUS:64549160205

VL - 410

SP - 1970

EP - 1981

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 21-23

ER -