34 search results - page 4 / 7 » Compact Routing in Power-Law Graphs |
PODC
2003
ACM
15 years 2 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
MSWIM
2009
ACM
15 years 4 months ago
2009
ACM
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis of the temporal connectivity graph of such networks reveals the existence of hu...
82
Voted
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
WG
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...