Abstract: This paper proposes a packet routing strategy with a tunable parameter based on link weights and free-degrees of nodes in a network. Data transmission on BBV weighted network is subsequently studied. A large number of numerical simulations show that when , the network achieves the best performance with the maximal communication capacity, the smaller average transmission time and the smallest load. In comparison with the local link weights routing strategy, the strategy can dramatically improve the network capacity and reduce its load in the jam state. This study may shed insight on controlling the congestion in weighted networks.

Key words: BBV weighted network, routing search, communication capacity, congestion control

摘要： 提出一种综合考虑网络边权和节点空闲度的路由策略，该路由搜索策略具有一可调参数 ，应用该策略对BBV加权网络上的数据传输进行研究。通过大量的数值仿真发现，当 时，网络具有最大的通信能力、较小的平均传输时间和最小的网络负载。与基于局域边权信息的路由策略相比，该策略可以提高网络通信能力，在拥塞状态下减小网络负载。对于加权网络的拥塞控制具有一定指导意义。

关键词: BBV加权网络, 路由搜索, 通信能力, 拥塞控制

CLC Number: 

• N945