• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊
论文

Topology Awareness of the Hierarchical PeertoPeer Networks Based on Network Coding

Expand
  • (Department of Electronic Information Engineering,
    Huazhong University of Science and Technology,Wuhan 430074,China)

Received date: 2010-02-18

  Revised date: 2010-05-25

  Online published: 2011-02-25

Abstract

Network coding is a promising technology to improve the throughput and reliability of networks. However, its benefit is affected by network topology, especially in peertopeer 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.

Cite this article

YANG Jun,DAI Bin,HUANG Benxiong,HUANG Chen . Topology Awareness of the Hierarchical PeertoPeer Networks Based on Network Coding[J]. Computer Engineering & Science, 2011 , 33(2) : 1 -6 . DOI: 10.3969/j.issn.1007130X.2011.

References

[1]Ahlswede R,Cai N,Li R,et al.Network Information Flow[J].IEEE Transactions on Information Theory,2000,46(4):12041216.
[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:482491.
[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:274278.
[7]Small T,Li Baochun,Liang Ben.Topology Affects the Efficiency of Network Coding in PeertoPeer Networks[C]∥Proc of ICC’08,2008:55915597.
[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 PeertoPeer 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:15.
[11]Di N,Baochun L.On the ResilienceComplexity Tradeoff of Network Coding in Dynamic P2P Networks[C]∥Proc of the  Fifteenth IEEE Int’l Workshop on Quality of Service, 2007:3846.
[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.

Outlines

/