Implementations of traffic control mechanisms for high-speed networks

Abstract

This paper proposes a traffic policing mechanism for multimedia communication systems with quality of service guarantees, called slotted moving window (SMW). Moreover, it also presents efficient implementations of SMW and several other well-known traffic policing mechanisms, for comparison purposes. SMW's main feature is the capability to accurately control the mean cell rate in a cost-effective approach. In addition, SMW is characterized by low implementation complexity, low memory requirements and use of a single low-precision timer. Its key idea consists of the aggregation of arrival events in order to minimize processing and buffering requirements. The comparative analysis concentrates on the number of timers and their precision, the required memory, the processing time, the maximum burst duration and the violation probability. Finally, the results confirm the efficiency and low implementation complexity of both the leaky bucket and the slotted moving window mechanism.