New algorithm for real-time CAC decisions

Ying Zhang*, Ran Tao, Siyong Zhou, Yue Wang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

An improved algorithm for real-time connection admission control (CAC) decision was put forward. Converted equations of cell loss ratio (CLR) upper bound were derived based on typical approaches to reduce computing load. Moreover, the effects of usage parameter control (UPC) policing and bandwidth allocation functions were combined to deduce improved equations. Computing load and admission region of the new algorithm were analyzed, while numerical examples and comparisons with classical non-parametric method were also included. Computing burden was reduced, and more accurate estimation of CLR was obtained. The admission region of new algorithm was larger than typical non-parametric approach and was variable according to the burst length. The calculation burden of new algorithm for CLR estimation is lighter than classical non-parametric approach. In addition to that, just as much information as what we can get in connection setup process are used for CAC decision. So it is not only a practicable but also an effective method that can be used in real-time processing.

Original languageEnglish
Pages (from-to)366-372
Number of pages7
JournalJournal of Beijing Institute of Technology (English Edition)
Volume7
Issue number4
Publication statusPublished - 1998

Fingerprint

Dive into the research topics of 'New algorithm for real-time CAC decisions'. Together they form a unique fingerprint.

Cite this