scholarly journals Bandwidth allocation strategy for traffic systems of scale-free network

2010 ◽  
Vol 374 (48) ◽  
pp. 4825-4830 ◽  
Author(s):  
Xiang Ling ◽  
Mao-Bin Hu ◽  
Wen-Bo Du ◽  
Rui Jiang ◽  
Yong-Hong Wu ◽  
...  
2019 ◽  
Vol 33 (08) ◽  
pp. 1950096
Author(s):  
Gan-Hua Wu ◽  
Hui-Jie Yang

Relieving complete congestion in a traffic system is an important problem. We propose a strategy to realize this, in which the packets on nodes shared by many shortest paths are dropped preferentially. A simple scale-free network is chosen to demonstrate the importance of the degree heterogeneity to the congestion problem, though this network structure cannot mimic a real traffic network. Two traffic models are simulated: in one of which, all the nodes are identical, and in the other, the delivering capacity and storing ability for each node are both proportional to its degree. Both models can give a phase transition between free-flow and congested states, while the latter model has significant strong transportation performance (a larger critical value of the packet generation rate). The strategy of preferentially dropping packets on nodes shared by many shortest paths, as proposed in this paper, can realize remarkably better transportation performance measured by the fraction of congested nodes and the average arrival rate compared with the random packet dropping strategy in the literature.


2013 ◽  
Vol 24 (03) ◽  
pp. 1350013 ◽  
Author(s):  
SHUAI ZHANG ◽  
MAN-GUI LIANG ◽  
ZHONG-YUAN JIANG ◽  
HUI-JIA LI

In real communication systems, each node has a finite queue length to store packets due to physical constraints. In this paper, we propose a queue resource allocation strategy for traffic dynamics in scale-free networks. With a finite resource of queue, the allocation of queue length on node i is based on Bi, where Biis the generalized betweenness centrality of node i. The overall traffic capacity of a network system can be evaluated by the critical packet generating rate (Rc). Through the use of the proposed queue allocation scheme for the shortest path protocol and efficient routing protocol, our strategy performs better than the uniform queue length allocation strategy, which is demonstrated by a larger value of the critical generating rate. We also give a method to estimate the network traffic capacity theoretically.


2009 ◽  
Vol 29 (5) ◽  
pp. 1230-1232
Author(s):  
Hao RAO ◽  
Chun YANG ◽  
Shao-hua TAO

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Xiuwen Fu ◽  
Yongsheng Yang ◽  
Haiqing Yao

Previous research of wireless sensor networks (WSNs) invulnerability mainly focuses on the static topology, while ignoring the cascading process of the network caused by the dynamic changes of load. Therefore, given the realistic features of WSNs, in this paper we research the invulnerability of WSNs with respect to cascading failures based on the coupled map lattice (CML). The invulnerability and the cascading process of four types of network topologies (i.e., random network, small-world network, homogenous scale-free network, and heterogeneous scale-free network) under various attack schemes (i.e., random attack, max-degree attack, and max-status attack) are investigated, respectively. The simulation results demonstrate that the rise of interference R and coupling coefficient ε will increase the risks of cascading failures. Cascading threshold values Rc and εc exist, where cascading failures will spread to the entire network when R>Rc or ε>εc. When facing a random attack or max-status attack, the network with higher heterogeneity tends to have a stronger invulnerability towards cascading failures. Conversely, when facing a max-degree attack, the network with higher uniformity tends to have a better performance. Besides that, we have also proved that the spreading speed of cascading failures is inversely proportional to the average path length of the network and the increase of average degree k can improve the network invulnerability.


Sign in / Sign up

Export Citation Format

Share Document