Discrete-time analysis of the leaky bucket scheme with threshold-based token generation intervals

Abstract

In the ATM network, the leaky bucket scheme is a promising method that regulates input traffics for preventive congestion control. In order to satisfy the loss probability constraint of more bursty input traffic, it is known that the leaky bucket scheme with static token generation interval requires larger data buffer and token pool size. This causes an increase in the mean waiting time for input traffic to pass the leaky bucket scheme, which would be inappropriate for real time traffics such as voice and video. The authors present the leaky bucket scheme with threshold-based token generation intervals in which the token generation interval changes according to buffer occupancy. The proposed leaky bucket scheme is analysed in the discrete-time case by assuming the arrival process to be a Markov-modulated Bernoulli process (MMBP). The authors show that the quality of service (QoS) of input traffics is satisfied with smaller data buffer and token pool size in the proposed leaky bucket scheme.