60頁(yè)共計(jì)32869字

摘要
P2P（Peer to Peer）技術(shù)在分布式系統(tǒng)和資源共享應(yīng)用領(lǐng)域中得到迅速的發(fā)展，在視頻應(yīng)用領(lǐng)域，近幾年國(guó)內(nèi)外涌現(xiàn)出大量的使用P2P技術(shù)的產(chǎn)品。當(dāng)前非結(jié)構(gòu)化P2P網(wǎng)絡(luò)主要使用集中式查找、洪泛式查找和混合式查找，隨著網(wǎng)絡(luò)規(guī)模的擴(kuò)大，非結(jié)構(gòu)化P2P網(wǎng)絡(luò)暴露出擴(kuò)展性能較差的問題。本文針對(duì)P2P視頻系統(tǒng)中的一些基本問題進(jìn)行了研究和實(shí)驗(yàn)，包括：節(jié)點(diǎn)的路由和查找算法、數(shù)據(jù)調(diào)度和節(jié)點(diǎn)選擇策略、網(wǎng)絡(luò)通訊等。本文的主要研究工作和貢獻(xiàn)如下：
（1）節(jié)點(diǎn)的路由和查找算法。查找的效率一直是分布式Hash表一個(gè)備受關(guān)注的指標(biāo)，在分布式哈希表中，比較著名的協(xié)議包括Chord、Pastry、Tapestry和CAN（Content Addressable Network）等。本文結(jié)合具體的應(yīng)用系統(tǒng)的特點(diǎn)和需要修改或者精簡(jiǎn)了路由查找算法，使它更適合P2P視頻點(diǎn)播的應(yīng)用。
（2）數(shù)據(jù)調(diào)度和節(jié)點(diǎn)選擇策略。提出了節(jié)點(diǎn)學(xué)習(xí)歷史經(jīng)驗(yàn)的數(shù)據(jù)調(diào)度方法和超時(shí)數(shù)據(jù)的緊急調(diào)度方法。為了充分利用節(jié)點(diǎn)的資源能力、最大程度地減小中心服務(wù)器的壓力，設(shè)計(jì)并實(shí)現(xiàn)了節(jié)點(diǎn)學(xué)習(xí)歷史經(jīng)驗(yàn)的自適應(yīng)的數(shù)據(jù)調(diào)度和節(jié)點(diǎn)選擇算法；另一方面，為了保證數(shù)據(jù)在規(guī)定的時(shí)間內(nèi)到達(dá)，設(shè)計(jì)并實(shí)現(xiàn)了一種超時(shí)數(shù)據(jù)的緊急時(shí)刻調(diào)度算法。
（3）網(wǎng)絡(luò)通訊。用戶的網(wǎng)絡(luò)環(huán)境多種多樣，有些位于公網(wǎng)，有些位于各種各樣的網(wǎng)關(guān)之后，為了使所有用戶平等地使用系統(tǒng)的服務(wù)，設(shè)計(jì)并實(shí)現(xiàn)了UDP（User Datagram Protocol）打洞方案解決了部分網(wǎng)關(guān)之后的用戶的通訊問題，使它們達(dá)到和公網(wǎng)上的用戶平等的地位。
實(shí)驗(yàn)證明，本文提出的數(shù)據(jù)調(diào)度策略和網(wǎng)絡(luò)通訊方法都是有效的，DHT在較小規(guī)模的實(shí)驗(yàn)環(huán)境中可行，目前還沒有推廣到大規(guī)模的網(wǎng)絡(luò)環(huán)境中。
目 錄
第一章 緒論 1
1.1 P2P技術(shù)簡(jiǎn)介 1
1.2 P2P在視頻點(diǎn)播中的應(yīng)用 3
1.3 國(guó)內(nèi)P2P視頻發(fā)展現(xiàn)狀 6
1.4 國(guó)外P2P視頻發(fā)展情況 8
1.5 P2P視頻以何制勝 9
1.6 面臨的挑戰(zhàn) 9
1.7 本文的主要工作和文章結(jié)構(gòu) 10
第二章 P2P查找算法及改進(jìn) 12
2.1 P2P網(wǎng)絡(luò)模型 12
2.2 分布式哈希搜索算法 16
2.2.1 Chord協(xié)議 16
2.2.2內(nèi)容訪問網(wǎng)絡(luò)（Content-Addressable Network，CAN） 24
2.2.3 Pastry系統(tǒng) 29
第三章 關(guān)鍵技術(shù)的研究和運(yùn)用 35
3.1 項(xiàng)目簡(jiǎn)介 35
3.2 基于劃分區(qū)域的查找 38
3.3 數(shù)據(jù)調(diào)度策略 40
3.4 復(fù)雜網(wǎng)絡(luò)環(huán)境中的通訊 46
3.4.1 基本概念 46
3.4.2 面臨的困難及其解決的方法 48
3.4.3 實(shí)驗(yàn) 51
第四章 總結(jié)和展望 53
參考文獻(xiàn) 54
致謝 56

關(guān)鍵詞：非結(jié)構(gòu)化，結(jié)構(gòu)化，分布式哈希，數(shù)據(jù)調(diào)度，穿越網(wǎng)關(guān)

