527 search results - page 36 / 106 » Compact Multicast Routing |
136
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...
128
click to vote
PODC
2003
ACM
15 years 11 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...
197
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...
192
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
182
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...