By Topic

Algorithms for effective variable bit rate traffic smoothing

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)
Zonghua Gu ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; Shin, K.G.

The transfer of prerecorded, compressed variable-bit-rate video requires multimedia services to support large fluctuations in bandwidth requirements on multiple time scales. Bandwidth smoothing techniques can reduce the burstiness of a VBR (variable bit rate) stream by transmitting data at a series of fixed rates, simplifying the allocation of resources in video servers and the communication network. The RCBR (renegotiated constant bit rate) service model seems ideally suited for smoothed VBR traffic which is piece-wise CBR. Zhimei Jiang (see Proc. IEEE Infocomm 98, p.676, 1998) proposed a dynamic programming algorithm to compute the optimal renegotiation schedule given the relative cost of renegotiation and client buffer size. We show that the schedule produced by his algorithm has high peak rates and frequent renegotiations. We propose another algorithm that computes a renegotiation schedule that has a slightly higher cost than the optimal schedule, but has other desirable properties, such as lower peak rate and lower frequency of renegotiations. We also consider proxy-based online smoothing, and propose an adaptive heuristic algorithm to generate renegotiation schedules at runtime without knowledge of future frame size information. We compare the schedule computed by the algorithm to the optimal schedule computed with full knowledge of future frame sizes.

Published in:

Performance, Computing, and Communications Conference, 2003. Conference Proceedings of the 2003 IEEE International

Date of Conference:

9-11 April 2003