Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Electrical Engineering / 電機工程學系
  4. FOS: A Funnel-Based Approach for Optimal Online Traffic Smoothing of Live Video
 
  • Details

FOS: A Funnel-Based Approach for Optimal Online Traffic Smoothing of Live Video

Journal
IEEE Transactions on Multimedia
Journal Volume
8
Journal Issue
5
Pages
996-1004
Date Issued
2006
Date
2006
Author(s)
Lin, Jeng-Wei
RAY-I CHANG  
Ho, Jan-Ming
FEI-PEI LAI  
DOI
10.1109/TMM.2006.879868
URI
http://ntur.lib.ntu.edu.tw//handle/246246/142063
https://www.scopus.com/inward/record.uri?eid=2-s2.0-33749507914&doi=10.1109%2fTMM.2006.879868&partnerID=40&md5=9bbca902fcee915286ff50c1a2d4a514
Abstract
Traffic smoothing is an efficient means to reduce the bandwidth requirement for transmitting a variable-bit-rate video stream. Several traffic-smoothing algorithms have been presented to offline compute the transmission schedule for a prerecorded video. For live video applications, Sen et al. present a sliding-window algorithm, referred to as SLWIN (k), to online compute the transmission schedule on the fly. SLWIN (k) looks ahead W video 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 transmission. 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 and two variants, denoted as FOS, FOS1 and FOS2, respectively. Note that O(N) is a trivial lower bound of the time complexity of the traffic-smoothing problem. Thus, the proposed algorithm is optimal. We compare the performance of our algorithms with SLWIN (k) based on several benchmark video clips. Experiment results show that FOS2, which adopts the aggressive workahead heuristic, further reduces the bandwidth requirement and better utilizes the client buffer for real-time interactive applications in which the initial delays are small. © 2006 IEEE.
Subjects
Live video; Multimedia streaming; Online delivery; Traffic smoothing
Other Subjects
Live video; Multimedia streaming; Online delivery; Traffic smoothing; Algorithms; Bandwidth; Image communication systems; Multimedia systems; Online systems; Real time systems; Telecommunication traffic
Type
journal article
File(s)
Loading...
Thumbnail Image
Name

23.pdf

Size

1.02 MB

Format

Adobe PDF

Checksum

(MD5):6ebf0be5279042cb83dd3666228ea2d4

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science