Premium
Output‐queue contents in a ‘minislot’ synchronized ATM switch
Author(s) -
Xiong Yijun,
Bruneel Herwig
Publication year - 1995
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.4500080103
Subject(s) - dimensioning , queueing theory , computer science , queue , upper and lower bounds , computer network , transmission (telecommunications) , train , topology (electrical circuits) , real time computing , telecommunications , mathematics , combinatorics , engineering , mathematical analysis , aerospace engineering , cartography , geography
An N × N switching element with output queueing, as used in a large ATM switching network, is considered. All the inlets of the switching element are synchronized on ‘minislots’, where a minislot is the fixed‐length time unit for the transmission of one ‘minicell’. When entering the switching network, an ATM cell is converted into a ‘minicell‐train’, consisting of a fixed number of minicells. Using an active/silent model, it is assumed that on each inlet of the switching element, the number of minicelltrains in an active period and the length of a silent period are both geometrically distributed, and the arriving minicell‐trains are uniformly distributed among all the outlets. The performance of the switching element can be obtained by analysing one single output queue, which is modeled as a discrete‐time single‐server queuing system with train arrivals. In this paper, an upper bound and an approximate expression for the mean queue length are derived. More importantly, an analytical method is developed to obtain a tight upper bound and a good approximation for the tail distribution of the queue length. This analytical method is very useful in buffer dimensioning of ATM switches.