Lin, Jeng-WeiJeng-WeiLinRAY-I CHANGHo, Jan-MingJan-MingHoFEI-PEI LAI2009-02-272018-07-062009-02-272018-07-06200403029743http://www.scopus.com/inward/record.url?eid=2-s2.0-35048890609&partnerID=MN8TOARShttp://ntur.lib.ntu.edu.tw//handle/246246/142054http://ntur.lib.ntu.edu.tw/bitstream/246246/142054/1/18.pdfTraffic smoothing is an efficient means to reduce the bandwidth requirement for transmitting a VBR video. For live video applications, Sen et al. present an online algorithm referred to as SLWIN(k) to compute the transmission schedule on the fly. SLWIN(K) looks ahead W frames to compute the transmission schedule for the next k frametimes, where k ≤ W. Note that W is upper bounded by the initial delay of the playback. The time complexity of SLWIN(k) is O(W * N/k) for an N frame live video. In this paper, we present an O(N) online traffic smoothing algorithm denoted as ATS (Aggressive Traffic Smoothing). ATS aggressively works ahead to transmit more data as early as possible for reducing the peak rate of the bandwidth requirement. We compare the performance of ATS with SLWIN(k) based on several benchmark video clips. Experiment results show that ATS further reduces the bandwidth requirement, especially for interactive applications in which the initial delays are small. © Springer-Verlag Berlin Heidelberg 2004.application/pdf232588 bytesapplication/pdfen-USBandwidth; Bandwidth requirement; Interactive applications; On the flies; On-line algorithms; On-line traffic; Time complexity; Traffic smoothing; Transmission schedules; Benchmarkingbook10.1007/978-3-540-30541-5_152-s2.0-35048890609http://ntur.lib.ntu.edu.tw/bitstream/246246/142054/1/18.pdf