| Summary: | 碩士 === 國立交通大學 === 電信工程系所 === 93 === With the increase of bandwidth and the progress in image compression, it has become acceptable to watch real-time high quality video through the network.. VBR compression can gain better quality but it introduces burstier traffic. This will cause a burden to the network service, making the bandwidth usage inefficient. Smoothing algorithm can deal with this problem; it can make the traffic less burstier. The optimal smoothing algorithm can optimizes the traffic in terms of the variance. In this thesis, first we introduce and analyze this algorithm; then we simulate it on real video traces, discussing the relation between buffer size and statistical data, such as peak frame size and variance. Second, we introduce the minimum unit(byte) in transmission rate to this algorithm and solve the problems it meets with. Then we simulate this algorithm on the same video trace and discuss its characteristics. Finally, we compare the original algorithm and the modified one.
|
|---|
