Controlling Cell Delay Variation for VP-Based ATM Multiplexing Using Interleaved Round Robin Service Discipline

Cheng-Shong WU; Jin-Chyang JIAU; Kim-Joan CHEN

Controlling Cell Delay Variation for VP-Based ATM Multiplexing Using Interleaved Round Robin Service Discipline

Cheng-Shong WU, Jin-Chyang JIAU, Kim-Joan CHEN

Full Text Views

0

Cite this

Summary :

Cell delay variation (CDV) has been considered as an important performance measure due to the stringent timing requirement for video and multimedia services. In this paper we address the problem of CDV performance guarantee in virtual path (VP)-based ATM multiplexing. We propose a rate-based and non-work-conserving scheduling algorithm, called interleaved round robin (IRR), for serving traffic streams among VPs into the outgoing link. Through our performance analysis, the proposed scheme is capable of providing upper and lower bounds on the inter-visit time (IVT) for each VP, where the difference between the upper bound and the lower bound is simply dependent upon the number of multiplexed VPs. The distribution of VP IVT scheduled by an IRR server can also be well approximated using a random incidence technique. In addition to the VP-level CDV performance, we further examine the virtual connection (VC)-level CDV incurred within a multi-stage network through simulation study. The simulation results show that the IRR server can provide traffic regulation and smoothness at each network node. Moreover, the CDV distribution of a tagged VC is insensitive to the source traffic characteristic, node location, and the hop count traversed in the network.

Publication: IEICE TRANSACTIONS on Communications Vol.E81-B No.5 pp.919-928

Publication Date: 1998/05/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on ATM Traffic Control and Performance Evaluation)

Category: Buffer Management

Cite this

Copy

Cheng-Shong WU, Jin-Chyang JIAU, Kim-Joan CHEN, "Controlling Cell Delay Variation for VP-Based ATM Multiplexing Using Interleaved Round Robin Service Discipline" in IEICE TRANSACTIONS on Communications, vol. E81-B, no. 5, pp. 919-928, May 1998, doi: .
Abstract: Cell delay variation (CDV) has been considered as an important performance measure due to the stringent timing requirement for video and multimedia services. In this paper we address the problem of CDV performance guarantee in virtual path (VP)-based ATM multiplexing. We propose a rate-based and non-work-conserving scheduling algorithm, called interleaved round robin (IRR), for serving traffic streams among VPs into the outgoing link. Through our performance analysis, the proposed scheme is capable of providing upper and lower bounds on the inter-visit time (IVT) for each VP, where the difference between the upper bound and the lower bound is simply dependent upon the number of multiplexed VPs. The distribution of VP IVT scheduled by an IRR server can also be well approximated using a random incidence technique. In addition to the VP-level CDV performance, we further examine the virtual connection (VC)-level CDV incurred within a multi-stage network through simulation study. The simulation results show that the IRR server can provide traffic regulation and smoothness at each network node. Moreover, the CDV distribution of a tagged VC is insensitive to the source traffic characteristic, node location, and the hop count traversed in the network.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_5_919/_p

Copy

@ARTICLE{e81-b_5_919,
author={Cheng-Shong WU, Jin-Chyang JIAU, Kim-Joan CHEN, },
journal={IEICE TRANSACTIONS on Communications},
title={Controlling Cell Delay Variation for VP-Based ATM Multiplexing Using Interleaved Round Robin Service Discipline},
year={1998},
volume={E81-B},
number={5},
pages={919-928},
abstract={Cell delay variation (CDV) has been considered as an important performance measure due to the stringent timing requirement for video and multimedia services. In this paper we address the problem of CDV performance guarantee in virtual path (VP)-based ATM multiplexing. We propose a rate-based and non-work-conserving scheduling algorithm, called interleaved round robin (IRR), for serving traffic streams among VPs into the outgoing link. Through our performance analysis, the proposed scheme is capable of providing upper and lower bounds on the inter-visit time (IVT) for each VP, where the difference between the upper bound and the lower bound is simply dependent upon the number of multiplexed VPs. The distribution of VP IVT scheduled by an IRR server can also be well approximated using a random incidence technique. In addition to the VP-level CDV performance, we further examine the virtual connection (VC)-level CDV incurred within a multi-stage network through simulation study. The simulation results show that the IRR server can provide traffic regulation and smoothness at each network node. Moreover, the CDV distribution of a tagged VC is insensitive to the source traffic characteristic, node location, and the hop count traversed in the network.},
keywords={},
doi={},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - Controlling Cell Delay Variation for VP-Based ATM Multiplexing Using Interleaved Round Robin Service Discipline
T2 - IEICE TRANSACTIONS on Communications
SP - 919
EP - 928
AU - Cheng-Shong WU
AU - Jin-Chyang JIAU
AU - Kim-Joan CHEN
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 1998
AB - Cell delay variation (CDV) has been considered as an important performance measure due to the stringent timing requirement for video and multimedia services. In this paper we address the problem of CDV performance guarantee in virtual path (VP)-based ATM multiplexing. We propose a rate-based and non-work-conserving scheduling algorithm, called interleaved round robin (IRR), for serving traffic streams among VPs into the outgoing link. Through our performance analysis, the proposed scheme is capable of providing upper and lower bounds on the inter-visit time (IVT) for each VP, where the difference between the upper bound and the lower bound is simply dependent upon the number of multiplexed VPs. The distribution of VP IVT scheduled by an IRR server can also be well approximated using a random incidence technique. In addition to the VP-level CDV performance, we further examine the virtual connection (VC)-level CDV incurred within a multi-stage network through simulation study. The simulation results show that the IRR server can provide traffic regulation and smoothness at each network node. Moreover, the CDV distribution of a tagged VC is insensitive to the source traffic characteristic, node location, and the hop count traversed in the network.
ER -