An effective and efficient traffic smoothing scheme for delivery of online VBR media streams
Ray-I Chang, Meng-Chang Chen, Jan-Ming Ho, Ming‐Tat Ko · 1999
Traffic smoothing for delivery of online VBR media streams is one of the most important problems in designing multimedia systems. Given available client buffer and a window-sliding size, conventional approaches try to reduce bandwidth allocated in each window. However, they can not lead to the minimization of bandwidth allocated for transmitting the entire stream. Although a window-sliding approach was introduced previously to further reduce the bandwidth allocated, it was computational costly. In this paper, an effective and efficient online traffic-smoothing scheme is proposed. Different from the conventional static window-sliding approaches, this approach dynamically decides the suitable window-sliding size to online smooth the bursty traffic. Then, an aggressive workahead scheme is applied in transmitting the entire stream. By examining different media streams, the approach has a small bandwidth, high bandwidth utilization and small computation cost. Considering the online transmission of a Star War movie, our approach result is 13% less for the bandwidth and 4% less for the network idle rate than SLWIN(1). Comparing the number of window sliding, our approach is 75% less than SLWIN(1). The relations between the characteristic of the input traffic and the behavior of obtained scheduling results are discussed. Finally, an extension of the proposed approach to resolve the latency and quality tolerance applications is also introduced.