On performance analysis of leaky bucket scheme with MAP as an input process

Abstract

In ATM(Asychronous Transfer Mode) network, the input traffic is controlled so as to prevent the network from reaching an unacceptable congestion level. The Leaky Bucket(LB) scheme proposed by Turner has been known as one of the most promising methods for preventive congestion control and policing mechanisms. As a role of policing mechanisms, the Leaky Bucket scheme monitors user control traffic in terms of the preassigned traffic volume to protect network resources from malicious misbehavior which can affect the Quality of Service(QoS) of other already established connections. The original LB scheme does not have the data buffer, but the buffer is installed in the original LB scheme to reduce the cell loss probability. We present the LB scheme with more general arrival process. The arrival process is the Markovian Arrival Process(MAP) and it can easily incorporate the correlation of the bursty traffic. In this thesis, we analyze the LB scheme with the MAP and the token generation interval which changes for varying the buffer occupancy at a token generation epoch.