By Topic

Analysis of a discrete-time single-server queue with bursty inputs for traffic control 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
$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

4 Author(s)
Murata, M. ; Osaka Univ., Japan ; Oie, Y. ; Suda, T. ; Miyahara, H.

To evaluate the performance of an ATM (asynchronous transfer mode) network when it is subject to admission control or traffic smoothing, the authors develop a discrete-time single-server queuing model where a new call joins the existing calls. In this model, it is assumed that the cell arrivals from a new call follow a general distribution. It is also assumed that the aggregated arrivals of cells from the existing calls form batch arrivals with a general distribution for the batch size and geometric distribution for the interarrival times of batches. The authors consider an infinite buffer case and analytically obtain the waiting-time distribution for a new call and for existing calls. The analysis is an exact one. Through numerical examples, the authors investigate how the network performance depends on the statistics of a new call (burstiness, time that a call stays in active or inactive state, etc). They also demonstrate the effectiveness of traffic smoothing in reducing network congestion

Published in:

Global Telecommunications Conference and Exhibition 'Communications Technology for the 1990s and Beyond' (GLOBECOM), 1989. IEEE

Date of Conference:

27-30 Nov 1989