417 search results - page 37 / 84 » A randomized algorithm for the joining protocol in dynamic d... |
SPAA
1994
ACM
14 years 27 days 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...
INFOCOM
2011
IEEE
13 years 16 days ago
2011
IEEE
—Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation sche...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
RSA
2000
13 years 8 months ago
2000
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
ICPP
2000
IEEE
14 years 12 days ago
2000
IEEE
The idle computers on a local area, campus area, or even wide area network represent a significant computational resource--one that is, however, also unreliable, heterogeneous, an...