期刊文献+

两层复杂网络上的动态权重路由策略研究 被引量:5

Study of dynamic weighted routing strategy for two-layer complex networks
下载PDF
导出
摘要 为了提高两层复杂网络处理数据包的网络容量,提出了一种基于队列长度的路由策略,称之为动态权重路由策略,即逻辑层链路的权重与其映射的物理层节点队列长度有关,并按照队列长度的变化,动态地更新链路权重,然后数据包按照权重最小路径路由。仿真结果表明,与传统的最短路径路由策略和静态的全局意识路由策略相比,动态权重路由策略可以进一步地增强两层复杂网络的网络容量。 This paper proposed the dynamic weighted routing strategy (DWRS) based on the queue length to improve the network capacity of two-layer complex networks. Each logical edge was assigned a weight value that was related with the queue length of physical nodes and dynamic update the weight according to the variation of queue length. Then delivered packets across the shortest paths of the weighted logical layer network. Compared with the shortest path routing strategy (SPRS) and the global awareness routing strategy (GARS), the network capacity of two-layer complex network is greatly enhanced by the DWRS.
作者 卓越
出处 《计算机应用研究》 CSCD 北大核心 2011年第9期3411-3413,共3页 Application Research of Computers
关键词 分层复杂网络 路由策略 网络容量 队列长度 layered complex network routing strategy network capacity queue length
  • 相关文献

参考文献12

  • 1臧海娟,任彦,薛小平,谭韵天.复杂网络环境下的路由方法研究[J].计算机应用,2010,30(8):2210-2213. 被引量:9
  • 2DOYLE J C,ALDERSON D,LI L.The robust yet fragile nature ofthe Internet. Proceedings of the National Academy of Sciences of the United States of America . 2005
  • 3YAN Gang,ZHOU Tao,HU Boet al.Efficient routing on complexnetworks. Physical Review . 2006
  • 4ARENAS A,DíAZ-GUILERA A,GUIMERáR.Communication innetworks with hierarchical branching. Physical Review . 2001
  • 5B. Danila,Y. Yu,J. A. Marsh,K. E. Bassler."Optimal transport on complex networks,". Physical Review E Statistical Nonlinear and Soft Matter Physics . 2006
  • 6Albert R,Jeong H,Barabasi AL.Error and attack tolerance of complex networks. Nature . 2000
  • 7Tadi B,Thurner S,Rodgers G J.Traffic on complex networks: towards understanding global statistical properties from microscopic density fluctuations. Physical Review E Statistical, Nonlinear and Soft Matter Physics . 2004
  • 8Albert-Laszlo Barabasi,Reka Albert.Emergence of scaling in random networks. Science . 1999
  • 9Erdos P,Renyi A.On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences . 1960
  • 10Liang Zhao,Ying-Cheng Lai,Kwangho Park,Nong Ye.Onset of traffic congestion in complex networks. Physical Review E Statistical, Nonlinear and Soft Matter Physics . 2005

二级参考文献35

  • 1WATTS D J,STROGATZ S H.Collective dynamics of small-world networks[J].Nature,1998,393(6):440-442.
  • 2BARABASI A L,ALBERT R.Emergence of scaling in random networks[J].Science,1999,286:509 -512.
  • 3YAN G,ZHOU T,HU B,et al.Efficient routing on complex networks[J].Physical Review E,2006,73:46108-46112.
  • 4YANG S.Exploring complex networks by walking on them[J].Physical Review E,2005,71:16107-16112.
  • 5DANLA B,YU Y,MARSH J A.Optimal transport on complex networks[J].Physical Review E,2006,74:46106 -46109.
  • 6WANG S P,PEI W J.Detecting unknown paths on complex networks through random walks| J].Statistical Mechanics and Its Applications,2009,388(4):514-522.
  • 7WANG W X,WANG B H,et al.Traffic dynamics based on local routing protocol on a scale free network[J].Physical Review E,2006,73:26111 -26117.
  • 8CHEN Z Y,WANG X F.Effects of network structure and routing strategy on network capacity[J].Physical Review E,2006,73:36107-36111.
  • 9LIU Z,HU M B,JIANG R,et al.Method to enhance traffic capacity for scale-free networks[J].Physical Review E,2006,76:37101 -37104.
  • 10THADAKAMALLA H P,ALBERT R,KUMARA S R T.Search in spatial scale-free networks[J].New Journal of Physics,2007,9 (6):190.

共引文献8

同被引文献34

引证文献5

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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