Name
Abstract | ||
|---|---|---|
In recent years, an explosive growth of network applications can be obviously observed. This results in different traffic patterns which need different QoS requirements. For supporting various QoS requirements, it is necessary to implement some QoS control and scheduling mechanisms in multimedia communication networks. The QoS scheduler(s) in a switch, router, or multiplexer can provide different service rate to satisfy specified delay guarantee and then the delay fairness when bursty traffic happens. However, a static scheduler is easily implemented but poor in tackling burstiness, and a dynamic scheduler is adaptive to network status but complex in computation. In this paper, we propose a scheduling algorithm for packets of non-fixed sizes, called Deadline Modulating Weighted Round Robin (DMRRR), which is based on WRR and the concept of Virtual Clock (VC). The scheduling pattern of DMWRR is static under regular network status, while dynamically adapted under bursty traffic. It keeps the simplicity of static scheduling and the adaption of dynamical scheduling. Simulation results show that the DMWRR can meet the QoS requirement better than WRR but skip the computation complexity of VC-VFT. |
Year | Venue | Field |
|---|---|---|
2002 | PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES | Max-min fairness,Fair-share scheduling,Computer science,Computer network,Maximum throughput scheduling,Rate-monotonic scheduling,Fairness measure,Dynamic priority scheduling,Round-robin scheduling,Fair queuing |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
1 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lain-chyr Hwang | 1 | 16 | 6.10 |
| Steen J. Hsu | 2 | 32 | 8.38 |
| Cheng-Yuan Ku | 3 | 366 | 27.09 |
| Ying-tien Tsai | 4 | 0 | 0.68 |
| Amy Wang | 5 | 24 | 5.69 |