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. https://resolver.caltech.edu/CaltechAUTHORS:YUZisit97
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 121kB |
Use this Persistent URL to link to this item: https://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 | ||||||
|---|---|---|---|---|---|---|---|
| Related URLs: |
| ||||||
| 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 | ||||||
| DOI: | 10.1109/ISIT.1997.612946 | ||||||
| Record Number: | CaltechAUTHORS:YUZisit97 | ||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:YUZisit97 | ||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||
| ID Code: | 9986 | ||||||
| Collection: | CaltechAUTHORS | ||||||
| Deposited By: | INVALID USER | ||||||
| Deposited On: | 05 Apr 2008 | ||||||
| Last Modified: | 08 Nov 2021 21:04 |
Repository Staff Only: item control page
