一种有效的BA网络局部路由策略
An effective local routing strategy on the BA network
摘要：
本文在最近邻搜索策略的基础上，通过引入优先投递指数α，提出了一种有效的路由策略。我们假设一个顶点的处理能力在度小于截止值$K$时与其度成正比，否则为无穷大。研究发现，通过调整参数α，用序参量度量的无标度网络容量与常规的最近邻策略相比有了显著的提高.讨论了在临界生成率Rc附近和远离临界生成率Rc时的业务动态。我们还研究了R_c作为m（连通性密度），K（截止值）的函数。由于获取最近邻信息的成本较低，且能显著提高网络容量，该策略对现代通信网络的协议设计具有一定的参考价值。
英文摘要：
In this paper, We propose a effective routing strategy on the basis of the so-called nearest neighbor search strategy by introducing a preferential delivering exponent alpha. we assume that the handling capacity of one vertex is proportional to its degree when the degree is smaller than a cut-off value $K$, and is infinite otherwise. It is found that by tuning the parameter alpha, the scale-free network capacity measured by the order parameter is considerably enhanced compared to the normal nearest-neighbor strategy. Traffic dynamics both near and far away from the critical generating rate R_c are discussed. We also investigate R_c as functions of m (connectivity density), K (cutoff value). 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
