13214 search results - page 261 / 2643 » Pseudorandomness for network algorithms |
148
click to vote
AIMS
2009
Springer
16 years 1 months ago
2009
Springer
Churn resilience is an important topic in DHT research. In this paper, I present techniques to improve churn resilience and their effects. All the techniques can be implemented i...
PODC
1987
ACM
15 years 10 months ago
1987
ACM
Abstract: We introduce the input-output automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular...
163
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...
136
click to vote
ICUMT
2009
15 years 4 months ago
2009
In this work, we study the NP-hard problem of maximizing lightpath reliability in optical mesh networks against simultaneous failures of multiple fiber links. The fiber links belo...
254
click to vote
QUESTA
2011
15 years 1 months ago
2011
Abstract We consider a system with N unit-service-rate queues in tandem, with exogenous arrivals of rate λ at queue 1, under a back-pressure (MaxWeight) algorithm: service at queu...