By Topic

Performance analysis of output buffered fast packet switches with bursty traffic loading

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chen, D.X. ; Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada ; Mark, Jon W.

The authors address the performance analysis of output buffered packet switches under bursty traffic loading. The packet arrival process to each input port is modeled by a first-order two-state Markov chain. Both infinite and finite buffering capacity are considered. The queuing system is described by a first-order two-dimensional Markov chain. The transform approach is used to derive an expression for the moment generating function of the queue length distribution. For the finite buffer case, the system occupancy probabilities are obtained by solving a set of simultaneous linear equations. Numerical results indicate that, compared to the uncorrelated arrival case, the average waiting time and buffer overflow probability increase under a bursty traffic loading

Published in:

Global Telecommunications Conference, 1991. GLOBECOM '91. 'Countdown to the New Millennium. Featuring a Mini-Theme on: Personal Communications Services

Date of Conference:

2-5 Dec 1991