基于网络编码的分层P2P网络的拓扑感知算法研究
收稿日期: 2010-02-18
修回日期: 2010-05-25
网络出版日期: 2011-02-25
基金资助
国家自然科学基金资助项目(60803005)；国家科技重大专项资助项目(2009ZX0300400404)
Topology Awareness of the Hierarchical PeertoPeer Networks Based on Network Coding
Received date: 2010-02-18
Revised date: 2010-05-25
Online published: 2011-02-25
杨军，戴彬，黄本雄，黄辰 . 基于网络编码的分层P2P网络的拓扑感知算法研究[J]. 计算机工程与科学, 2011 , 33(2) : 1 -6 . DOI: 10.3969/j.issn.1007130X.2011.
Network coding is a promising technology to improve the throughput and reliability of networks. However, its benefit is affected by network topology, especially in peertopeer systems. System employed network coding can improve its performance in terms of throughput and reliability by precise topology awareness. In this paper, we propose a TANCF (Topology Awareness based on Network Coding with Feedback) scheme which is based on the feedback from the intermediate nodes and the receiver nodes to detect the path in hierarchical P2P networks. It makes use of network coding with feedback to reveal the network connectivity and construct the network topology. According to the close relationship between the adjacency matrix and path matrix, it can be used to construct the network topology in order to optimize the parameters of network coding. Through a theoretical analysis, we obtain the probability equation and give the conditions under which our scheme can work. Moreover, by simulation experiments, we prove that the TANCF scheme can obtain the path matrix correctly.
Key words： topology awareness;p2p;network coding
［1］Ahlswede R,Cai N,Li R,et al.Network Information Flow［J］.IEEE Transactions on Information Theory,2000,46(4):12041216.
［2］Ho T,Koetter R,Medard M,et al.The Benefits of Coding over Routing in a Randomized Setting［C］∥Proc of IEEE Int’l Symp on Information Theory, 2003：442.
［3］Maymounkov N J A H P，Lun D S.Methods for Efficient Network Coding［C］∥Proc of Allerton Conf on Communication, Control, and Computing, 2006:482491.
［4］Chou P A,Wu Y,Jain K.Practical Network Coding［C］∥Proc of the 51st Allerton Conf on Communication, Control and Computing, 2005.
［5］Gkantsidis C,Miller J,Rodriguez P.Anatomy of a P2P Content Distribution System with Network Coding［C］∥Proc of PTPS’06, 2006.
［6］Wang M,Baochun L.How Practical is Network Coding?［C］∥Proc of IWQoS’06,2006:274278.
［7］Small T,Li Baochun,Liang Ben.Topology Affects the Efficiency of Network Coding in PeertoPeer Networks［C］∥Proc of ICC’08，2008：55915597.
［8］Fragouli C,Markopoulou A,Diggavi S.Topology Inference Using Network Coding［C］∥Proc of the 52nd Allerton Conf on Communication, Control and Computing, 2006.
［9］Jafarisiavoshani M,Fragouli C,Diggavi S,et al.Bottleneck Discovery and Overlay Management in Network Coded PeertoPeer Systems［C］∥Proc of the 2007 SIGCOMM Workshop, 2007.
［10］Jafarisiavoshani M,Fragouli C,Diggavi S.Subspace Properties of Randomized Network Coding［C］∥Proc of 2007 IEEE Information Theory Workshop on Wireless Networks,2007:15.
［11］Di N,Baochun L.On the ResilienceComplexity Tradeoff of Network Coding in Dynamic P2P Networks［C］∥Proc of the Fifteenth IEEE Int’l Workshop on Quality of Service, 2007:3846.
［12］Ho T,Médard M,Shi J , et al.On Randomized Network Coding［C］∥Proc of the 41st Annual Allerton Conf on Communication Control and Computing, 2003.
［13］http://www.omnetpp.org/doc/omnetpp40/manual/usman.html.
/
| 〈 |
|
〉 |