期刊文献+

一种基于适应度和节点聚类的P2P拓扑建模方法 被引量:5

A Model for Topology of P2P Network Based on Fitness and Node Clustering
下载PDF
导出
摘要 通过对Gnutella网络拓扑实测数据的分析,得到了Gnutella网络的累积节点度分布、聚类系数、平均路径长度和rich-club系数等拓扑特征.在拓扑特征分析的基础上,通过引入适应度、邻居数限制和节点聚类等机制,提出了面向非结构化P2P网络拓扑的FCL(Fitness model with tunable Clustering and neighbours Limitation)模型,并给出了建模算法.通过实验分析,证明了该模型的有效性. The measuring topology data of Gnutella network were analyzed,then cumulative degree distribution function,clustering coefficient,average path length and richclub coefficient of Gnutella network were extracted from analysis result.By introducing fitness,nodes with neighbours limitation and nodes clustering,the FCL(Fitness model with tunable Clustering and neighbours Limitation) model and the algorithm is proposed.Simulation indicated that the model is valid.
出处 《电子学报》 EI CAS CSCD 北大核心 2010年第7期1634-1640,共7页 Acta Electronica Sinica
基金 国家973重点基础研究发展规划(No.2007CB310806) 国家自然科学基金(No.60703053) 国家科技支撑计划(No.2008BAH37B06)
关键词 P2P网络 适应度 节点聚类 无尺度网络 小世界网络 peer-to-peer(P2P) network fitness node clustering scale-free network smallworld network
  • 相关文献

参考文献16

  • 1Kin-Wah Kwong,Danny H K Tsang.Application-aware topology formation algorithm for peer-to-peer networks[A].In Proc.IEEE ICC'07[C].Glasgow:IEEE,2007.73-79.
  • 2Newman M E J.The structure and function of complex networks[J].SIAM Review,2003,45(2):167-256.
  • 3Doug1as B West.Introduction to Graph Theory (2nd Edition)[M].New Jersey:Prentice Hall,2000.
  • 4Albert-László Barabási,Réka Albert.Emergence of scaling in random networks[J].Science,1999,286(5439):509-512.
  • 5Romualdo Pastor-Satorras,Alessandro Vespignani.Evolution and Structure of the Internet:A Statistical Physics Approach[M].Cambridge:Cambridge university press,2004.
  • 6G Siganos,M Faloutsos,P Faloutsos,C Faloutsos.Power-laws and the AS-level internet topology[J].IEEE/ACM Trans.on Networking,2003,11 (4):514-524.
  • 7Watts D J,Strogatz S H.Collective dynamics of 'small-world'networks[J].Nature,1998,393(6684):440-442.
  • 8M E J Newman,S H Strogatz,D J Watts.Random graphs with arbitrary degree distributions and their applications[J].Physical Review E,2001,64:026118.
  • 9Sara Nadiv Soffer,Alexei Vázquez.Network clustering coefficient without degree-correlation biases[J].Physical Review E,2005,71:057101.
  • 10Shi Zhou,Raul J Mondragon.The rich-club phenomenon in the Internet topology[J].IEEE Communications Letters,2004,8(3):180-182.

