博碩士論文 85345001 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:5 、訪客IP:3.85.214.0
姓名 楊明豪( ming-hour yang)  查詢紙本館藏   畢業系所 資訊工程學系
論文名稱 熱門電影的高效能廣播演算法
(Efficient Data Broadcasting Schemes for Videos of High Demand)
相關論文
★ 無線行動隨建即連網路上之廣播與繞徑問題★ 無線行動隨建即連網路上之媒體存取問題
★ 使用功率調整來增加多節點封包無線網路★ 在無線行動隨建即用網路下Geocast 之設計與實做經驗
★ 一個適用於熱門隨選視訊服務之快速排程廣播策略★ 應用數位浮水印技術於影像之智慧財產權保護與認證
★ 在寬頻分碼多重擷取技術上分配及再分配多重正交可變展頻係數碼★ 無線行動隨建即連網路上之廣播排程協定
★ 在無線行動隨建即連網路下支援即時多媒體傳送的媒介存取協定★ 以樹狀結構為基礎的Scatternet建構協定
★ 在無線感應器網路中具有省電機制並且採用對角線路徑的方向性擴散★ 隨意型無線網路上一個具有能量保存的GRID繞徑協定
★ 在無線感應器網路中具有省電機制的傳輸協定★ 隨意型無線網路上一個具有能量保存以及平衡的繞徑協定
★ 環形藍芽網路:一個藍芽通訊網路的新拓樸及其繞徑協定★ 在多連結無線隨意行動網路上路徑的生命週期
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 在本論文中我們針對熱門電影發展了幾個隨傳視訊『循環式廣播演算法』,來改善觀看者的等待時間的問題。首先,在本論文的第一部份,我們提出了一個新的廣播方法叫做“遞迴式頻寬切割法”來縮短新進入系統者的等待時間﹐且我們證明了這是目前為止我們可以發現到以每個區塊大小為一樣前提下最好的廣播方法,從實驗結果的圖上我們可以說,本方法在針對一部電影的分析上相當接近於理論上的最佳值。
在本論文的第二部份﹐我們提出了一個“借出與歸還”的方法來解決整個隨傳視訊系統間若有某幾部電影的在前一段時間單位沒有觀看者到達﹐而照成系統資源浪費的問題。當我們發現一些電影在前一個時間單位沒有觀看者要看這一部電影時﹐我們利用『一部電影借給多部電影』及『多部電影借給多部電影』兩個方法來解決這個問題。
『一部電影借給多部電影』這方法是一但系統發現前一個時間單位有一部電影沒有人進來觀看﹐就會把這個頻道借給其他幾部電影來減少進入系統的人的等待時間。而哪些電影是符合借這頻道的標準﹐其中一項最重要的準則就是﹐必須在一個單位時間內用完這個頻道。若這些電影利用這個頻道服務完前一個單位時間內進來的觀看者﹐結果其使用時間還沒有到達一個單位時間﹐我們可以再將這頻道借出給下一組符合這規定的一群電影。『多部電影借給多部電影』這方法是一但系統會將多部沒有人進來觀看的電影﹐的第一個頻道借給其他幾部電影來減少進入系統的人的等待時間。若這些電影利用這個頻道服務完前一個單位時間內進來的觀看者﹐結果其使用時間還沒有到達一個單位時間﹐我們一樣可以再將這頻道借出給下一組符合這規定的一群電影。
在本論文的最後一個部份﹐在這裡我們提出一個可以在原來電影仍有人在觀看但我們可以在“電影播放的中途”將該部電影的一個頻道給另外一部電影。對原來那部電影的新進觀看者來說其等待時間就會變成原來的兩倍,而拿到該頻道的電影其新進觀看者的等待時間就會變成原來的1/2。若將該部電影的兩個頻道給另外一部電影。則對原來那部電影的新進觀看者來說其等待時間就會變成原來的四倍,而拿到該頻道的電影其新進觀看者的等待時間就會變成原來的1/4。為了應用的方便以及證明這方法在做頻道轉換時已經在觀看電影的人都不會受到影響。
摘要(英) One way to broadcast a popular video is to use a number of dedicated channels,each responsible for broadcasting a portion of the video periodically in a pre-defined way.Thus the stress on channels can be alleviated, and new viewers need not have to wait long to start their playback. Many approaches falling in this category have been proposed.Two representative approaches are the Fast Broadcasting scheme and the PAGODA scheme, which can broadcast a video using k channels and have new-coming viewers wait no longer than D/2^k and D/5^k/2 time,respectively,
where D is the length of the video.
This thesis consists of three parts.In the first part of the dissertation, we focus on broadcasting schemes that partition the video into a number of fixe and schemes that are scheduled to broadcast on one of the channels periodically(such as FB and PAGODA). We propose two new schemes, called Recursive Frequency-Splitting (RFS) and m-RFS.RFS tries to arrange one segment in each iteration,and m-RFS tries to arrange $m$ segments in each iteration. These two schemes significantly improve over existing schemes in terms of viewe waiting time. Some lower bounds on the waiting time are also developed.
In the second part of the dissertation, we consider a set of videos.We focuses on several representative schemes
(such as FB, PAGODA, and RFS), which all share a FSFC property by repeatedly broadcasting first segment of the video on the first channel. Here, we propose a general Borrow-and-Return model, which can be immediately applied to any scheme owning
the FSFC property, to reduce the viewers’’ waiting time without
increasing the number of channels required. Intuitively, considering a group of videos, we lend the free time slots of videos without viewers to those videos with viewers to speedup the latter’’s transmission. Later on, some bandwidth may be vacated by the latter videos to benefit others’’ transmission. Effectiveness of this model is analyzed by applying it to the FB scheme.
In the third part of the dissertation, we propose a novel seamless channel transition enhancement on top of the FB scheme to dynamically change the number of channels assigned to a video
on-the-fly. Clients currently viewing this video will not experience any disruption because of the transition. A channel allocation scheme is also proposed based on the arrival rates of videos to minimize the average waiting experienced by all viewers. From the system manager’’s point of view, the enhancement will make the FB scheme more attractive.
關鍵字(中) ★ 排程
★ 數位影帶播放
★ 有線電視
★ 寬頻網路
★ 廣播
★ 隨傳視訊
★ 頻道配置
關鍵字(英) ★ Scheduling
★ Digital Video Broadcasting
★ Cable TV
★ Broadband Networks
★ Broadcasting
★ Video-On-Demand
★ Channel Allocation
論文目次 Cover
Contents
1. Introduction
1.1 Bandwidth Concerns of VOD Services
1.2 Storage Concerns of VOD Services
1.3 Research of Overview and Contributions
1.4 Organization of the Dissertation
2. Background and motivation
2.1 Batching Schemes
2.2 Periodically Broadcasting Schemes
3. Data Broadcasting for a Single Hot Vide
3.1 Introduction
3.2 The Recursive Frequency-Splitting (RFS) Scheme
3.3 Analysis and Comparison
3.4 Summary
4. Data Broadcasting for Multiple Hot Videos
4.1 Introduction
4.2 The Borrow-and-Return Model
4.3 Analysis and Comparison
4.4 Summary
5. Seamless Channel Transition
5.1 Introduction
5.2 Motivations
5.3 Channel Transition for the FB Scheme
5.4 Channel Allocation Policy
5.5 Summary
5.6 Proofs of Lemmas and Theorems
6. Conclusions and Future Work
參考文獻 [1] C. C. Aggarwal, J. L. Wolf, and P. S. Yu. On optimal batching policies for video-on-demand storage services. In IEEE Proceedings of the International Conference on multimedia Computing and Systems, pages 253-258, Jun. 1996.
[2] C. C. Aggarwal, J. L. Wolf, and P. S. Yu. A permutation-based pyramid broadcasting scheme for video-on-demand systems. In IEEE Proceedings of the International Conference on multimedia Computing and Systems, pages 118-126, Jun. 1996.
[3] P. W. Agnew and A. S. Kellerman. Distributed Multimedia. Addison Wesley.
[4] Y. H. Chang, D. Coggins, D. Pitt, and D. Skellern. An open-system approach to video on demand. IEEE Communication Magazine, 32:68-80, May 1994.
[5] T. Chiueh and C. Lu. A periodic broadcasting approach to video-on-demand service. International Society for Optical Engineering, 2615:162-169, Oct 1995.
[6] A. Dan, D. Sitaram, and P. Shahabuddin. Scheduling policies for an on-demand video server with batching. In Proc. of ACM Multimedia, pages 15-23, 1994.
[7] A. Dan, D. Sitaram, and P. Shahabuddin. Dynamic batching policies for an on-demand video server. Multimedia Systems, 4(3): 112-121, June 1996.
[8] D. Deloddere, W. Verbiest, and H. Verhille. Interactive video on demand. IEEE Communications Magazine, 32:82-88, May 1994.
[9] L. Gao, and D. Towsley. Supplying instantaneous video-on-demand services using controlled multicast. In IEEE Multimedia, pages 117-121, 1999.
[10] L. Gao, J. Kurose, and D. Towsley. Efficient schemes for broadcasting popular videos. In International Workshop on Network and Operating Systems Support for Digital Audio and Video, pages 317-329, Aug 1998.
[11] W. Hodges, S. Manon, and J. P. P, Jr. Video on demand: Architecture, system, and applications. Building on Infrastructure for Managing Compressed Video Systems, pages 791-803, 1993.
[12] K. Hua, Y. Cai, and S. Sheu. Patching: A Multicast technique for true video-on-demand services. In ACM Multimedia, pages 191-200, Setp. 1998.
[13] K. A. Hua and S. Shu. Skyscraper broadcasting: A new broadcasting scheme for metropolitan video-on-demand systems. In ACM SIMCOMM, Setp. 1997.
[14] L.-S. Juhn and L.-M. Tseng. Fast broadcasting for hot video access. In Real-Time Computing Systems and Applications, pages 237-243, Oct. 1997.
[15] L.-S. Juhn and L.-M. Tseng. Harmonic broadcasting for video-on-demand service. IEEE Transactions on Broadcasting, 43(3): 268-271, Sept. 1997.
[16] L.-S. Juhn and L.-M. Tseng. Staircase Data Broadcasting and Receiving Scheme for Hot Video Service. IEEE Transactions on Consumer Electronics, 43(4): 1110 - 1117, 1997.
[17] L.-S. Juhn and L.-M. Tseng. Enhanced harmonic data broadcasting and receiving scheme for popular video service. IEEE Transactions on Consumer Electronics, 44(2): 343-346, May 1998.
[18] L.-S. Juhn and L.-M. Tseng. Fast data broadcasting and receiving scheme for popular video service. IEEE Transactions on Broadcasting, 44(1): 100-105, March 1998.
[19] T.L.Kunii, et al. Issues in storage and retrieval of multimedia data. Multimedia Systems, 3(5):298-304, 1995
[20] T. D. C. Little and D. Venkatesh. Prospects for interactive video-on-demand. IEEE Multimedia, 1(3):14-24, March 1994.
[21] B. Ozden, R. Rastogi, and A. Silberschatz. On the design of a low cost video-on-demand storage system. Multimedia Systems, 4(1):40-54, 1996
[22] J.-F. Paris. A simple low-bandwidth broadcasting protocol. In International Conference on Computer Communication and Network, pages 118-123, 1999.
[23] J.-F. Paris, S.-W. Carter, and D.-D. Long. A hybrid broadcasting protocol for video on demand. In Multimedia Computing and Networking, pages 317-326, 1999.
[24] W. D. Sincoskie. System Architecture for a Large Scale Video On Demand Services. Computer Networks and ISDN systems, 22:565-570, 1991.
[25] Y.-C.Tseng, C.-M.Hsieh, M.-H. Yang, W.-H. Liao, and J.-P.Sheu. Data Broadcasting and seamless channel transition for highly-demanded videos. In INFOCOM, pages 727-736, 2000.
[26] S. Viswanathan and T. Imielinski. Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems, 4:197-208, 1996.
[27] Y.-C.Tseng, M.-H. Yang. A recursive frequency-splitting scheme for broadcasting hot videos in vod service. 2000
[28] Z.-Y. Yang. The Telepresentation System over Internet with Latecomers Support. PhD thesis, national Central University, July 2000.
[29] Z.-Y. Yang., L.-S. Juhn, and L.-M. Tseng. On optimal broadcasting scheme for popular video service. IEEE Transaction on Broadcasting, 45(3):318-322, 1999.
指導教授 許健平(Jang-Ping Sheu) 審核日期 2001-6-5
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明