Compact Routing with Minimum Stretch

Compact Routing with Minimum Stretch (0)

Cached

Download Links

[www.cs.jhu.edu]

Other Repositories/Bibliography

DBLP

by Lenore Cowen

Venue:	Journal of Algorithms
Citations:	90 - 5 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Compact Routing with Minimum Stretch	user correction - Legacy Corrections
AUTHOR NAME	Lenore Cowen	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Mathematical Sciences; Department of Computer Science; Johns Hopkins University	user correction - Legacy Corrections
AUTHOR ADDR	Baltimore, MD 21218	user correction - Legacy Corrections
ABSTRACT	We present the first universal compact routing algorithm with maximum stretch bounded by 3 that uses sublinear space at every vertex. The algorithm uses local routing tables of size O(n 2=3 log 4=3 n) and achieves paths that are most 3 times the length of the shortest path distances for all nodes in an arbitrary weighted undirected network. This answers an open question of Gavoille and Gengler who showed that any universal compact routing algorithm with maximum stretch strictly less than 3 must use\Omega\Gamma n) local space at some vertex. 1 Introduction Let G = (V; E) with jV j = n be a labeled undirected network. Assuming that a positive cost, or distance is assigned with each edge, the stretch of path p(u; v) from node u to node v is defined as jp(u;v)j jd(u;v)j , where jd(u; v)j is the length of the shortest u \Gamma v path. The approximate all-pairs shortest path problem involves a tradeoff of stretch against time-- short paths with stretch bounded by a constant are com...	user correction - Legacy Corrections
YEAR	0	user correction - Legacy Corrections
VENUE	Journal of Algorithms	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	255--260	INFERENCE
VOLUME	38	INFERENCE
CITATIONS	22 found	ParsCit 1.0