Queueing Analysis for ATM switching of Mixed Traffic with Priority

Cheul SHIM; JungGyu KIM; Mignon PARK; SangBae LEE

Queueing Analysis for ATM switching of Mixed Traffic with Priority

Cheul SHIM, JungGyu KIM, Mignon PARK, SangBae LEE

Full Text Views

0

Cite this

Summary :

This paper proposes an analysis method of a priority scheme for mixed Continuous-Bit-Rate (CBR) and burst traffic contending based on Asynchronous Transfer Mode (ATM) which applied the future B-ISDN. The method is analyzed througn two separated source models; binary source model for burst traffic and random source model for CBR traffic. First we defines arrival process using the two source models according to traffic characteristics so that in adaptation to queueing modeling the system is analyzed through M/G/1/N. Next in view point of service process three priority schemes: push-out scheme, partial buffer sharing and separate route for each traffic loss are proposed. Here we impose two different priority classes on each source model. With the use of superposition of traffic from a number of independent random sources and binary sources, the partial buffer sharing scheme is proved to be best in three priority schemes for addmissible load and cell loss probability. In this paper, we propose partial buffer sharing scheme with priority scheme for two different traffics.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E74-A No.10 pp.3086-3091

Publication Date: 1991/10/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section LETTER (Special Issue on JTC-CSCC '90)

Category: Communication Theory

Authors

Cheul SHIM
JungGyu KIM
Mignon PARK
SangBae LEE

Keyword

Cite this

Copy

Cheul SHIM, JungGyu KIM, Mignon PARK, SangBae LEE, "Queueing Analysis for ATM switching of Mixed Traffic with Priority" in IEICE TRANSACTIONS on Fundamentals, vol. E74-A, no. 10, pp. 3086-3091, October 1991, doi: .
Abstract: This paper proposes an analysis method of a priority scheme for mixed Continuous-Bit-Rate (CBR) and burst traffic contending based on Asynchronous Transfer Mode (ATM) which applied the future B-ISDN. The method is analyzed througn two separated source models; binary source model for burst traffic and random source model for CBR traffic. First we defines arrival process using the two source models according to traffic characteristics so that in adaptation to queueing modeling the system is analyzed through M/G/1/N. Next in view point of service process three priority schemes: push-out scheme, partial buffer sharing and separate route for each traffic loss are proposed. Here we impose two different priority classes on each source model. With the use of superposition of traffic from a number of independent random sources and binary sources, the partial buffer sharing scheme is proved to be best in three priority schemes for addmissible load and cell loss probability. In this paper, we propose partial buffer sharing scheme with priority scheme for two different traffics.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e74-a_10_3086/_p

Copy

@ARTICLE{e74-a_10_3086,
author={Cheul SHIM, JungGyu KIM, Mignon PARK, SangBae LEE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Queueing Analysis for ATM switching of Mixed Traffic with Priority},
year={1991},
volume={E74-A},
number={10},
pages={3086-3091},
abstract={This paper proposes an analysis method of a priority scheme for mixed Continuous-Bit-Rate (CBR) and burst traffic contending based on Asynchronous Transfer Mode (ATM) which applied the future B-ISDN. The method is analyzed througn two separated source models; binary source model for burst traffic and random source model for CBR traffic. First we defines arrival process using the two source models according to traffic characteristics so that in adaptation to queueing modeling the system is analyzed through M/G/1/N. Next in view point of service process three priority schemes: push-out scheme, partial buffer sharing and separate route for each traffic loss are proposed. Here we impose two different priority classes on each source model. With the use of superposition of traffic from a number of independent random sources and binary sources, the partial buffer sharing scheme is proved to be best in three priority schemes for addmissible load and cell loss probability. In this paper, we propose partial buffer sharing scheme with priority scheme for two different traffics.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - Queueing Analysis for ATM switching of Mixed Traffic with Priority
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3086
EP - 3091
AU - Cheul SHIM
AU - JungGyu KIM
AU - Mignon PARK
AU - SangBae LEE
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E74-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1991
AB - This paper proposes an analysis method of a priority scheme for mixed Continuous-Bit-Rate (CBR) and burst traffic contending based on Asynchronous Transfer Mode (ATM) which applied the future B-ISDN. The method is analyzed througn two separated source models; binary source model for burst traffic and random source model for CBR traffic. First we defines arrival process using the two source models according to traffic characteristics so that in adaptation to queueing modeling the system is analyzed through M/G/1/N. Next in view point of service process three priority schemes: push-out scheme, partial buffer sharing and separate route for each traffic loss are proposed. Here we impose two different priority classes on each source model. With the use of superposition of traffic from a number of independent random sources and binary sources, the partial buffer sharing scheme is proved to be best in three priority schemes for addmissible load and cell loss probability. In this paper, we propose partial buffer sharing scheme with priority scheme for two different traffics.
ER -