A heuristic framework for source policing in ATM networks
IEEE/ACM Transactions on Networking (TON)
Towards optimal policing in ATM networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
New directions in communications (or which way to the information age?)
IEEE Communications Magazine
Spacing cells protects and enhances utilization of ATM network links
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.24 |
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.