期刊文献+

一种基于局域世界的可调簇系数网络演化模型

Local-world-based evolving network model with tunable clustering coefficient
下载PDF
导出
摘要 网络拓扑的结构是网络协议和网络算法设计的基石,合理的网络拓扑模型无疑可以指导协议的设计及优化。研究了现实网络的拓扑特性,引入局域世界的概念,建立了一种基于局域世界的可调簇系数网络演化模型(LWTC)。该模型全面考虑了局域内以及局域外部加点、偏好链接以及链接随机消亡等诸多因素,并引入三角形形成机制调节模型的簇系数。通过MATLAB和C++对模型进行仿真分析发现,该模型动态模拟了网络的演化过程,其度分布不仅与理论推导值符合,簇系数也优于局域世界演化模型,并且通过合理调节参数可以改变模型的簇系数,较好地刻画了现实网络的统计特性。 The structure of topology model is the foundation stone of network protocols, so a reasonable topology can guide the design and optimization of protocols. This paper researched on real network, and put forward a novel model named LWTC based on the local-world. This model took general consideration of adding new nodes, preferential attachment and random death of nodes in or between local-worlds, and introduced triad formation to tune the clustering. The MATLAB and C ++ simulation indicates that not only the degree distribution consistent with the theoretical results, but also the clustering coefficient had a good performance than the local-world evolving network, and the clustering coefficient could be changed by reasonable adjusting of the parameter, so the LWTC model reproduced the properties of real network.
出处 《计算机应用研究》 CSCD 北大核心 2009年第10期3856-3859,共4页 Application Research of Computers
基金 国家"863"计划资助项目(2007AA01Z2al)
关键词 拓扑建模 局域世界 幂律分布 簇系数 三角形形成 topology modeling local-world power law clustering coefficient triad formation
  • 相关文献

参考文献17

  • 1KRIOUKOV D, FALL K, YANG X. Compact routing on Intemet-like graphs [ C ]//Proc of IEEE INFOCOM. Piscataway, NJ : IEEE Press, 2004:209- 219.
  • 2GOH K I, KAHNG B, KIM D. Universal behavior of load distribution in sealefree networks [ J ]. Physical Review Letters, 2001, 87 (27) : 278-701.
  • 3ALBERT R, BARABASI A L. Statistical mechanics of complex networks[ J ]. Reviews of Modern Physics, 2002, 74 ( 1 ) : 47- 97.
  • 4张宇,张宏莉,方滨兴.Internet拓扑建模综述[J].软件学报,2004,15(8):1220-1226. 被引量:64
  • 5FALOUTSOS M, FALOUTSOS P, FALOUTSOS C. On powerlaw relationships of the Intemet topology[ J]. ACM SIGGOMM Computer Communication Review, 1999, 29(4):251-262.
  • 6BARABASI A L, ALBERT R. Emergence of scaling in random networks[ J ]. Science, 1999, 289:509- 512.
  • 7ALBERT R, BARABASI A L. Topology of evolving networks: local events and universality [ J ]. Physical Review Letters, 2000, 85 (24) : 52-34.
  • 8LI Yan, CUI Jun-hong, MAGGIORINI D, et al. Characterizing and modeling clustering features in AS-Level Internet topology[ C]//Proc of IEEE INFOCOM. Phoenix: [ s. n. ] , 2008.
  • 9张昕,赵海,李超.一种基于多项复杂特征的Internet路由级拓扑建模方法[J].电子学报,2008,36(1):57-63. 被引量:5
  • 10LI Xiang, CHEN Guan-rong. A local-world evolving network model [ J ]. Physica A, 2003, 328 (1-2) :274- 286.

二级参考文献63

  • 1张宇,张宏莉,方滨兴.Internet拓扑建模综述[J].软件学报,2004,15(8):1220-1226. 被引量:64
  • 2姜誉,方滨兴,胡铭曾,何仁清.大型ISP网络拓扑多点测量及其特征分析实例[J].软件学报,2005,16(5):846-856. 被引量:38
  • 3孟伟,韩学东,洪炳镕.蜜蜂进化型遗传算法[J].电子学报,2006,34(7):1294-1300. 被引量:78
  • 4Magoni D, Pansiot JJ. Evaluation of Internet topology generators by power law and distance indicators. In: Proc. of the IEEE ICON 2002. Singapore: IEEE, 2002. 401-406.
  • 5Floyd S, Paxson V. Difficulties in simulating the Internet. IEEE/ACM Trans. on Networking, 2001,9(4):392-403.
  • 6Zheng H. Internet worm research [Ph.D. Thesis]. Tianjin: Nankai University, 2003 (in Chinese with English abstract).
  • 7Chalmers RC, Almeroth KC. On the topology of multicast trees. IEEE/ACM Trans. on Networking, 2003,11(1):153-165.
  • 8NMS Home Page. http://www.darpa.mil/ipto/programs/nms/index.htm
  • 9Waxman BM. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 1988,6(9):1617-1622.
  • 10Doar MB. A better model for generating test networks. In: Proc. of the GLOBECOM'96. London: IEEE, 1996. 86-93.

共引文献75

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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