Traffic of packets with non-homogeneously selected destinations in scale-free network

Ling, Xiang; Jiang, Rui; Wang, Xiong; Hu, Mao-Bin; Wu, Qing-Song

doi:10.1016/j.physa.2008.03.022

Cited by 35 publications

(8 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the convenience of theoretical estimation, this paper considers traffic flow on directed networks so that D ij may be different from D ji . Previous studies usually consider that the link's bandwidth is infinite [16][17][18][19][20][21][22][23][24][25][26][27][28][29][30][31][32][33][34][35]. This is not in consistence with real situations.…”

Section: The Modelsmentioning

confidence: 99%

Bandwidth allocation strategy for traffic systems of scale-free network

Ling

Wei

et al. 2010

Physics Letters A

Self Cite

View full text Add to dashboard Cite

In this paper, the bandwidth resource allocation strategy is considered for traffic systems of complex networks. with a finite resource of bandwidth, an allocation strategy with preference parameter α is proposed considering the links importance. The performance of bandwidth allocation strategy is studied for the local routing protocol and the shortest path protocol. When important links are slightly favored in the bandwidth allocation, the system can achieve the optimal traffic performance for the two routing protocols. For the shortest path protocol, we also give a method to estimate the network traffic capacity theoretically.

show abstract

Section: The Modelsmentioning

confidence: 99%

Bandwidth allocation strategy for traffic systems of scale-free network

Ling

Wei

et al. 2010

Physics Letters A

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the past few years, the phase-transition phenomena [5,6], the scaling of traffic fluctuations [7,8], and the routing strategies [9][10][11][12][13][14][15][16][17][18][19] of networked traffic have been widely studied. And Models are proposed to mimic the traffic on complex networks by introducing packets generating rate as well as randomly selected sources and destinations of each packet.…”

Section: Introductionmentioning

confidence: 99%

Optimal Routing Strategy on Scale-free Networks with Heterogeneous Delivering Capacity

Yamei¹,

Zuoming

2015

IJFGCN

View full text Add to dashboard Cite

We proposed the information traffic dynamics on scale-free networks considering the heterogeneous delivering capacity. In the previous researches, the delivering capacity is the same for all nodes in the system, which obviously contradicts the real observations. In this paper, a heuristic algorithm for the optimization of transport is proposed to enhance traffic efficiency in complex networks, where each node's capacity is set as i c = i k and i k is the degree of node i. Our algorithm balances traffic on a scalefree network by minimizing the maximum effective betweenness, which can avoid or reduce the overload in some busy nodes. The simulation result shows that the network capacity can reach a very high value, which is four times more than that of the efficient routing strategy. The distribution of traffic load is also studied and it is found that our optimal routing strategy can make a good balance between hub nodes and non-hub nodes, resulting in high network capacity.

show abstract

“…[17,18] In the past few years, the routing strategies and resource allocations for traffic dynamics of networks have been widely studied. [19][20][21][22][23][24][25][26][27] In many realistic communication systems, developing a better routing strategy to enhance the network capacity is usually preferable to avoid high cost of changing infrastructure. Recently, the shortest path strategy is widely used in many systems.…”

Section: Introductionmentioning

confidence: 99%

Global forward-predicting dynamic routing for traffic concurrency space stereo multi-layer scale-free network

et al. 2015

View full text Add to dashboard Cite

Many real communication networks, such as oceanic monitoring network and land environment observation network, can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Understanding how traffic dynamics depend on these real communication networks and finding an effective routing strategy that can fit the circumstance of traffic concurrency and enhance the network performance are necessary. In this light, we propose a traffic model for space stereo multi-layer complex network and introduce two kinds of global forward-predicting dynamic routing strategies, global forward-predicting hybrid minimum queue (HMQ) routing strategy and global forward-predicting hybrid minimum degree and queue (HMDQ) routing strategy, for traffic concurrency space stereo multi-layer scale-free networks. By applying forward-predicting strategy, the proposed routing strategies achieve better performances in traffic concurrency space stereo multi-layer scale-free networks. Compared with the efficient routing strategy and global dynamic routing strategy, HMDQ and HMQ routing strategies can optimize the traffic distribution, alleviate the number of congested packets effectively and reach much higher network capacity.

show abstract

Traffic of packets with non-homogeneously selected destinations in scale-free network

Cited by 35 publications

References 46 publications

Bandwidth allocation strategy for traffic systems of scale-free network

Bandwidth allocation strategy for traffic systems of scale-free network

Optimal Routing Strategy on Scale-free Networks with Heterogeneous Delivering Capacity

Global forward-predicting dynamic routing for traffic concurrency space stereo multi-layer scale-free network

Contact Info

Product

Resources

About