English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 109948/140897 (78%)
Visitors : 46094814      Online Users : 825
RC Version 6.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: https://nccur.lib.nccu.edu.tw/handle/140.119/114946


    Title: 低客戶端緩衝空間及小頻寬需求的熱門影片廣播法
    Authors: 游象甫
    楊宏昌
    簡聚毅
    曾黎明
    Keywords: 定期廣播法;緩衝空間需求;隨選視訊
    Periodic broadcasting buffer video-on-demand (VOD) cable TV
    Date: 2007
    Issue Date: 2017-11-30 14:30:33 (UTC+8)
    Abstract: 本文說明TANET 2007研討會之摘要格式,請務必照此格式編排資料廣播技術所需頻寬與請求到達的速率無關, 因此適合用於傳送熱門影片。其中一種廣播技術被稱為定期廣播法 (Periodical Broadcasting), 將熱門影片分割成多個片段 (segment), 然後這些片段同時在不同的資料頻道上重覆播放。一旦使用者想要觀看這個影片, 即從這些頻道下載影片的片段收看。定期廣播法中的 Greedy Disk-conserving Broadcasting (GDB) 允許使用者可以較小頻寬下載影片,與其他類似的方法比較, 如Skyscraper Broadcasting (SkB) 及Client-Centric Approach (CCA), GDB的使用者等待時間較少。本文進一步改善 GDB 讓其使用者所需的緩衝空間 (buffering spaces) 變小, 稱為 Reverse GDB (RGDB), 與 GDB 相比, RGDB 使用者的等待時間及頻寬相同, 在大多數的情況下, RGDB 的緩衝空間需求比 GDB 少35%到50%。
    Data broadcasting is independent of arrivals of requests, and thus it is suitable to transmit popular videos that may interest many viewers at a particular period of time. One broadcasting method (called periodic broadcasting) is to divide a popular video into segments, which are then simultaneously broadcast on different data channels. Once clients want to watch the video, they download the segments from these channels. Specially, the greedy disk-conserving broadcasting (GDB) scheme supports a client with a small bandwidth. In comparison with other similar schemes such as the skyscraper broadcasting (SkB) and the client-centric approach (CCA) schemes, the GDB clients have smaller waiting time. Extending GDB, this work designs a reverse GDB (RGDB) scheme to achieve small buffering spaces as well as low bandwidths at the client. Finally, an analysis shows that RGDB has 33%-50% smaller client buffer requirements than GDB in most situations.
    Relation: 2007台灣網際網路研討會論文發表論文
    網際網路技術
    Data Type: conference
    Appears in Collections:[TANET 台灣網際網路研討會] 會議論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML14View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback