Statistical properties of a near-optimal measurement-based CAC algorithm

Author

Crosby, Simon ; Leslie, Ian ; McGurk, Brian ; Lewis, John T. ; Russell, Raymond ; Toomey, Fergal

Author_Institution

Comput. Lab., Cambridge Univ., UK

fYear

1997

fDate

25-28 May 1997

Firstpage

103

Lastpage

112

Abstract

Our algorithm, called Mosquito, allows sources to be ignorant of their statistics but offers near-optimal utilisation of the network. Our approach is based on large deviation theory: the large deviation rate-function (entropy) of bursty ATM traffic can be estimated from measurements of traffic activity. The entropy can be used to determine the bandwidth requirement of the traffic. In this paper, we explain the basic ideas behind the algorithm and describe its implementation. We present some results of a statistical investigation of the performance of the Mosquito CAC algorithm comparing it with that of various modifications of the algorithm

Keywords

asynchronous transfer mode; entropy; estimation theory; optimisation; statistical analysis; telecommunication congestion control; Mosquito; bandwidth requirement; bursty ATM traffic; connection admission control; entropy; large deviation rate-function; large deviation theory; near-optimal measurement-based CAC algorithm; network near-optimal utilisation; performance; statistical properties; traffic activity; Bandwidth; Costs; Entropy; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

IEEE ATM Workshop 1997. Proceedings

Conference_Location

Lisboa

Print_ISBN

0-7803-4196-1

Type

conf

DOI

10.1109/ATM.1997.624661

Filename

624661