IEICE TRANSACTIONS on Communications
An Approximate Analysis of a Shared Buffer ATM Switch Using Input Process Aggregation
Summary :
A shared buffer ATM switch loaded with bursty input traffic is modeled by a discrete-time queueing system. Also, the unbalanced and correlated routing traffic patterns are considered. An approximation method to analyze the queueing system under consideration is developed. To overcome the problem regarding the size of state space to be dealt with, the entire switching system is decomposed into several subsystems, and then each subsystem is analyzed in isolation. We first propose an efficient algorithm for superposing all the individual bursty cell arrival processes to the switch. And then, the maximum entropy method is applied to obtain the steady-state probability distribution of the queueing system. From the obtained steady-state probabilities, we can derive some performance measures such as cell loss probability and average delay. Numerical examples of the proposed approximation method are given, which are compared with simulation results.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E82-B No.12 pp.2107-2115
- Publication Date
- 1999/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Switching and Communication Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Jisoo KIM, Chi-Hyuck JUN, "An Approximate Analysis of a Shared Buffer ATM Switch Using Input Process Aggregation" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 12, pp. 2107-2115, December 1999, doi: .
Abstract: A shared buffer ATM switch loaded with bursty input traffic is modeled by a discrete-time queueing system. Also, the unbalanced and correlated routing traffic patterns are considered. An approximation method to analyze the queueing system under consideration is developed. To overcome the problem regarding the size of state space to be dealt with, the entire switching system is decomposed into several subsystems, and then each subsystem is analyzed in isolation. We first propose an efficient algorithm for superposing all the individual bursty cell arrival processes to the switch. And then, the maximum entropy method is applied to obtain the steady-state probability distribution of the queueing system. From the obtained steady-state probabilities, we can derive some performance measures such as cell loss probability and average delay. Numerical examples of the proposed approximation method are given, which are compared with simulation results.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_12_2107/_p
Copy
@ARTICLE{e82-b_12_2107,
author={Jisoo KIM, Chi-Hyuck JUN, },
journal={IEICE TRANSACTIONS on Communications},
title={An Approximate Analysis of a Shared Buffer ATM Switch Using Input Process Aggregation},
year={1999},
volume={E82-B},
number={12},
pages={2107-2115},
abstract={A shared buffer ATM switch loaded with bursty input traffic is modeled by a discrete-time queueing system. Also, the unbalanced and correlated routing traffic patterns are considered. An approximation method to analyze the queueing system under consideration is developed. To overcome the problem regarding the size of state space to be dealt with, the entire switching system is decomposed into several subsystems, and then each subsystem is analyzed in isolation. We first propose an efficient algorithm for superposing all the individual bursty cell arrival processes to the switch. And then, the maximum entropy method is applied to obtain the steady-state probability distribution of the queueing system. From the obtained steady-state probabilities, we can derive some performance measures such as cell loss probability and average delay. Numerical examples of the proposed approximation method are given, which are compared with simulation results.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - An Approximate Analysis of a Shared Buffer ATM Switch Using Input Process Aggregation
T2 - IEICE TRANSACTIONS on Communications
SP - 2107
EP - 2115
AU - Jisoo KIM
AU - Chi-Hyuck JUN
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 1999
AB - A shared buffer ATM switch loaded with bursty input traffic is modeled by a discrete-time queueing system. Also, the unbalanced and correlated routing traffic patterns are considered. An approximation method to analyze the queueing system under consideration is developed. To overcome the problem regarding the size of state space to be dealt with, the entire switching system is decomposed into several subsystems, and then each subsystem is analyzed in isolation. We first propose an efficient algorithm for superposing all the individual bursty cell arrival processes to the switch. And then, the maximum entropy method is applied to obtain the steady-state probability distribution of the queueing system. From the obtained steady-state probabilities, we can derive some performance measures such as cell loss probability and average delay. Numerical examples of the proposed approximation method are given, which are compared with simulation results.
ER -
English
