CaltechAUTHORS
  A Caltech Library Service

Buffer occupancy of statistical multiplexers with periodic interchangeable traffic in ATM networks

Yu, Zhong and McEliece, Robert J. (1997) Buffer occupancy of statistical multiplexers with periodic interchangeable traffic in ATM networks. In: IEEE International Symposium on Information Theory (ISIT 1997), Ulm, Germany, 29 June-4 July 1997. IEEE , Piscataway, NJ, p. 31. ISBN 0780339568 http://resolver.caltech.edu/CaltechAUTHORS:YUZisit97

[img]
Preview
PDF
See Usage Policy.

118Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:YUZisit97

Abstract

In this paper we analyze the buffer occupancy in a statistical multiplexer in ATM networks for a special type of traffic, namely, periodic interchangeable (PI) traffic. Certain generalized Ballot theorem is applied to analyze the problem. Explicit formulas for the expected buffer occupancy are derived.


Item Type:Book Section
Additional Information:© 1997 IEEE. Reprinted with Permission. This work was supported by a grant from PacBell.
Subject Keywords:asynchronous transfer mode; buffer storage; queueing theory; telecommunication traffic; ATM networks; buffer occupancy; generalized ballot theorem; periodic interchangeable traffic; queue occupancy; statistical multiplexer
Record Number:CaltechAUTHORS:YUZisit97
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:YUZisit97
Alternative URL:http://dx.doi.org/10.1109/ISIT.1997.612946
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:9986
Collection:CaltechAUTHORS
Deposited By: Kristin Buxton
Deposited On:05 Apr 2008
Last Modified:26 Dec 2012 09:55

Repository Staff Only: item control page