By Topic

Finite buffer discrete-time queues with multiple Markovian arrivals and services in ATM networks

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
$33 $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

1 Author(s)
Z. Zhang ; Center for Telecommun. Res., Columbia Univ., New York, NY, USA

An efficient computational procedure to calculate the queue size distribution in a finite buffer queuing system with a number of independent sources is presented. Each source is characterized by a finite state discrete-time Markov chain. An explicit expression for the queue size distribution is obtained directly. The method is based on computing the modified spectral expansion of the state distribution of the system. This representation requires evaluating the roots of the entire system characteristic function and solving a set of linear system equations. Exact results show that the cell loss probability depends only on the ratio of the buffer capacity to burst length. An approximation expression for the cell loss probability based on asymptotic analysis is also presented. Numerical results show that the approximation is accurate, especially when the system load is heavy. The effect of burst length on the cell loss probability is investigated

Published in:

INFOCOM '92. Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE

Date of Conference:

4-8 May 1992