Published 1997
| public
Book Section - Chapter
Open
Buffer occupancy of statistical multiplexers with periodic interchangeable traffic in ATM networks
- Creators
- Yu, Zhong
- McEliece, Robert J.
Chicago
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.
Additional Information
© 1997 IEEE. Reprinted with Permission. This work was supported by a grant from PacBell.Files
YUZisit97.pdf
Files
(121.7 kB)
Name | Size | Download all |
---|---|---|
md5:b835b5ed4866c347fd9c7734f5f46691
|
121.7 kB | Preview Download |
Additional details
- Eprint ID
- 9986
- Resolver ID
- CaltechAUTHORS:YUZisit97
- Created
-
2008-04-05Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field