74 search results - page 13 / 15 » Round robin scheduling - a survey |
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
—A new variation of the Flow-Aware Networking (FAN) concept is presented in the paper. The proposed solution is based on the Approximate Fair Dropping algorithm and called by us ...
LCN
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— Following widespread availability of wireless Internet, a wide range of applications with differing QoS requirements must share the wireless access. The objective of th...