Copyright © 1996 Published by Elsevier Science B.V.
Towards optimal policing in ATM networks*1
Available online 9 February 1999.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
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 explicit representation of all traffic patterns which pass through the policing controller, without modification. This in turn enables the symbolic computation of the worst-case source and therefore provides a unified framework 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 larger-state automata. The optimal and near-optimal policing controller designs are compared to conventional schemes, such as leaky buckets, and improvement in performance is achieved, where performance is measured in terms of cell loss rate for the declared source and throughput of the corresponding worst case source.
Author Keywords: Preventive control; Source policing; Finite-state automata







E-mail Article
Add to my Quick Links

Cited By in Scopus (2)




