661 search results - page 34 / 133 » Bandwidth Sharing: Objectives and Algorithms |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
ISCC
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we propose a refinement of TCP Westwood allowing the management of the Efficiency/Friendliness-toNewReno tradeoff. We show that the refined TCP Westwood is able to ...
107
click to vote
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
Many scientific applications need to stage large volumes of files from one set of machines to another set of machines in a wide-area network. Efficient execution of such data t...
103
click to vote
LCN
2005
IEEE
15 years 3 months ago
2005
IEEE
— The problem of achieving fairness in the allocation of the bandwidth resource on a link shared by multiple flows of traffic has been extensively researched over the last deca...