1434 search results - page 161 / 287 » Distributed Computing with Imperfect Randomness |
129
click to vote
SPAA
1994
ACM
15 years 3 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
BIRTHDAY
2009
Springer
15 years 6 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
ICNS
2009
IEEE
15 years 6 months ago
2009
IEEE
What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is ...
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper studies cluster load balancing policies and system support for fine-grain network services. Load balancing on a cluster of machines has been studied extensively in the...