An Algorithm for Lossless Smoothing of MPEG Video

Interframe compression techniques, such as those used in MPEG video, give rise to a coded bit stream where picture sizes di er by a factor of 10 or more. As a result, bu ering is needed to reduce (smooth) rate uctuations of encoder output from one picture to the next; without smoothing, the performance of networks that carry such video tra c would be adversely a ected. Various techniques have been suggested for controlling the output rate of a VBR encoder to alleviate network congestion or prevent bu er over ow. Most of these techniques, however, are lossy, and should be used only as a last resort. In this paper, we design and specify an algorithm for lossless smoothing. The algorithm is characterized by three parameters: D (delay bound), K (number of pictures with known sizes), and H (lookahead interval for optimization). We present a theorem which guarantees that, if K 1, the algorithm nds a solution that satis es the delay bound. (Although the algorithm and theorem were motivated b...

• Type: Conference
• Year: 1994
• Where: SIGCOMM
• Authors: Simon S. Lam, Simon Chow, David K. Y. Yau
• Keywords: Communications, Delay Bound, MPEG Video, Picture Sizes Di, SIGCOMM 1994