Aggressive Traffic Smoothing for Delivery of Online Multimedia
Journal
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Journal Volume
3331
Pages
114-121
Date Issued
2004
Date
2004
Author(s)
Abstract
Traffic 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.
Other Subjects
Bandwidth; Bandwidth requirement; Interactive applications; On the flies; On-line algorithms; On-line traffic; Time complexity; Traffic smoothing; Transmission schedules; Benchmarking
Type
book
File(s)![Thumbnail Image]()
Loading...
Name
18.pdf
Size
227.14 KB
Format
Adobe PDF
Checksum
(MD5):ad3e5ef55873aac3bfffef934414b0e9