Improved dual leaky bucket policing algorithm for ATM networks

In high speed communication, traffic management plays a significant role to control the use of network resources to prevent bottlenecks. In particular, when the network resources are allotted to more sources than the network can support, the network performance degrades for users. So, the network resources should be allotted in such a way that the network can operate at acceptable levels (maintain the QoS for all the existing connections) at times when the offered load to the network exceeds its capacity. So, a policing function is set up at the user network interface (UNI) for preventive congestion control. Many algorithms have previously been proposed for the UNI. Only a few algorithms are concerned with the cell delay variation (CDV). In the present paper, an improved version of the leaky bucket algorithm is presented to monitor traffic. This algorithm also checks those cells which are crossing the policing rate due to the effect of CDV and compensates them by sending them into the network without discarding. Simulation results are presented to demonstrate the superior performance of this traffic control algorithm. The algorithm also makes use of the feedback control of the network status which in turn improves the throughput