跳到主要內容

臺灣博碩士論文加值系統

(44.220.181.180) 您好!臺灣時間:2024/09/09 17:03
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:蔡明得
研究生(外文):Ming-te Tsai
論文名稱:以vEB-樹為基礎提供互動式操作的點對點網路隨選視訊服務
論文名稱(外文):A vEB-Tree based Strategy for Interactive VoD Services in P2P Networks
指導教授:李宗南李宗南引用關係
指導教授(外文):Chung-Nan Lee
學位類別:碩士
校院名稱:國立中山大學
系所名稱:資訊工程學系研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2009
畢業學年度:97
語文別:英文
論文頁數:53
中文關鍵詞:網路隨選視訊互動式點對點vEB-樹
外文關鍵詞:Video on demandVoDInteractivePeer-to-peervEB-treeP2P
相關次數:
  • 被引用被引用:0
  • 點閱點閱:242
  • 評分評分:
  • 下載下載:20
  • 收藏至我的研究室書目清單書目收藏:0
在早期有關點對點網路的研究都假設使用者在觀看網路視訊節目時都會從頭開始觀看節目直到離開,且限制使用者在觀看的過程中不能有所謂互動操作的發生,所謂的互動操作大約是包括,轉台、跳躍、快轉、慢轉等。實際上,要在點對點環境中的網路視訊節目裡提供這些互動式的操作的確是一個很大的難題。在本論文中,我們提出了一個建構在vEB-樹的點對點網路環境。本論文中假設一個節目的影片是可以被分成好幾個片段,而這些片段被分佈存放在系統中各個點的身上,並且提出一個有策略,包括了以vEB-樹為基礎的拓撲、搜尋需求影片片段的程序、以及影片分散的方法。如果運用這種樹的概念來分佈這些節目片段,除了可以提升互動式操的效率外,也同時可以節省掉許多額外的控制訊息。另外,針對各個點應該儲存哪一個片段用來服務其它點,也提出更有效率決定方法,用以降低對伺服器需求。透過模擬的結果,可以証明論文中所提出來的系統在互動式網路視訊節目的點對點在跳躍延遲、伺服器壓力、及維持的鄰居數目,比起Baton、BBUT和VMesh有更優秀的表現。
To provide interactive operations such as fast-forward, slow-forward, switch channel, and jump function for peer-to-peer on demand video streaming is a challenge. In this thesis, we proposed a vEB-tree (van Emde Boas tree) based architecture for interactive VoD services in peer-to-peer networks. The proposed architecture assumes videos can be divided into many segments, and these segments are stored in each peer. In the architecture, it includes vEB-tree based topology, procedure of demand segment search, and a distribution scheme. It not only efficiently provides interactive operations but also reduces the control messages. Additionally, each peer stores segments based on the proposed distribution scheme to reduce the server stress. Experimental results demonstrate that the proposed architecture outperforms Baton, BBTU, and VMesh in terms of jump latency, server stress, and neighbors’ maintenance cost.
Chapter 1. INTRODUCTION ...................................................................................1
Chapter 2. RELATED WORK ..................................................................................3
Chapter 3. THE PROPOSED ARCHITECTURE .....................................................6
3.1. Overview of the architecture ...........................................................................6
3.2. Symbol definition ............................................................................................9
3.3. Overview of the vEB-tree based topology ......................................................9
3.4. The procedure of demand segment search ....................................................14
3.5. Distribution Scheme ......................................................................................18
3.6. IPTV application description .........................................................................19
3.6.1 Normal playback function .....................................................................21
3.6.2 Switch channel .......................................................................................22
3.6.3 Jump function ........................................................................................22
3.6.4 Fast forward function.............................................................................23
3.6.5 User interface .........................................................................................24
Chapter 4. PERFORMANCE EVALUATION ........................................................28
4.1. Simulation model ...........................................................................................28
4.1.1 The popularity model of seconds in a video ..........................................28
4.2. Jump latency ..................................................................................................30
4.3. The cost of maintaining neighbors ................................................................33
4.4. Estimation accuracy of the proposed distribution scheme ............................35
4.5. Server stress ...................................................................................................39
Chapter 5. CONCLUSION .....................................................................................41
REFERENCES ..............................................................................................................42
[1] Shi Z, Kuo CC. Recursive patching for video-on-demand (VOD) systems with limited client buffer constraint. IEEE International Symposium on Circuits and Systems 2002; 1: I-373-4.
[2] BitTorrent, [online], http://www.bittorrent.com/
[3] eMule, [online], http://www.emule-project.net/
[4] Foxy, [online], http://download.gofoxy.net/
[5] Hefeeda M, Habib A, Botev B, Xu D, Bhargava B. PROMISE: Peer-to-Peer Media Streaming Using CollectCast. ACM International Conference on Multimedia 2003; p. 45–54.
[6] Small T, Li B, Liang B. Outreach: Peer-to-Peer Topology Construction towards Minimized Server Bandwidth Costs. IEEE Journal on Selected Areas in Communication 2007; 25: 35-11.
[7] Do TT, Hua KA, Tantaoui MA. P2VoD: Providing Fault Tolerant Video-on-Demand Streaming in Peer-to-Peer Environment. IEEE International Conference on Communications 2004; 3:1467-6.
[8] Guo Y, Suh K, Kurose J, Towsley D. P2Cast: Peer-to-peer Patching Scheme for VoD Service. ACM International World Wide Web Conference 2003; p.301- 309.
[9] Liu Y, Xiao L, Ni LM. Building a Scalable Bipartite P2P Overlay Network. IEEE Transaction on Parallel and Distributed Systems 2007; 18:1296-11.
[10] Zhang X, Liu J, Li B, Yum TP. CoolStreaming/DONet: A DataDriven Overlay Network for Efficient Live Media Streaming. IEEE INFOCOM Conference 2005; p.2102-2111.
[11] Zhang M, Tang Y, Zhao L, Luo JG, Yang SQ. GridMedia: A Multi-Sender Based Peer-to-Peer Multicast System for video streaming. IEEE International Conference on Multimedia and Expo 2005; p.614-617.
[12] Venkatramen V, Yoshida K, Francis P. Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast. IEEE International Conference on Network Protocols 2006; p.2-11.
[13] Banerjee S, Bhattacharjee B, Kommareddy C. Scalable Application Layer Multicast. ACM SIGCOMM Conference 2002; p205-217.
[14] Tran D, Hua K, Do T. A Peer-to-Peer Architecture for Media Streaming. IEEE Journal on Selected Areas in Communications 2004; 22: 121-13.
[15] Wong YW, Lee YB, Li OK, Chan SH. Supporting Interactive Video-on-Demand with Adaptive Multicast Streaming. IEEE Transactions on Circuits and Systems for Video Technology 2007; 17: 129-14.
[16] Guo Y, Yu S, Liu H, Mathur S, Ramaswamy K. Supporting VCR Operation in a Mesh-based P2P VoD System. IEEE Consumer Communications and Networking Conference 2008; p. 452-457.
[17] Yiu WP, Jin X, Chan SH. VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming. IEEE Journal on Selected Areas in Communication 2007; 25:1717-15.
[18] Zhang H, Goel A, Govindan R. Improving lookup latency in distributed hash table systems using random sampling. IEEE/ACM Transactions on Networking 2005; 13:1121-14.
[19] Stoica I, Morris R, Nowell L, Karger R, Kaashoek M, Dabek F, Balakrishnan H. Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking 2003; 11:17-16.
[20] Maymounkov P, Mazieres D. Kademlia: A peer-to-peer information system based on the XOR metric. International Workshop on Peer-to-peer Systems 2002; p. 53-65.
[21] Rhea S, Godfrey B, Karp B, Kubiatowicz J, Ratnasamy S, Shenker S, Stoica I, Yu H. OpenDHT: A public DHT service and its uses. ACM SIGCOMM Conference 2005; p. 73–84.
[22] Chawathe Y, Ramabhadran S, Ratnasamy S, LaMarca A, Shenker S, Hellerstein J. A case study in building layered DHT applications. ACM SIGCOMM Conference 2005; p. 97–108.
[23] Xu C, Muntean GM, Fallon E, Hanley A. A Balanced Tree-based Strategy for Unstructured Media Distribution in P2P Networks. IEEE International Conference on Communications 2008; p. 1797-1801.
[24] Jagadish HV, Ooi BC, Vu QH. BATON: A balanced tree structure for peer-to-peer networks. International Conference on Very Large Data Bases 2005; p. 661-672.
[25] van Emde Boas P, Kaas R, Zijlstra E. Design and implementation of an efficient priority queue. Theory of Computing Systems 1976; 10: 99-29.
[26] Floyd, [online], http://en.wikipedia.org/wiki/Floyd_algorithm/
[27] NS-2, [online], http://www.isi.edu/nsnam/ns/
[28] Zegura EW, Calvert KL, Bhattacharjee S. How to Model an Internetwork. IEEE INFOCOM 1996; 2:594-8.
[29] Mehyar M, Spanos D, Pongsajapan J, Low SH, Murray RM. Asynchronous Distributed Averaging on Communication Networks. IEEE/ACM Transactions on Networking 2007; 15: 512-9.
[30] Zheng C, Shen G, Li S. Distributed Prefetching Scheme for Random Seek Support in Peer-to-Peer Streaming Applications. ACM Workshop on Advances in Peer-to-Peer Multimedia Streaming 2005; p. 29-38.
[31] VLCPlayer, [online], http://www.videolan.org/vlc/
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