In this paper, we bridge the gap in the study of compact routing schemes for power-law graphs. We provide the first theoretical analysis that directly links the ...

We analyze our adapted routing scheme based on the theory of unweighted random power-law graphs with fixed expected degree sequence by Aiello, Chung, and Lu.

Abstract. We present a universal routing scheme for unweighted, undirected networks that always routes a packet along a path.

Abstract. We present a universal routing scheme for unweighted, undirected networks that always routes a packet along a path.

We analyze our adapted routing scheme based on the theory of unweighted random power-law graphs with fixed expected degree sequence by Aiello, Chung, and Lu.

Compact routing schemes address the fundamental tradeoff between the memory space required to store the routing table entries and the length of the routing ...

Compact routing addresses the tradeoff between table sizes and stretch, which is the worst-case ratio between the length of the path a packet is routed ...

Sep 27, 2013 · We present a universal routing scheme for unweighted, undirected networks that always routes a packet along a path whose length is at most ...

Compact routing intends to achieve good tradeoff between the routing path length and the memory overhead, and is recently considered as a main alternative ...

Compact routing addresses the tradeoff between table sizes and stretch, which is the worst-case ratio be- tween the length of the path a packet is routed ...