二级参考文献31

  • 1Saroiu S, Gummadi PK, Gribble SD. A measurement study of peer-to-peer file sharing systems. In: Proc. of the Multimedia Computing and Networking 2002 (MMCN 2002). 2002. 156-170. http://www.cs.washington.edu/homes/gribble/papers/mmcn.pdf
  • 2Liang J, Kumar R, Ross KW. The KaZaA overlay: A measurement study. In: Proc. of the 19th IEEE Annual Computer Communications Workshop. 2004. http://cis.poly.edu/-ross/papers/KazaaOverlay.pdf
  • 3Liang J, Kumar R, Ross KW. Understanding KaZaA. 2004. http://cis.poly.edu/-ross/papers/UnderstandingKaZaA.pdf.
  • 4Liang J, Kumar R, Xi Y, Ross KW. Pollution in file sharing systems. In: Proc. of the IEEE Infocom 2005. 2005. http://cis.poly.edu/-ross/papers/pollution.pdf
  • 5Sen S, Wang J. Analyzing peer-to-peer traffic across large networks. In: Proc. of the 2nd ACM SIGCOMM Workshop on Internet Measurement Workshop. 2002. http://citeseer.ist.psu.edu/sen02analyzing.html
  • 6Karagiannis T, Broido A, Brownlee N, Claffy KC, Faloutsos M. Is P2P dying or just hiding. In: Proc. of the IEEE Globecom 2004. 2004. 1532-1538. http://www.caida.org/outreach/papers/2004/p2p-dying/p2p-dying.pdf
  • 7Soldani C. Peer-to-Peer behavior detection by tcp flows analysis (End-of-Study Dissertation). University of Liege, 2004. http://www.run.montefiore.ulg.ac.be/-soldani/P2P_Behaviour_Detection.pdf
  • 8Sen S, Spatscheck O, Wang DM. Accurate, scalable in-network identification of P2P traffic using application signatures. In: Proc of the 13th Int'1 WWW Conf. 2004. http://www2004.org/proceedings/docs/lp512.pdf
  • 9Karagiarmis T, Broido A, Faloutsos M, Claffy KC. Transport layer identification of P2P traffic. In: Proc. of the 4th ACM SIGCOMM Conf. on Internet Measurement. 2004. 121-134. http://www.caida.org/outreach/papers/2004/p2p-layerid/p2p-layerid.pdf
  • 10Karagiannis T, Papagiannaki K, Faloutsos M. BLINC: Multilevel traffic classification in the dark. In: Proc. of the 2005 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications. 2005. 229-240. http://www.cs.ucr.edu/-tkarag/papers/BLINC_TR.pdf

共引文献35

同被引文献61

  • 1蒋竞,李勇军,冯沁原,黄鹏,代亚非.P2P环境下的基于多种用户共享行为的防污染方案[J].中国科学:信息科学,2010,40(10):1321-1337. 被引量:2
  • 2刘业,杨鹏,刘林峰,夏勤.适应自组织管理模式的P2P资源共享网络激励模型的研究[J].电子学报,2006,34(11):2081-2084. 被引量:3
  • 3李景涛,荆一楠,肖晓春,王雪平,张根度.基于相似度加权推荐的P2P环境下的信任模型[J].软件学报,2007,18(1):157-167. 被引量:115
  • 4Walsh K, Sirer E G.Experience with an object reputation sys- tem for peer-to-peer file sharing[C]//Proceedings of Symposium on Networked Systems Design and Implementation 2006, San Jose,USA,May 2006.
  • 5Joseph S.An extendible open source P2P simulator[J].P2P Journal,2007(11): 1-15.
  • 6Liang J,Naoumov N,Ross K W.The index poisoning attack in P2P file-sharing systems[C]//Proceedings of IEEE Infocom 2006, Barcelona, Spain, April 2006.
  • 7Gao L X.On inferring autonomous system relationships in the Internet[J].IEEE/ACM Transactions on Networking,2001,9(6):733-745.
  • 8Dimit ropoulos X,Krioukov D,Huffaker B,et al.Inferring AS relationships:Dead end or lively beginning? .Proceedings of the 4th Workshop on Efficient and Experimental Algorithms (WEAp05) .Berlin:Springer,2005.113-125.
  • 9Xia J,Gao L.On the evaluation of AS relationship inferences .Proceedings of IEEE GLOBECOM .Piscataway,NJ:IEEE,2004.1373-1377.
  • 10Qiu Jian,Gao Lixin.AS path inference by exploiting known AS paths .Proceedings of GLOBECOMp06 .Piscataway,NJ:IEEE,2006.1-5.

引证文献5

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部