System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Buffer occupancy of statistical multiplexers with periodic interchangeable traffic 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

2 Author(s)
Zhong Yu ; Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA ; McEliece, R.J.

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. A generalized ballot theorem is applied to analyze the problem. Explicit formulas for the expected buffer occupancy are derived

Published in:

Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on

Date of Conference:

29 Jun-4 Jul 1997