102 search results - page 4 / 21 » Compact Forbidden-Set Routing |
137
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
134
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...
156
click to vote
WDAG
2009
Springer
16 years 11 days ago
2009
Springer
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
125
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...