A time-based weighted fair queueing algorithm for improving CDV and CLP in ATM networks

Generally, a cell scheduler is required to satisfy the criteria of cell delay, cell loss probability and CDV (cell delay variation) for real-time services, and the one of cell loss probability for non-real-time services. This paper proposes a new scheduling algorithm named TWFQ (time-based weighted...

Full description

Saved in:
Bibliographic Details
Main Authors: Jaesun Cha, Jisoo Park, Changhwan Oh, Kiseon Kim
Format: Conference Proceeding
Language:English
Subjects:
Asynchronous transfer mode
Bandwidth
Delay effects
Intelligent networks
Partitioning algorithms
Performance loss
Quality of service
Round robin
Scheduling algorithm
Traffic control
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Generally, a cell scheduler is required to satisfy the criteria of cell delay, cell loss probability and CDV (cell delay variation) for real-time services, and the one of cell loss probability for non-real-time services. This paper proposes a new scheduling algorithm named TWFQ (time-based weighted fair queueing) not only to maintain the fair utilization of the available bandwidth but also to improve the performance of CDV and cell loss probability. The TWFQ algorithm 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 a low cell loss probability, the TWFQ allows connections, which suffer from the more bursty input traffic, to send the cell with more opportunities by using two scheduling phases. Through simulations, we show that the proposed algorithm achieves good performance in terms of CDV and cell loss probability, while other performance criteria are preserved in an acceptable level.
DOI:10.1109/TENCON.1999.818549