期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于复杂系统理论的域间路由系统演化模型CMV-HOT 被引量：1

CMV-HOT:An Evolution Model of Inter-Domain Routing System Based on the Complex System Theory
下载PDF
导出
摘要 对域间路由系统的基本问题能否找到有效而又彻底的解决方法,在很大程度上取决于对域间路由系统行为模型的准确刻画.随着Internet网络规模的扩展和应用的多样化,域间路由系统体现出复杂巨系统的特征.从复杂系统理论出发,研究了Internet域间路由系统中各个自治系统在其成长消亡过程中需要考虑的各种影响因素,基于HOT理论建立了域间路由系统的动态演化模型——CMV-HOT模型.CMV-HOT模型将自治系统分为核心层AS、传输层AS以及边缘层AS三类,通过对域间路由系统的内部规律和外在表现的分析,从复杂系统的角度对域间路由系统的演化过程进行模拟.通过与真实BGP路由表数据的比较,CMV-HOT模型在节点度分布、网络的平均路径长度以及聚集系数等关键参数上有很好的一致性.因此模型能同时满足幂率特性和小世界特性,在网络研究中具有极高的准确性和实用价值. Understanding the evolution process of the inter-domain routing system precisely is very essential to deracinate the basic problems in it efficiently and thoroughly. With the rapid development of the Internet scale and the diversifacation of the applications in it, the inter-domain routing system becomes an open complex giant system inch by inch. The authors study the different facets which the anonymous systems might meet during their whole lifecycles and present a dynamic evolution model, named CMV-HOT, for inter-domain routing systems based on the complex system theory. The CMV- HOT model classifies the anonymous systems into three types as Hub AS, Transit AS and Stub AS, and simulates the evolution process of inter-domain routing systems from the angle of the complex system theory by analyzing its internal rules and external behaviors. Through the comparison with the collected data in CAIDA BGP tables, some essential parameters, such as the degree of node, the network average path length and the average clustering of anonymous systems, have great consistency with real environment. So the conclusion can be drawn that the CMV-HOT model satisfies the powerlaw nature and the small world nature at the same time, it has high veracity and practical worthiness in the network research area.
作者 赵金晶 黄敏桓 朱培栋
机构地区 北京系统工程研究所 清华大学计算机科学与技术系 国防科学技术大学计算机学院
出处 《计算机研究与发展》 EI CSCD 北大核心 2009年第5期731-737,共7页 Journal of Computer Research and Development
基金 国家“九七三”重大基础研究发展计划基金项目(2005CB321801) 国家自然科学基金项目(60673169) 国家“八六三”高技术研究发展计划基金项目(2009AA01Z421)~~
关键词 域间路由系统 自组织 复杂系统 演化模型 幂率 小世界特性 inter-domain routing system self-organized complex system evolution model powerlaw small world nature
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献11

  • 1卢锡城,赵金晶,朱培栋,董攀.域间路由系统自组织特性[J].软件学报,2006,17(9):1922-1932. 被引量：10
  • 2Willinger W, Alderson D, Doyle J, et al. A pragmatic approach to dealing with high variability in network measurements [C]//Proc of the ACM SIGCOMM Internet Measurement Conf (IMC 2004). New York: ACM, 2004: 88-100
  • 3Oian Chen, Hyunseok Chang, Govindan R, et al. The origin .of power laws in Internet topologies revisited [C] //Proc of IEEE INFOCOM 2002. New York: IEEE, 2002:608-617
  • 4Li L, Alderson D, Doyle J, et al. A first-principles approach to understanding the Internet's router level topology [C]//Proc of the ACM SIGCOMM 2004. New York: ACM, 2004: 3-14
  • 5Willinger W, Alderson D, Doyle J C, et al. More "Normal" than normal: Scaling distributions and complex systems [C]//Proc of the Winter Simulation Conf. Piscataway, NJ: IEEE, 2004:130-141
  • 6Alderson, Willinger W. A contrasting look at self-organization in the Internet and next-generation communication networks [J]. IEEE Communications Magazine, 2005, 43(7) :94-100
  • 7Carlson J M, Doyle J. Complexity and robustness [J]. Proc National of Academac SCI, 2002, 99(Suppl1): 2539-2545
  • 8Alderson D, Doyle J, Govindan R, et al. Toward an optimization-driven framework for designing and generating realistic Internet topologies [C] //Proc of HotNets-I 2002. Printon, USA: Printon University, 2002:41-46
  • 9Alderson David, Doyle John, Willinger Walter. lnternet connectivity at the AS level: An optimization driven modeling approach [C]//Proc of the ACM SIGCOMM 2003. New York: ACM, 2003: 33-46
  • 10朱培栋 刘欣.推断Internet层次的有效算法.高技术通讯,2004,14:358-361.

