By Topic

Efficient bounds for bufferless statistical multiplexing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Heszberger, Z. ; Dept. of Telecommun. & Telematics, Budapest Univ., Hungary ; Zatonyi, J. ; Biro, J.J. ; Henk, T.

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

Published in:

Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE  (Volume:1 )

Date of Conference:

2000