一类基于随机行走机理的优化路由改进策略  

A modified optimal routing strategy based on random walk on complex networks

作　　者：王开[1] 周思源[1] 张毅锋[1] 裴文江[1] 刘茜[1] 

机构地区：[1]东南大学信息科学与工程学院,南京210096

出　　处：《物理学报》2011年第11期767-775,共9页Acta Physica Sinica

基　　金：国家自然科学基金(批准号:60672095;60972165);国家高技术研究发展计划(批准号:2007AA11Z210);教育部博士点基金(批准号:20100092120012;20070286004);江苏省高技术研究项目;江苏省自然科学基金(批准号:BK2010240);国家十一五密码发展基金;国家火炬计划项目资助的课题~~

摘　　要：在对随机行走过程的研究中发现:单个粒子通过某条特定路径的时间正比于该路径上所有节点度的连乘积.据此,文章提出基于随机行走机理的优化路由改进策略.该策略以节点度连乘积最小化为原则,通过调节可变参数,建立节点处理能力均匀分布的情况下最佳路由策略.通过分析比较不同路由策略条件下平均路由介数中心度,网络的临界负载量,平均路径长度以及平均搜索信息量等性能指标,研究结果表明,此改进路由策略在保证网络平均路径长度较少增加的前提下,使网络的传输能力获得最大幅度的提升.In our original contributions,we found that the time which a random walker spends in finding a given path is directly proportional to the continued product of the degrees of all the nodes which pass through the given path.In this paper,with our original contributions,we give a modified routing strategy to improve the capacity of the network when all nodes have the same packet-delivery rates.We define an average routing centrality degree of the node to analyze the traffic load on the node with different degrees,and then we analyze the transportation capacity by using the critical value of Rc,the average packet travel time,the average path length and the search information.Both theoretical and experimental results show that compared with the shortest path strategy and the efficient path strategy,the new strategy can enhance the network capability.

关 键 词：复杂网络 路由策略 负载传输 

分 类 号：O157.5[理学—数学]