Towards optimal policing in ATM networks

This paper proposes a framework for optimal policing in ATM networks. A general approach to modeling controllers which implement the policing function is described using finite-state automata. The theory of finite-state accepting automata and regular expressions enables the symbolic computation of the worst-case source and therefore provides a basis for the formulation and derivation of optimal bandwidth enforcement schemes. Exhaustive searches are performed for small cases to find optimal finite-state automata. These optimal results are extended to obtain near-optimal solutions for higher-state automata. The optimal and near-optimal finite-state automata are compared to existing schemes, such as leaky buckets, and improvement in terms of cell loss rate of the declared source is achieved