中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/29199
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 80990/80990 (100%)
Visitors : 42712757      Online Users : 1389
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29199


    Title: Harmonic broadcasting for video-on-demand service
    Authors: Juhn,LS;Tseng,LM
    Contributors: 資訊工程研究所
    Date: 1997
    Issue Date: 2010-06-29 20:16:10 (UTC+8)
    Publisher: 中央大學
    Abstract: Using conventional broadcasting, if we want to support a 120-minute popular movie every 10 minutes, we need 12 video channels. Suppose the set-top box at client end call buffer portions of the playing video on disk. Pyramid broadcasting schemes can reduce the bandwidth. requirements to 5.7 channels. We present a new scheme which only needs 3.2 channels. For a movie with length D minutes, if we want to reduce the viewer waiting time to D/N minutes, we only need to allocate H(N) video channels to broadcast the movie periodically. Where H(N) is the harmonic number of N, H(N)=1+1/2+...+1/N. In order to support video-on-demand service for a popular movie, the new scheme greatly reduce the bandwidth requirements.
    Relation: IEEE TRANSACTIONS ON BROADCASTING
    Appears in Collections:[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML532View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明