期刊文献+

加权网络的交通动力学研究 被引量:1

Research on Traffic Dynamics for Weighted Networks
下载PDF
导出
摘要 提出一种综合考虑网络边权和节点空闲度的路由策略,该路由搜索策略具有一可调参数α,应用该策略对BBV加权网络上的数据传输进行研究。通过大量的数值仿真发现,当α=1时,网络具有最大的通信能力、较小的平均传输时间和最小的网络负载。与基于局域边权信息的路由策略相比,该策略可以提高网络通信能力,在拥塞状态下减小网络负载。对于加权网络的拥塞控制具有一定指导意义。 This paper proposes a packet routing strategy with a tunable parameter α based on link weights and free-degrees of nodes in a network.Data transmission on BBV weighted network is subsequently studied.A large number of numerical simulations show that when α = 1,the network achieves the best performance with the maximal communication capacity,the smaller average transmission time and the smallest load.In comparison with the local link weights routing strategy,the strategy can dramatically improve the network capacity and reduce its load in the jam state.This study may shed insight on controlling the congestion in weighted networks.
出处 《计算机工程》 CAS CSCD 北大核心 2010年第19期126-127,131,共3页 Computer Engineering
基金 国家自然科学基金资助项目(10647001) 广西自然科学基金资助项目(0728042) 广西高校优秀人才基金资助项目(RC2007006)
关键词 BBV加权网络 路由搜索 通信能力 拥塞控制 BBV weighted network routing search communication capacity congestion control
  • 相关文献

参考文献8

  • 1Watts D J, Strogatz S H. Collective Dynamics of Small-world Network[J]. Nature, 1998,393(6684): 440-442.
  • 2Barabasi A L, Albert R. Emergengce of Scaling in Random Network[J]. Science, 1999, 286(5439): 509-512.
  • 3Wang Wenxu, Wang Binghong, Yin Chuanyang. Traffic Dynamics Based on Local Routing Protocol on a Scale-free Network[J]. Phys. Rev. E, 2006, 73(2).
  • 4Hu Maobin, Jiang Rui, Wu Yonghong, et al. Routing on a Weighted Scale-free Network[Z]. (2008-04-01). http://espace.library.ctu'tin. edu.au/R/? func=dbin-jump-full&object_id= 117775&local base=G EN01-ERA02.
  • 5Barrrat A, Barthelemy M, Vespignani A. Weighted Evolving Networks: Coupling Topology and Weight Dynamics[J]. Phys. Rev. Lett, 2004, 92(22).
  • 6Arenas A, Diaz G A, Guimera R. Communication in Networks with Hierarchical Branching[J]. Phys. Rev. Lett, 2001, 86(14): 3196-3199.
  • 7顾前,杨旭华,王万良,王波.基于复杂网络的城市公共交通网络研究[J].计算机工程,2008,34(20):266-268. 被引量:33
  • 8陶少华,杨春,李慧娜,张勇.基于节点吸引力的复杂网络演化模型研究[J].计算机工程,2009,35(1):111-113. 被引量:14

二级参考文献11

  • 1Albert R, Barabasi A L. Emergence of Scaling in Random Networks[J]. Science, 1999, 286(5439): 509-512.
  • 2Albert R, Jeong H. Mean-field Theory for Scale-free Random Networks[J]. Physica A: Statistical Mechanics and Its Applications, 1999, 272(1/2): 173-187.
  • 3Li Xiang, Chen Guanrong. A Local-world Evolving Network Model[J]. Physica A: Statistical Mechanics and Its Applications, 2003, 328(1/2): 274-286.
  • 4Jeong H, N6da Z. Measuring Preferential Attachment in Evolving Networks[J]. Europhys. Lett., 2003, 61(4): 567-572.
  • 5Dorogovtsev S N, Mendes J F. Structure of Growing Networks with Preferential Linking[J]. Phys. Rev. Lea., 2000, 85(21): 4633-4636.
  • 6Duncan J, Steven H. Collective Dynamics of Small-world Networks[J]. Nature, 1998, 393(6684): 440-442.
  • 7Barabasi A, Albert R. Emergency of Scaling in Random Networks[J]. Science, 1999,286(5439): 509-511.
  • 8Newman M. The Structure and Function of Complex Networks[J]. SIAM Review, 2003, 45(2): 167-171.
  • 9Kurant M, Thiran P. Trainspotting: Extraction and Analysis of Traffic and Topologies of Transportation Networks[J]. Phys. Rev. E, 2006, 74(3): 36-40.
  • 10Seaton K, Hackett L. Stations, Trains and Small-world Networks[J]. Physica A, 2004, 339(3): 635-637.

共引文献45

同被引文献11

  • 1谢希仁.计算机网络[M].5版.北京:电子工业出版社,2008.
  • 2Motter A E,Lai Yingcheng.Cascade-based Attacks on Complex Networks[J].Physical Review E,2002,66(6).
  • 3Sun Huijun,Zhao Hui,Wu Jianjun.A Robust Matching Model of Capacity to Defense Cascading Failure on Complex Networks[J].Physica A:Statistical Mechanics and Its Applications,2008,387(25):6431-6435.
  • 4Xia Yongxiang,Fan Jin,Hill D.Cascading Failure in Watts-Strogatz Small-world Networks[J].Physica A:Statistical Mechanics and Its Applications,2010,389(6):1281-1285.
  • 5Kim D H,Motter A E.Fluctuation-driven Capacity Distribution in Complex Networks[J].New Journal of Physics,2008,10(5).
  • 6Zhao Liang,Lai Yingcheng,Park K,et al.Onset of Traffic Congestion in Complex Networks[J].Physical Review E,2005,71(2).
  • 7Liu Zhonghua,Ma Weichuan,Zhang Huan,et al.An Efficient Approach of Controlling Traffic Congestion in Scale-free Networks[J].Physica A:Statistical Mechanics and Its Applications,2006,370(2):843-853.
  • 8Brandes U.A Faster Algorithm for Between Ness Centrality[J].Journal of Mathematical Sociology,2001,25(2):163-177.
  • 9Barabási A L,Albert R.Emergence of Scaling in Random Networks[J].Science,1999,286(5439):509-512.
  • 10薛芊.“暴风门”的蝴蝶效应[J].信息安全与通信保密,2009,31(7):27-30. 被引量:2

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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