In this paper, we propose a new fair queueing algorithm to improve cell delay variation (CDV) for real-time service categories and to make efficient use of system resources for multimedia traffic in high speed ATM networks. The proposed algorithm is called the delay variation-based fair queueing (DVFQ) algorithm, which is based on per-VC queueing to improve CDV and fairness for each VC of real-time services such as CBR and rt-VBR. In DVFQ algorithm, we define two fairness indexes, which indicate the degree of the fairness of CDV at the rate of each VC, and the degree of impartially sharing the bandwidth between the scheduled cells for each VC. The simulation results for both heavily and lightly loaded conditions show that DVFQ algorithm provides better performances in terms of the CDV, the CDV fairness, and the service fairness than those of FCFS for real-time service.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Jisoo PARK, Changhwan OH, Kiseon KIM, "A Delay Variation-Based Fair Queueing (DVFQ) Algorithm for Real-Time Multimedia Traffic in ATM Networks" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 7, pp. 1322-1332, July 2002, doi: .
Abstract: In this paper, we propose a new fair queueing algorithm to improve cell delay variation (CDV) for real-time service categories and to make efficient use of system resources for multimedia traffic in high speed ATM networks. The proposed algorithm is called the delay variation-based fair queueing (DVFQ) algorithm, which is based on per-VC queueing to improve CDV and fairness for each VC of real-time services such as CBR and rt-VBR. In DVFQ algorithm, we define two fairness indexes, which indicate the degree of the fairness of CDV at the rate of each VC, and the degree of impartially sharing the bandwidth between the scheduled cells for each VC. The simulation results for both heavily and lightly loaded conditions show that DVFQ algorithm provides better performances in terms of the CDV, the CDV fairness, and the service fairness than those of FCFS for real-time service.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_7_1322/_p
Copy
@ARTICLE{e85-b_7_1322,
author={Jisoo PARK, Changhwan OH, Kiseon KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={A Delay Variation-Based Fair Queueing (DVFQ) Algorithm for Real-Time Multimedia Traffic in ATM Networks},
year={2002},
volume={E85-B},
number={7},
pages={1322-1332},
abstract={In this paper, we propose a new fair queueing algorithm to improve cell delay variation (CDV) for real-time service categories and to make efficient use of system resources for multimedia traffic in high speed ATM networks. The proposed algorithm is called the delay variation-based fair queueing (DVFQ) algorithm, which is based on per-VC queueing to improve CDV and fairness for each VC of real-time services such as CBR and rt-VBR. In DVFQ algorithm, we define two fairness indexes, which indicate the degree of the fairness of CDV at the rate of each VC, and the degree of impartially sharing the bandwidth between the scheduled cells for each VC. The simulation results for both heavily and lightly loaded conditions show that DVFQ algorithm provides better performances in terms of the CDV, the CDV fairness, and the service fairness than those of FCFS for real-time service.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - A Delay Variation-Based Fair Queueing (DVFQ) Algorithm for Real-Time Multimedia Traffic in ATM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1322
EP - 1332
AU - Jisoo PARK
AU - Changhwan OH
AU - Kiseon KIM
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2002
AB - In this paper, we propose a new fair queueing algorithm to improve cell delay variation (CDV) for real-time service categories and to make efficient use of system resources for multimedia traffic in high speed ATM networks. The proposed algorithm is called the delay variation-based fair queueing (DVFQ) algorithm, which is based on per-VC queueing to improve CDV and fairness for each VC of real-time services such as CBR and rt-VBR. In DVFQ algorithm, we define two fairness indexes, which indicate the degree of the fairness of CDV at the rate of each VC, and the degree of impartially sharing the bandwidth between the scheduled cells for each VC. The simulation results for both heavily and lightly loaded conditions show that DVFQ algorithm provides better performances in terms of the CDV, the CDV fairness, and the service fairness than those of FCFS for real-time service.
ER -