By Topic

Characterization of delay-sensitive traffic

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

2 Author(s)
Tsern-Huei Lee ; Dept. of Commun. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Kuen-Chu Lai

Resource allocation is necessary for a network which guarantees quality of service (QoS). In this paper we first present a definition for a traffic stream to be burstier than another traffic stream. The definition is based on the loss probability of a bufferless multiplexer and thus is appropriate for delay-sensitive traffic which cannot tolerate queueing delay caused by buffering. An optimum quantization algorithm is then derived for source characterization. The optimally quantized version achieves minimum loss rate for all possible allocated bandwidths under the condition that it is burstier than the real traffic. The quantized source is called a pseudosource and can be used by the network for resource allocation. Some numerical examples are studied. Results show that, for a bufferless multiplexer, the allocated bandwidth based on optimally quantized pseudosources is only slightly greater than the minimum bandwidth required to meet the requested QoS

Published in:

Networking, IEEE/ACM Transactions on  (Volume:6 ,  Issue: 4 )