ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer Communications
Volume 19, Issue 3, March 1996, Pages 194-204
Algorithms for ATM networks
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (1170 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0140-3664(96)01054-7    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1996 Published by Elsevier Science B.V.

Towards optimal policing in ATM networks*1

Lorne G. Masona, Anne Pelletiera and Jacques Lapointeb

a INRS-Télécommunications, 16 place du Commerce, Verdun, Québec, H3E 1H6, Canada b Bell Québec, 700 La Gauchetière ouest, Montréal, Québec, H3B 4L1, Canada

Available online 9 February 1999.

Purchase the full-text article



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

Article Outline

• References

Computer Communications
Volume 19, Issue 3, March 1996, Pages 194-204
Algorithms for ATM networks
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.