%0 Journal Article
%T A modified optimal routing strategy based on random walk on complex networks<br>一类基于随机行走机理的优化路由改进策略
%A Wang Kai
%A Zhou Si-Yuan
%A Zhang Yi-Feng
%A Pei Wen-Jiang
%A Liu Qian
%A <br>王开
%A 周思源
%A 张毅锋
%A 裴文江
%A 刘茜
%J 物理学报
%D 2011
%I 
%X 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.
%K complex networks
%K routing strategy
%K traffic transportation<br>复杂网络
%K 路由策略
%K 负载传输
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=47EA7CFDDEBB28E0&jid=29DF2CB55EF687E7EFA80DFD4B978260&aid=7FB288757ED284A0D7767B8EFA6DA173&yid=9377ED8094509821&vid=BFE7933E5EEA150D&iid=708DD6B15D2464E8&sid=DD1A6DF9A4068ED7&eid=DD1A6DF9A4068ED7&journal_id=1000-3290&journal_name=物理学报&referenced_num=0&reference_num=25