1061 search results - page 6 / 213 » On Compact Routing for the Internet |
ITCC
2003
IEEE
14 years 3 months ago
2003
IEEE
In this paper, a new algorithm to route traffic efficiently is proposed. The proposed algorithm finds additional routes to the destination and identifies the critical links in the...
GLOBECOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— This paper studies the contributions of routing dynamics to the duration of long-lived end-to-end Internet path failures. Studies have shown that end-to-end Internet failures (...
PODC
2004
ACM
14 years 3 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...
SPAA
2003
ACM
14 years 3 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...
WDAG
2009
Springer
14 years 4 months 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...