基于对等网络的音视频通信系统的研究
|
摘要
音视频通信系统在当前的应用极为广泛,也日益重要。目前大部分采用C/S模式,在这种模式中,服务器要承担所有的重担,这给服务器造成了极大的压力,服务器无疑是系统最大的瓶颈,对等(P2P)技术的出现给这个问题带来了可行的解决途径。根据P2P的技术特征,主要的研究与应用问题集中在所形成的覆盖网络层。从而本文最终的问题就是如何设计一个优秀的P2P覆盖网络模型,这也是P2P技术研究与应用的关键。
因此,本文设计了一个层次化的拓扑感知网络模型――PPAVCS网络模型,并设计了相应的算法。模型是在Kademlia网络模型基础上的改进,主要针对逻辑网络与物理网络不匹配和节点异构性这两个结构化网络普遍存在的问题做了尝试性的解决。
在模型中引入了超级节点和域的概念,超级节点是由综合性能强的节点担当,一个域是由一个超级节点和与它物理距离相近的普通节点组成,从而达到与物理网络匹配和节点异构性的目的。普通节点只能在域内查询资源,当它查询失败时,由超级节点帮助在域间进行查询。最后在模拟环境中通过P2PSim模拟器对模型性能进行了模拟分析,仿真结果表明改进的模型性能优于Kademlia网络模型,同时设计实现了一个具备基本功能的音视频通信系统,以验证模型的现实可行性。
At the present time, Audio & Video Communication (AVC) systems are widely used and become more important in people’s life. But most systems are designed based on C/S model, in which the Server should perform all the tasks, they cause the Server a heavy burden, and server became the main bottle-neck of systems. The emergence of P2P brings a feasible solution to the problem. According to the technical features of P2P, problems of the research on P2P and application of it mainly concentrate on the Overlay network. So how to design an outstanding P2P Overlay network model is the last problem of the thesis.
So the thesis designs a hierarchical & topology-aware network model and relevant algorithm based on the Kademlia network. The improvement mainly focuses on the two prevalent issues about the current structural P2P network: logical network mismatch with the physical one and node’s heterogeneity.
The thesis introduces SuperNode and zone concept in the model. The SuperNode is acted by the node which has strong integrated performance; the zone has one SuperNode and some NormalNodes which have similar distance from the SuperNode of the zone, so to achieve the purpose of the match with physical network and node’s heterogeneity. When the NormalNode query resources, it queries them in the zone firstly, if if failed, then it queries them in other zones through the SuperNode of the zone. In the end, the thesis not only simulate and analysis its performance through P2PSim simulator, the simulative results demonstrate that the performance of improved model is better than the Kademlia network model, but also design and realize an AVC system to validate its practical feasibility, which has some basic functions.
因此,本文设计了一个层次化的拓扑感知网络模型――PPAVCS网络模型,并设计了相应的算法。模型是在Kademlia网络模型基础上的改进,主要针对逻辑网络与物理网络不匹配和节点异构性这两个结构化网络普遍存在的问题做了尝试性的解决。
在模型中引入了超级节点和域的概念,超级节点是由综合性能强的节点担当,一个域是由一个超级节点和与它物理距离相近的普通节点组成,从而达到与物理网络匹配和节点异构性的目的。普通节点只能在域内查询资源,当它查询失败时,由超级节点帮助在域间进行查询。最后在模拟环境中通过P2PSim模拟器对模型性能进行了模拟分析,仿真结果表明改进的模型性能优于Kademlia网络模型,同时设计实现了一个具备基本功能的音视频通信系统,以验证模型的现实可行性。
At the present time, Audio & Video Communication (AVC) systems are widely used and become more important in people’s life. But most systems are designed based on C/S model, in which the Server should perform all the tasks, they cause the Server a heavy burden, and server became the main bottle-neck of systems. The emergence of P2P brings a feasible solution to the problem. According to the technical features of P2P, problems of the research on P2P and application of it mainly concentrate on the Overlay network. So how to design an outstanding P2P Overlay network model is the last problem of the thesis.
So the thesis designs a hierarchical & topology-aware network model and relevant algorithm based on the Kademlia network. The improvement mainly focuses on the two prevalent issues about the current structural P2P network: logical network mismatch with the physical one and node’s heterogeneity.
The thesis introduces SuperNode and zone concept in the model. The SuperNode is acted by the node which has strong integrated performance; the zone has one SuperNode and some NormalNodes which have similar distance from the SuperNode of the zone, so to achieve the purpose of the match with physical network and node’s heterogeneity. When the NormalNode query resources, it queries them in the zone firstly, if if failed, then it queries them in other zones through the SuperNode of the zone. In the end, the thesis not only simulate and analysis its performance through P2PSim simulator, the simulative results demonstrate that the performance of improved model is better than the Kademlia network model, but also design and realize an AVC system to validate its practical feasibility, which has some basic functions.
引文
[1]王晓燕,郑建宏,视频压缩标准的技术原理与发展,重庆学院,http://www.cn-asp.net/n118c29.aspx,2005.
[2] Ben Y.Zhao,John Kubiatowicz,Anthony D.Joseph,Tapestry:An Infrastructure for Fault-tolerant Wide-area Location and Routing , University of California ,Berkeley,April 2001.
[3] Ben Y.Zhao,Ling Huang,Jeremy Stribling,et al,Tapestry:A Resilient Global-Scale Overlay for Service Deployment,IEEE,Janaury 2004,Vol.22,No.1:41-53.
[4] John Kubiatowicz,David Bindel,Yan Chen,et al,OceanStore:An Architecture for Global-Scale Persistent Storage,New York:ACM,Novemeber 2000,Vol.35,No.11:190-201.
[5] Ion Stoica, Robert Morris, David Liben-Nowell, et al, Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,IEEE,Febuary 2003,Vol.11,No.1:17-32.
[6] Sylvia,Ratnasamy,Paul Francis,et al,A Scalable Content-Addressable Network,New York:ACM,2001:161-172.
[7]罗杰文,P2P综述,中科院计算技术研究所,2005年11月.
[8]周世杰,秦志光,刘锦德,对等计算技术分析,计算机应用,2003年10月,第23卷(第10期):4-7.
[9] JXTA,The JXTA Homepage,http://www.jxta.org,2001.
[10] Ian Clarke , A Distributed Decentralized Information Storage and Retrieval System,Master’s thesis,University of Edinburgh,1999.
[11] Ian Clarke, O Sandberg, B Wiley and TW Hong, Freenet: A Distributed Anonymous Information Storage and Retrieval System,In Proceedings of the Workshop on Design Issues in Anonymous and Unobservability,June 2000.
[12] The Gnutella Protocol Specification v0.4, http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf,2002.
[13]杨天路,刘宇宏,张文等,P2P网络技术原理与系统开发实例,北京,人民邮电出版社,2007年6月.
[14] Napster Homepage,http://www.napster.com
[15] C. Gkantsidis,et al,Random Walks in Peer-to-Peer Networks,INFOCOM,2004.
[16] KaZaA,http://www.kazaa.com
[17] J Liang,R Kumar,KW Ross,The KaZaA Overlay:A Measurement Study,Computer Networks Journal,October 2005.
[18] Bryan Ford,Pyda Srisuresh,Dan Kegel,Peer-to-Peer Communication Across Network Address Translators,USENIX Annual Technical Conference,April 2005:179-192.
[19] Bryan Ford , Peer-to-Peer(P2P) Communication Across Middleboxes ,http://www.brynosaurus.com/pub/net/draft-ford-midcom-p2p-01.txt April 2004.
[20] J. Rosenberg,C. Huitema,and R. Mahy,Traversal using relay NAT (TRUN),Internet-Draft (Work in Progress),October 2003.
[21] C. Jennings,NAT Classification Results Using STUN,Internet-Draft (Work in Progress),October 2004.
[22] J. Rosenberg,J. Weinberger,C. Huitema,and R. Mahy,STUN:Simple Traversal of User Datagram Protocol (UDP) Through Network Address Translators (NATs),RFC3489,IETF,March 2003.
[23]何秀强,王寅峰等,基于P2P技术的网格资源发现中覆盖网络的构建,微电子学与计算机,2005年,第22卷(第7期):19-23.
[24]姚宏,金海,廖小飞等,对等覆盖网中继节点发现策略的研究,华中科技大学学报(自然科学版),2007年10月,第35卷(增刊II):144-147.
[25] Petar Maymounkov,and David Mazières,Kademlia:A Peer-to-Peer Information System Based on the XOR Metric,2002.
[26] RenéBrunner,A performance evaluation of the Kad-protocol,Master Thesis,University Mannheim Germany,2006.
[27] Xiao Wu,Cuiyun Fu and Huiyou Chang,A Improved Kademlia Protocol In a VoIP System,IEEE,2007:920-925.
[28] Youki Kadobayashi,Achieving Heterogeneity and Fairness in Kademlia,IEEE,2004.
[29] Yunhao Liu,Li Xiao,and Lionel M. Ni,Building a Scalable Bipartite P2P OverlayNetwork,IPDPS’04,IEEE,2004.
[30] Haiying Shen,Cheng-Zhong Xu,Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks , Journal of Parallel and Distributed Coputing,2007.
[31] Yuh-Jzer Joung,Jiaw-Chang Wang,Chord2:A two-layer Chord for reducing maintenance overhead via heterogeneity,Computer Networks 51,2007:712-731.
[32] Stefan Zoels,Zoran Despotovic,Wolfgang Kellerer,On hierarchical DHT systems– An analytical approach for optimal designs,Computer Communications,2007.
[33] Hongjun Liu,Ping Luo,Zhifeng Zeng,A structured hierarchical P2P model based on a rigorous binary tree code algorithm,Future Generation Computer Systerms 23,2007:201-208.
[34]乐光学,李仁发,周祖德,基于Region多层结构P2P计算网络模型,软件学报,2005年6月,第16卷(第6期):1140-1150.
[35]张诚,基于层次结构的P2P网络模型研究,计算机与现代化,2007年7月:45-48.
[36]肖卓程,荆金华,层次式Chord:物理拓扑感知的结构化对等网,计算机科学,2006年,第33卷(第7期):25-28.
[37]邱彤庆,陈贵海,一种令P2P覆盖网络拓扑相关的通用方法,软件学报,2007年2月,第18卷(第2期):381-390.
[38]陈春华,结构化P2P系统中覆盖图拓扑匹配的研究,计算机工程,2006年11月,第32卷(第21期):121-123.
[39]陈志刚,曾宇光,李登,利用网络拓扑的结构化P2P系统,计算机工程与应用,2007年,第43卷(第13期):150-152.
[40]张有为,李津生,孙卫强等,StratoNet:一种基于DHT的P2P内容定位系统,计算机工程,2005年12月,第31卷(第24期):53-56.
[41] Miguel Castro , Peter Druschel , Y. Charlie Hu , and Antony Rowstron ,Topology-aware routing in structured peer-to-peer overlay networks,Microsoft Research-Technical Report,2002.
[42]黄超,Windows网络编程,北京,人民邮电出版社,2003年.
[43] David Oppenheimer,David A. Patterson,Joseph M. Hellerstein,Decentralized Systems Need Decentralized Benchmarks,University of California,Berkeley Technical Report No.UCB/CSD-03-1234,2003.
[44] Kenichi Watanable , Naohiro Hayashibara , and Makoto Takizawa , A Superpeer-based Two-layer P2P Overlay Network with the CBF Strategy,IEEE,2007.
[45] P2PSim,http://pdos.csail.mit.edu/p2psim
[2] Ben Y.Zhao,John Kubiatowicz,Anthony D.Joseph,Tapestry:An Infrastructure for Fault-tolerant Wide-area Location and Routing , University of California ,Berkeley,April 2001.
[3] Ben Y.Zhao,Ling Huang,Jeremy Stribling,et al,Tapestry:A Resilient Global-Scale Overlay for Service Deployment,IEEE,Janaury 2004,Vol.22,No.1:41-53.
[4] John Kubiatowicz,David Bindel,Yan Chen,et al,OceanStore:An Architecture for Global-Scale Persistent Storage,New York:ACM,Novemeber 2000,Vol.35,No.11:190-201.
[5] Ion Stoica, Robert Morris, David Liben-Nowell, et al, Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,IEEE,Febuary 2003,Vol.11,No.1:17-32.
[6] Sylvia,Ratnasamy,Paul Francis,et al,A Scalable Content-Addressable Network,New York:ACM,2001:161-172.
[7]罗杰文,P2P综述,中科院计算技术研究所,2005年11月.
[8]周世杰,秦志光,刘锦德,对等计算技术分析,计算机应用,2003年10月,第23卷(第10期):4-7.
[9] JXTA,The JXTA Homepage,http://www.jxta.org,2001.
[10] Ian Clarke , A Distributed Decentralized Information Storage and Retrieval System,Master’s thesis,University of Edinburgh,1999.
[11] Ian Clarke, O Sandberg, B Wiley and TW Hong, Freenet: A Distributed Anonymous Information Storage and Retrieval System,In Proceedings of the Workshop on Design Issues in Anonymous and Unobservability,June 2000.
[12] The Gnutella Protocol Specification v0.4, http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf,2002.
[13]杨天路,刘宇宏,张文等,P2P网络技术原理与系统开发实例,北京,人民邮电出版社,2007年6月.
[14] Napster Homepage,http://www.napster.com
[15] C. Gkantsidis,et al,Random Walks in Peer-to-Peer Networks,INFOCOM,2004.
[16] KaZaA,http://www.kazaa.com
[17] J Liang,R Kumar,KW Ross,The KaZaA Overlay:A Measurement Study,Computer Networks Journal,October 2005.
[18] Bryan Ford,Pyda Srisuresh,Dan Kegel,Peer-to-Peer Communication Across Network Address Translators,USENIX Annual Technical Conference,April 2005:179-192.
[19] Bryan Ford , Peer-to-Peer(P2P) Communication Across Middleboxes ,http://www.brynosaurus.com/pub/net/draft-ford-midcom-p2p-01.txt April 2004.
[20] J. Rosenberg,C. Huitema,and R. Mahy,Traversal using relay NAT (TRUN),Internet-Draft (Work in Progress),October 2003.
[21] C. Jennings,NAT Classification Results Using STUN,Internet-Draft (Work in Progress),October 2004.
[22] J. Rosenberg,J. Weinberger,C. Huitema,and R. Mahy,STUN:Simple Traversal of User Datagram Protocol (UDP) Through Network Address Translators (NATs),RFC3489,IETF,March 2003.
[23]何秀强,王寅峰等,基于P2P技术的网格资源发现中覆盖网络的构建,微电子学与计算机,2005年,第22卷(第7期):19-23.
[24]姚宏,金海,廖小飞等,对等覆盖网中继节点发现策略的研究,华中科技大学学报(自然科学版),2007年10月,第35卷(增刊II):144-147.
[25] Petar Maymounkov,and David Mazières,Kademlia:A Peer-to-Peer Information System Based on the XOR Metric,2002.
[26] RenéBrunner,A performance evaluation of the Kad-protocol,Master Thesis,University Mannheim Germany,2006.
[27] Xiao Wu,Cuiyun Fu and Huiyou Chang,A Improved Kademlia Protocol In a VoIP System,IEEE,2007:920-925.
[28] Youki Kadobayashi,Achieving Heterogeneity and Fairness in Kademlia,IEEE,2004.
[29] Yunhao Liu,Li Xiao,and Lionel M. Ni,Building a Scalable Bipartite P2P OverlayNetwork,IPDPS’04,IEEE,2004.
[30] Haiying Shen,Cheng-Zhong Xu,Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks , Journal of Parallel and Distributed Coputing,2007.
[31] Yuh-Jzer Joung,Jiaw-Chang Wang,Chord2:A two-layer Chord for reducing maintenance overhead via heterogeneity,Computer Networks 51,2007:712-731.
[32] Stefan Zoels,Zoran Despotovic,Wolfgang Kellerer,On hierarchical DHT systems– An analytical approach for optimal designs,Computer Communications,2007.
[33] Hongjun Liu,Ping Luo,Zhifeng Zeng,A structured hierarchical P2P model based on a rigorous binary tree code algorithm,Future Generation Computer Systerms 23,2007:201-208.
[34]乐光学,李仁发,周祖德,基于Region多层结构P2P计算网络模型,软件学报,2005年6月,第16卷(第6期):1140-1150.
[35]张诚,基于层次结构的P2P网络模型研究,计算机与现代化,2007年7月:45-48.
[36]肖卓程,荆金华,层次式Chord:物理拓扑感知的结构化对等网,计算机科学,2006年,第33卷(第7期):25-28.
[37]邱彤庆,陈贵海,一种令P2P覆盖网络拓扑相关的通用方法,软件学报,2007年2月,第18卷(第2期):381-390.
[38]陈春华,结构化P2P系统中覆盖图拓扑匹配的研究,计算机工程,2006年11月,第32卷(第21期):121-123.
[39]陈志刚,曾宇光,李登,利用网络拓扑的结构化P2P系统,计算机工程与应用,2007年,第43卷(第13期):150-152.
[40]张有为,李津生,孙卫强等,StratoNet:一种基于DHT的P2P内容定位系统,计算机工程,2005年12月,第31卷(第24期):53-56.
[41] Miguel Castro , Peter Druschel , Y. Charlie Hu , and Antony Rowstron ,Topology-aware routing in structured peer-to-peer overlay networks,Microsoft Research-Technical Report,2002.
[42]黄超,Windows网络编程,北京,人民邮电出版社,2003年.
[43] David Oppenheimer,David A. Patterson,Joseph M. Hellerstein,Decentralized Systems Need Decentralized Benchmarks,University of California,Berkeley Technical Report No.UCB/CSD-03-1234,2003.
[44] Kenichi Watanable , Naohiro Hayashibara , and Makoto Takizawa , A Superpeer-based Two-layer P2P Overlay Network with the CBF Strategy,IEEE,2007.
[45] P2PSim,http://pdos.csail.mit.edu/p2psim
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |