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

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.