English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 41635501      線上人數 : 1420
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29199


    題名: Harmonic broadcasting for video-on-demand service
    作者: Juhn,LS;Tseng,LM
    貢獻者: 資訊工程研究所
    日期: 1997
    上傳時間: 2010-06-29 20:16:10 (UTC+8)
    出版者: 中央大學
    摘要: 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.
    關聯: IEEE TRANSACTIONS ON BROADCASTING
    顯示於類別:[資訊工程研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML526檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 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 ©   - 隱私權政策聲明