74 search results - page 10 / 15 » Round robin scheduling - a survey |
GCC
2006
Springer
13 years 10 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
HPDC
2005
IEEE
14 years 20 days ago
2005
IEEE
Applications that use parallel TCP streams to increase throughput must multiplex and demultiplex data blocks over a set of TCP streams transmitting on one or more network paths. W...
ISAAC
2001
Springer
13 years 11 months ago
2001
Springer
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e. the higher the number of hops, the lower becomes the throughput...
NOSSDAV
2004
Springer
14 years 12 days ago
2004
Springer
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...