參考文獻(xiàn)
[1] Napster, http://www.napster.com
[2] Gnutella, http://gnutella.wego.com
[3] KaZaA, http://kazaa.com
[4] BitTorrent, http://bitconjurer.org/BitTorrent/
[5] Skype, http://www.skype.com.
[6] Ion Stoica, Robert Morris, David Karger, M.Frans Kaashoek, Hari Balakrishnan, Chord A Scalable Peer-to-peer Lookup Service for Internet Applications, In Proceeding of ACM SIGCOMM 2001, San Diego, California, USA
[7] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker, A Scalable Content-Addressable Network, In Proceedings of ACM SIGCOMM2001, San Diego, California, USA
[8] Antony Rowstron and Peter Druschel, Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems, IFIP/ACM International Conference on Distributed Systems Platforms(Middleware 2001).
[9] BenY Zhao, John Kubiatowicz and Anthony D. Joseph. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical Report No. UCB/CSD-01-1141, University of California Berkeley.
[10] David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy, Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web, In Proceedings of the 29th Annual ACM Symposium on Theory of Computing
[11] Cox R, Muthitacharoen A, Morris R T. Serving dns using a peer-to-peer lookup service. In: Proceedings of First International Workshop on Peer-to-Peer Systems, Cambridge, March 2002
[12] Jacky Chu, Kevin Labonte, George Bissiasetal, A trace-driven evaluation of chord, Technical report June 2004
[13] RATNASAMY S, HANDLEY M, KARP R, Application-level Multicast using Content-Addressable Networks, Proceedings of NGC, 2001
[14] Yang B, Garcia-Molina H, Improving search in peer-to-peer networks, Distributed Computing Systems, IEEE Computer Society, 2002.5.14
[15] Balakrishnan H, Kaashoek M F, Karger D, Looking up data in p2p systems, Communications of the ACM, 2003
[16] Hefeeda M, Habib A, Botev B, PROMISE: a peer-to-peer media streaming using collect cast, Proceedings of the ACM Multimedia, New York, ACM Press, 2003
[17] Guo Y, Suh K, Kurose J, P2Cast: P2P patching scheme for Vod service, Proceeding of the WWW 2003, New York, ACM Press, 2003
[18] Do T, Hua K, Tantaoui M, P2Vod: Providing fault tolerant video-on-demand streaming in peer-to-peer environment, Proceedings of the IEEE, Paris, IEEE Communications Society, 2004
[19] J. Rosenberg , J. Weinberger , et. STUN - Simple Traversal of User Datagram Protocol (UDP) Through Network Address Translators (NATs), rfc 3489
[20] Microsoft IPv6,
http://www.microsoft.com/china/technet/prodtechnol/winxppro/maintain/Teredo.mspx
[21] 董海韜， 基于對(duì)等網(wǎng)絡(luò)流媒體傳輸系統(tǒng)技術(shù)的研究，清華大學(xué)， 2005.5
[22] 馬凌霄，基于p2p網(wǎng)絡(luò)的流媒體技術(shù)研究，浙江大學(xué)， 2005年
[23] Chao Zhang, Hai Jin, Dafu Deng, Sirui Yang, Quan Yuan and Zuoning Yin, Cluster and Grid Computing Lab. Anysee: Multicast-based Peer-to-Peer Media Streaming Service System, 2005 Asia-Pacific Conference on Communications, Perth, Western Australia, 3 - 5 October 2005.
[24] Xinyan Zhang, Jiangchuan Liu, Bo Li, and Tak-Shing Peter Yum, CoolStreaming/DONet: A Data-driven Overlay Network for Peer-to-Peer Live Media Streaming, 2004
[25] Venkat Padmanabhan, Microsoft Research, Resilient Peer-to-Peer Streaming, 2003.3
[26] Kai Hwang, Internet Security and Cyber Trust for Integrated Web Services and P2P Grid Computing, 2005.12
[27] Meng Zhang, Jian-Guang Luo, Li Zhao, and Shi-Qiang Yang, A Peer-to-Peer Network for Live Media Streaming – Using a Push-Pull Approach, Tsinghua University, 2005
[28] Xiaojun Hei, Chao Liang, Jian Liang, Yong Liu and Keith W. Ross, Insights into PPLive: A Measurement Study of a Large Scale P2P IPTV System.
[29] M.Ripeanu. Peer-to-peer Architecture Case Study: Gnutella. In Proceedings of International Conference on P2P Computing, 2001.
[30] C-NET NEWS, Napster among fastest-growing Net technologies, Oct. 2000, http://news.com.com/2100-1023-246648.html
[31] S. Deering and D. Cheriton, Multicast Routing in Datagram Internetworks and Extended LANs, ACM Transactions on Computer Systems, May 1990
[32] S. E. Deering, Multicast Routing in a Datagram Internetwork, Ph.D. thesis, Stanford University, Dec 1991
[33] S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C. Liu, and L.Wei, The PIM Architecture for Wide-Area Multicast Routing, IEEE/ACM Transactions on Networking, April 1996
[34] S. Floyd, V. Jacobson, C.G. liu, S. McCanne, and L. Zhang, A reliable multicast framework for light-weight sessions and application level framing, IEEE/ACM Transaction on networking, Dec. 1997
[35] J.C. Lin and S. Paul, A reliable multicast transport protocol, in Proceedings Of IEEE INFOCOM, 1996
[36] J. H. Saltzer, D. P. Reed, and D. D. Clark, End-to-end arguments in system design, ACM Transactions on Computer Systems, Nov. 1984
[37] S. Saroiu, P. Gummadi, and S. Gribble, A Measurement Study of Peer-to-Peer File Sharing Systems, Proceedings of SPIE/ACM MMCN 2002, Jan. 2002