The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Un commutateur ATM à tampon partagé chargé d'un trafic d'entrée en rafales est modélisé par un système de file d'attente à temps discret. En outre, les modèles de trafic de routage déséquilibrés et corrélés sont pris en compte. Une méthode d'approximation pour analyser le système de file d'attente considéré est développée. Pour résoudre le problème de la taille de l’espace d’états à traiter, l’ensemble du système de commutation est décomposé en plusieurs sous-systèmes, puis chaque sous-système est analysé isolément. Nous proposons d’abord un algorithme efficace pour superposer tous les processus individuels d’arrivée de cellules en rafale au commutateur. Ensuite, la méthode de l’entropie maximale est appliquée pour obtenir la distribution de probabilité en régime permanent du système de file d’attente. À partir des probabilités en régime permanent obtenues, nous pouvons déduire certaines mesures de performances telles que la probabilité de perte de cellules et le délai moyen. Des exemples numériques de la méthode d'approximation proposée sont donnés, qui sont comparés aux résultats de simulation.
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.
Copier
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
Copier
@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},}
Copier
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 -