A Two-Phased Weighted Fair Queueing Scheme for Improving CDV and CLP in ATM Networks

Jaesun CHA; Changhwan OH; Kiseon KIM

A Two-Phased Weighted Fair Queueing Scheme for Improving CDV and CLP in ATM Networks

Jaesun CHA, Changhwan OH, Kiseon KIM

Full Text Views

0

Cite this

Summary :

This paper proposes a new scheduling algorithm named TWFQ (Two-phased Weighted Fair Queueing) not only to maintain the fair utilization of 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 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.

Publication: IEICE TRANSACTIONS on Communications Vol.E83-B No.5 pp.1136-1139

Publication Date: 2000/05/25

Publicized

Online ISSN

DOI

Type of Manuscript: LETTER

Category: Fundamental Theories

Cite this

Copy

Jaesun CHA, Changhwan OH, Kiseon KIM, "A Two-Phased Weighted Fair Queueing Scheme for Improving CDV and CLP in ATM Networks" in IEICE TRANSACTIONS on Communications, vol. E83-B, no. 5, pp. 1136-1139, May 2000, doi: .
Abstract: This paper proposes a new scheduling algorithm named TWFQ (Two-phased Weighted Fair Queueing) not only to maintain the fair utilization of 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 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_5_1136/_p

Copy

@ARTICLE{e83-b_5_1136,
author={Jaesun CHA, Changhwan OH, Kiseon KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={A Two-Phased Weighted Fair Queueing Scheme for Improving CDV and CLP in ATM Networks},
year={2000},
volume={E83-B},
number={5},
pages={1136-1139},
abstract={This paper proposes a new scheduling algorithm named TWFQ (Two-phased Weighted Fair Queueing) not only to maintain the fair utilization of 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 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.},
keywords={},
doi={},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - A Two-Phased Weighted Fair Queueing Scheme for Improving CDV and CLP in ATM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1136
EP - 1139
AU - Jaesun CHA
AU - Changhwan OH
AU - Kiseon KIM
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2000
AB - This paper proposes a new scheduling algorithm named TWFQ (Two-phased Weighted Fair Queueing) not only to maintain the fair utilization of 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 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.
ER -