An Approximate Analysis of a Shared Buffer ATM Switch Using Input Process Aggregation

Jisoo KIM  Chi-Hyuck JUN  

IEICE TRANSACTIONS on Communications   Vol.E82-B   No.12   pp.2107-2115
Publication Date: 1999/12/25
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Switching and Communication Processing
ATM switch,  full sharing scheme,  input process aggregation,  maximum entropy method,  cell loss probability,  average delay,  

Full Text: PDF(439.8KB)>>
Buy this Article

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.