625 search results - page 124 / 125 » Routing in Trees |
127
Voted
FOCS
1995
IEEE
15 years 3 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
115
Voted
ISPD
2007
ACM
15 years 1 months ago
2007
ACM
In this paper, we derive the X-half-perimeter wirelength (XHPWL) model for X-architecture placement and explore the effects of three different wire models on X-architecture plac...
NETWORKING
2008
15 years 1 months ago
2008
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
97
Voted
USITS
2003
15 years 1 months ago
2003
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
88
Voted
LISA
2000
15 years 1 months ago
2000
Most denial-of-service attacks are characterized by a flood of packets with random, apparently valid source addresses. These addresses are spoofed, created by a malicious program ...