VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.24 |
The asynchronous transfer mode networks should support widely different characteristics of services with different quality of service requirements, and should achieve a fair use of the available bandwidth. This paper proposes a new per-VC scheduling algorithm not only to improve the performance of cell loss probability (CLP) and cell delay variation (CDV) but also to maintain the fair utilization of available bandwidth. The two-phased weighted fair queuing (TWFQ) scheme makes use of the cell inter-arrival time of each connection for determining the cell service order among connections, which contributes to get a small CDV. To achieve low CLP, the TWFQ scheme allows the connections, which are suffering from more bursty input traffic, to send the cell in advance by using two scheduling phases. The simulation results show that TWFQ scheme provides better performance than SCFQ and WRR in terms of CDV and CLP, and also performs as well on the criteria of mean cell delay and bandwidth fairness as those schemes.