1325 search results - page 78 / 265 » Quasirandom Load Balancing |
CORR
2012
Springer
12 years 3 months ago
2012
Springer
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
MSS
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we present a parallel transmission architecture for SAN. By using two schedulers on the destination and source addresses of packets, the load of multiple data flows...
ICALP
2003
Springer
14 years 28 days ago
2003
Springer
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
KIVS
2005
Springer
14 years 1 months ago
2005
Springer
: We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distri...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—For energy conservation, a wireless sensor network is usually designed to work in a low-duty-cycle mode, in which a sensor node keeps active for a small percentage of time durin...