Sciweavers

230 search results - page 37 / 46
» Fair and efficient scheduling in data ferrying networks
Sort
View
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
13 years 11 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
CN
2008
163views more  CN 2008»
13 years 7 months ago
Loss-resilient window-based congestion control
This paper addresses the problem of fair allocation of bandwidth resources on lossy channels in hybrid heterogeneous networks. It discusses more particularly the ability of window...
Christophe De Vleeschouwer, Pascal Frossard
ISPA
2004
Springer
14 years 28 days ago
Performance-Aware Load Balancing for Multiclusters
In a multicluster architecture, where jobs can be submitted through each constituent cluster, the job arrival rates in individual clusters may be uneven and the load therefore need...
Ligang He, Stephen A. Jarvis, David A. Bacigalupo,...
JAL
2006
101views more  JAL 2006»
13 years 7 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
ICNP
2006
IEEE
14 years 1 months ago
Reducing Congestion Effects in Wireless Networks by Multipath Routing
Abstract—We propose a solution to improve fairness and increase throughput in wireless networks with location information. Our approach consists of a multipath routing protocol, ...
Lucian Popa 0002, Costin Raiciu, Ion Stoica, David...