二级参考文献36

  • 1Prehofer C, Bettstetter C. Self-Organization in communication networks: Principles and design paradigms. IEEE Communications Magazine, 2005,43(7):78-85.
  • 2Alderson D, Willinger W. A contrasting look at self-organization in the Internet and next-generation communication networks.IEEE Communications Magazine, 2005,43(7)'94-100.
  • 3Siganos G, Faloutsos M, Faloutsos P, Faloutsos C. Power-Laws and the AS-level Internet topology. IEEE/ACM Trans. on Networking, 2003,11:514-524.
  • 4Zegura, E Calvert K, Donahoo M. A quantitative comparison of graph-based models for Internet topology. IEEE/ACM Trans. on Networking, 1997,5(6):770-783.
  • 5Subramanian L, Agarwal S, Rexford J, Katz R.H. Characterizing the Internet Hierarchy from multiple vantage points. In: Proc. of the IEEE INFOCOMM 2002. 2002.618-627.
  • 6Tauro SL, Palmer C, Siganos G, Faloutsos M. A simple conceptual model for the Internet topology. In: Proc. of the IEEE GLOBECOM 2001. 2001. 1667-1671.
  • 72005. http://www.caida.org/analysis/topology/
  • 8Huston G. Interconnection, peering, and settlements. Internet Protocol Journal, 1999,45(3):136-152.
  • 9Kleinrock L, Kamoun F. Hierarchical routing for large networks: Performance evaluation and optimization. Computer Networks,1977,1:155-174.
  • 10Waxman B. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 1988,6(9):1617-1622.

共引文献9

同被引文献9

  • 1Rekhter Y, Li Y, Hares S. A Border Gateway Protocol 4 (BGP-4) [ S] . IETF RFC 4271, 2006.
  • 2Laurent ganbever, Bruno Quoitin, Olivier Bonaventure. A hierarchical model for BGP routing policies[ C ]// Proceedings of the 2nd ACM SIGCOMM workshop on Programmable routers for extensible services of tomorrow. 2009 : 61-66.
  • 3Jacob Aron. The cyber-weapon that could take down the internet [ EB/OL ]. [ 2011-02-11 ]. http ://www. newscientist, com/article/dn20113 -the-cyber-weapon -that-could -take -down-the -internet.
  • 4Crucitti, Latora V, Marchiori M. Model for cascading failures in complex networks[ J ]. Phys. Rev. E, 2004, 69(4) : 1-4.
  • 5Bonabeau E. Sandpile dynamics on random graphs[ J]. J. Phys. Soc. , 1995, 64:327-328.
  • 6Dobson I, Chen J, Thorp J S, et al. Examining criticality of blackouts in power system models with cascading events[ C ]// Proceeding of 35th Hawaii International Conference on System Sciences. 2002:63-72.
  • 7Deng Wenping, Zhu Peidong, Lu Xicheng. On Evaluating BGP Routing Stress Attack[ J]. Journal of communications, 2010, 5(1) :13-22.
  • 8王健,刘衍珩,朱建启,糜利敏.一种简单的Internet级联故障模型[J].上海理工大学学报,2008,30(3):215-220. 被引量：4
  • 9王建伟,荣莉莉.基于负荷局域择优重新分配原则的复杂网络上的相继故障[J].物理学报,2009,58(6):3714-3721. 被引量：31

引证文献1

二级引证文献1

计算机研究与发展
2009年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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