Bursty traffic control using dynamic token allocation method

Abstract

A simple but novel modification of the leaky bucket has been proposed by Yang, Ko, Mouftah and Barbosa (see Proc. of MILCOM'94, p.82-6, 1994). This modified method can provide priority access to different classes of services by requiring a cell of each class to obtain a fixed number of tokens before receiving its service. Each class has a different allocation of tokens, and all classes share the same token pool. We examine the dynamic token allocation scheme on bursty traffic. Mean cell delay and cell loss probability performance are obtained as a function of various parameters. Our performance evaluation provides insight into the behaviour of such system.