English  |  正體中文  |  简体中文  |  Items with full text/Total items : 65317/65317 (100%)
Visitors : 21346089      Online Users : 354
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/8598


    Title: 熱門影片廣播法之影片區段復原機制;Segment Loss Recovery on Hot-Video Broadcasting
    Authors: 黃立勳;Li-Hsin Huang
    Contributors: 資訊工程研究所
    Keywords: 容錯復原;隨選視訊;群播;網路頻寬排程;快速下載;分段式廣播法;Video on Demand(VoD);Network Bandwidth Scheduling;Multicasting;Fast Downloading;Segment Based Broadcasting;Fault-Tolerant Recovery
    Date: 2002-07-11
    Issue Date: 2009-09-22 11:31:31 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 以一個VoD(隨選視訊系統、Video on Demand)系統而言,熱門影片被重覆選擇的機會較其它影片大,若觀看相同影片的頻寬可以共享,就可降低頻寬需求,所以之前的研究提出了各式的廣播演算法,提供在固定頻寬下,讓無限多位使用者共享影片資料,並保證一定等待時間。 在這些方法中,有部份演算法是將影片以「區段」(segment)分割,再以群播(multicast)方式傳送。而當這分割因某些狀況遺失可能會造成播放不順暢。本文提出多種方式來改善此問題。主要改善方法稱為「二次機會」(second chance),就是讓使用者預先多收一次區段減低遺失機率。而為了降低多次重送造成二倍頻寬花費,我們根據之前演算法,觀察出影片區段在播放時有明顯重覆出現的現象,於是針對每個演算法加以改進,保證至少有二次接收的機會。而之前無針對重送補救的演算法,也提出一個專門針對二次重送的方法,藉由相同的觀念可以發展為重送多次影片區段的演算法。最後再利用出現時間的間隔關係進一步降低重送的頻寬。 In VoD (video on demand) system, “Hot video” will always be selected. If the bandwidth can be shared to other people watch the same media. The bandwidth requirement can be decreased. The researches before propose many multi channels fast media broadcasting algorithms. Those algorithms can use limited bandwidth for unlimited people and promise constant longest waiting time. Movies separate as “segments” in some of those algorithms. The losing long playback time of segments will heavy impact the movie quality. This paper finds many solutions to solve this problem. The primary conception is “second chance”, which makes user will recovery from losing segments once. To decrease the demand of twice bandwidth cost, we first notice segments arriving periodically in currently algorithms. Than we try to make each algorithm can send segments at least twice per period. Besides, we also propose one original algorithm to encounter the un-efficiently bandwidth usage of improving algorithms. Finally, we improve our algorithm only re-sends segments beyond the tolerant time to further decreasing bandwidth.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

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