Title :
Efficient bounds for bufferless statistical multiplexing
Author :
Heszberger, Z. ; Zatonyi, J. ; Biro, J.J. ; Henk, T.
Author_Institution :
Dept. of Telecommun. & Telematics, Budapest Univ., Hungary
Abstract :
This paper is concerned with the saturation probability of aggregate traffic data arrival rate on a communication link. This performance metric also referred to as the tail distribution of aggregate traffic is essential in traffic control and management algorithms of high speed networks including future QoS Internet. In this paper, efficient closed form upper bounds have been derived for the saturation probability when very little information is available on the aggregate traffic. The performance of these estimators is also investigated via numerical examples
Keywords :
Internet; multiplexing; probability; quality of service; statistical analysis; telecommunication control; telecommunication links; telecommunication network management; telecommunication traffic; Chernoff bound; QoS Internet; aggregate traffic data arrival rate; bufferless statistical multiplexing; closed form approximations; communication link; efficient closed form upper bounds; high speed networks; performance metric; saturation probability; tail distribution; traffic control algorithm; traffic management algorithm; Aggregates; Capacity planning; Communication system traffic control; High-speed networks; Measurement; Probability distribution; Random variables; Telematics; Traffic control; Upper bound;
Conference_Titel :
Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE
Conference_Location :
San Francisco, CA
Print_ISBN :
0-7803-6451-1
DOI :
10.1109/GLOCOM.2000.892095
