排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Due to the heterogeneity of the structure on a scale-free
network, making the betweennesses of all nodes become homogeneous by
reassigning the weights of nodes or edges is very difficult. In
order to take advantage of the important effect of high degree nodes
on the shortest path communication and preferentially deliver
packets by them to increase the probability to destination, an
adaptive local routing strategy on a scale-free network is proposed,
in which the node adjusts the forwarding probability with the dynamical
traffic load (packet queue length) and the degree distribution of
neighbouring nodes. The critical queue length of a node is set to be
proportional to its degree, and the node with high degree has a
larger critical queue length to store and forward more packets. When
the queue length of a high degree node is shorter than its critical
queue length, it has a higher probability to forward packets. After
higher degree nodes are saturated
(whose queue lengths are longer
than their critical queue lengths), more packets will be delivered
by the lower degree nodes around them. The adaptive local routing
strategy increases the probability of a packet finding its
destination quickly, and improves the transmission capacity on the
scale-free network by reducing routing hops. The simulation results
show that the transmission capacity of the adaptive local routing
strategy is larger than that of three previous local routing
strategies. 相似文献
1