625 search results - page 123 / 125 » Semi-preemptive routing on trees |
122
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
112
Voted
INFOCOM
2002
IEEE
15 years 5 months ago
2002
IEEE
Abstract— Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services...
111
Voted
IWQOS
2001
Springer
15 years 4 months ago
2001
Springer
— Efficient network provisioning mechanisms that support service differentiation and automatic capacity dimensioning are essential to the realization of the Differentiated Servi...
137
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...
124
click to vote
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...