欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
在对随机行走过程的研究中发现：单个粒子通过某条特定路径的时间正比于该路径上所有节点度的连乘积.据此,文章提出基于随机行走机理的优化路由改进策略.该策略以节点度连乘积最小化为原则,通过调节可变参数,建立节点处理能力均匀分布的情况下最佳路由策略.通过分析比较不同路由策略条件下平均路由介数中心度,网络的临界负载量,平均路径长度以及平均搜索信息量等性能指标,研究结果表明,此改进路由策略在保证网络平均路径长度较少增加的前提下,使网络的传输能力获得最大幅度的提升.
英文摘要：
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.
同期刊论文项目
同项目期刊论文
Estimating initial conditions in coupled map lattices from noisy time series using symbolic vector d
期刊信息
位置：