【作者】 李玉剑； 杨涵新； 汪秉宏；

【Author】 Li Yu-jian,Yang Han-xin,Wang Bing-hong University of Science and Technology of China,Hefei 230026,China

【机构】 中国科学技术大学近代物理系；

【摘要】 文中通过引进信息传递时处理延时提出了一种于局域信息对最近邻基搜索的路由策略,发现通过调节优先传递指数α,被序参量刻画的无标度网络处理能力与基于NN策略的网络比起来显著提高,α=-0.5时网络性能发生显著变化。文中讨论了接近和远离临界产生率Rc的交通动力学,研究了临界产生率和连接密度m的函数关系。此外,我们对网络处理能力更大的情况进行了模拟,以适应日益发展的网络技术和规模。考虑到获得最近邻信息及显著改善网络处理能力的低花费,文中提出的策略将对现代通讯网络的协议设计有所建议。更多还原

【Abstract】 In this paper,we propose a routing strategy on the basis of the so-called nearest neighbor search strategy by introducing the waiting time in the hub.It is found that by tuning the preferential delivering parameter α,the scale-free network capacity measured by the order parameter is considerably changed compared to the normal nearest-neighbor strategy near α=-0.5.Traffic dynamics both near and far away from the critical generating rate Rc are discussed.Due to the low cost of acquiring nearest-neighbor information and the strongly improved network capacity,our strategy may be useful and reasonable for the protocol designing of modern communication networks.更多还原