English  |  正體中文  |  简体中文  |  Items with full text/Total items : 65421/65421 (100%)
Visitors : 22271024      Online Users : 204
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/8467


    Title: 一個適用於熱門視訊服務之遞迴頻率分割廣播策略;A Recursive Frequency-Splitting Scheme for Broadcasting Hot Videos
    Authors: 張致和;Chi-He Chang
    Contributors: 資訊工程研究所
    Keywords: 數位視訊撥放;有線電視;寬頻網路;廣播;排程;隨選視訊;Digital Video Broadcasting;Cable TV;Broadband Networks;Broadcasting;Scheduling;Video-On-Demand;VOD
    Date: 2000-07-06
    Issue Date: 2009-09-22 11:27:44 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 將一部熱門影片以廣播的型式播送至用戶端,可讓多數的用戶共享頻道以減少頻道的使用量。一類新的廣播策略是將一部影片切成等長度的數個片斷, 在伺服端利用多個頻道分別以特定的週期傳送這些片斷, 以大幅縮短用戶端的等待時間,其中Fast Broadcasting scheme(FB scheme)和 Pagoda Broadcasting scheme (PB scheme ) 便是這類策略的代表。 若使用k個頻道來廣播一部片長為D的熱門影片,FB scheme將可減少用戶端的最大等待時間至O(D / (2^k) ) 的程度, 而PB scheme 的最大等待時間則為 O(D / (5^(k/2)))。 在這篇論文當中,我們提出了一種新的頻道配置策略 Recursive Frequency-Splitting scheme ( RFS scheme), 以一種簡單而有系統的方式來配置頻道, 而且更能有效的利用頻寬, 大幅縮短用戶端的等待時間。另外我們也對這類問題的最大等待時間的下限做了一些分析和討論。 One way to broadcast a popular/hot video is to let multiple users share a few channels. The stress on the scarce channels can be alleviated without sacrificing viewer waiting time. One common approach is to partition the video into fixed-length segments, which are broadcast on several channels periodically. Two representative approaches are the Fast Broadcasting scheme and the PAGODA scheme , which can broadcast a video using k channels by having new-coming viewers to wait no longer than O(D/2^k) and O(D/5^(k/2)) time, respectively, where D is the length of the video. In this paper, we propose a new scheme, called Recursive Frequency-Splitting (RFS), that significantly improves over existing schemes in terms of viewer waiting time. Some lower bounds on the waiting time are also developed.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat
    0KbUnknown568View/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 ©   - Feedback  - 隱私權政策聲明