An adaptive routing scheme in scale-free networks

2015 ◽  
Vol 26 (12) ◽  
pp. 1550138 ◽  
Author(s):  
Nora Ben Haddou ◽  
Hamid Ez-Zahraouy ◽  
Abdelilah Benyoussef
Keyword(s):  
Shortest Path ◽  
Routing Protocol ◽  
Dynamic Properties ◽  
Original Model ◽  
Local Dynamic ◽  
Optimal Conditions ◽  
Optimal Form ◽  
Scale Free ◽  
Scale Free Networks ◽  
Traffic Awareness

We suggest an optimal form of traffic awareness already introduced as a routing protocol which combines structural and local dynamic properties of the network to determine the followed path between source and destination of the packet. Instead of using the shortest path, we incorporate the "efficient path" in the protocol and we propose a new parameter α that controls the contribution of the queue in the routing process. Compared to the original model, the capacity of the network can be improved more than twice when using the optimal conditions of our model. Moreover, the adjustment of the proposed parameter allows the minimization of the travel time.

An improved global dynamic routing strategy for scale-free network with tunable clustering

2016 ◽  
Vol 30 (22) ◽  
pp. 1650302 ◽  
Author(s):  
Lina Sun ◽  
Ning Huang ◽  
Yue Zhang ◽  
Yannan Bai
Keyword(s):  
Shortest Path ◽  
Path Length ◽  
Network Capacity ◽  
Network Routing ◽  
Scale Free Network ◽  
Scale Free ◽  
Global Dynamic ◽  
Routing Strategy ◽  
Traffic Awareness ◽  
Free Network

An efficient routing strategy can deliver packets quickly to improve the network capacity. Node congestion and transmission path length are inevitable real-time factors for a good routing strategy. Existing dynamic global routing strategies only consider the congestion of neighbor nodes and the shortest path, which ignores other key nodes’ congestion on the path. With the development of detection methods and techniques, global traffic information is readily available and important for the routing choice. Reasonable use of this information can effectively improve the network routing. So, an improved global dynamic routing strategy is proposed, which considers the congestion of all nodes on the shortest path and incorporates the waiting time of the most congested node into the path. We investigate the effectiveness of the proposed routing for scale-free network with different clustering coefficients. The shortest path routing strategy and the traffic awareness routing strategy only considering the waiting time of neighbor node are analyzed comparatively. Simulation results show that network capacity is greatly enhanced compared with the shortest path; congestion state increase is relatively slow compared with the traffic awareness routing strategy. Clustering coefficient increase will not only reduce the network throughput, but also result in transmission average path length increase for scale-free network with tunable clustering. The proposed routing is favorable to ease network congestion and network routing strategy design.

Enhancing traffic capacity of scale-free networks by link-directed strategy

2016 ◽  
Vol 27 (03) ◽  
pp. 1650028 ◽  
Author(s):  
Jinlong Ma ◽  
Weizhan Han ◽  
Qing Guo ◽  
Shuai Zhang
Keyword(s):  
Communication Networks ◽  
Routing Protocol ◽  
Underlying Structure ◽  
Transport Efficiency ◽  
Scale Free ◽  
Traffic Capacity ◽  
Scale Free Networks ◽  
High Betweenness ◽  
Direction Determining ◽  
High Degree

The transport efficiency of a network is strongly related to the underlying structure. In this paper, we propose an efficient strategy named high-betweenness-first (HBF) for the purpose of improving the traffic handling capacity of scale-free networks by limiting a fraction of undirected links to be unidirectional ones based on the links’ betweenness. Compared with the high-degree-first (HDF) strategy, the traffic capacity can be more significantly enhanced under the proposed link-directed strategy with the shortest path (SP) routing protocol. Simulation results in the Barabási–Albert (BA) model for scale-free networks show that the critical generating rate [Formula: see text] which can evaluate the overall traffic capacity of a network system is larger after applying the HBF strategy, especially with nonrandom direction-determining rules. Because of the strongly improved traffic capacity, this work is helpful to design and optimize modern communication networks such as the software defined network.

scholarly journals Tomography of scale-free networks and shortest path trees

2006 ◽  
Vol 74 (6) ◽  
Author(s):  
Tomer Kalisky ◽  
Reuven Cohen ◽  
Osnat Mokryn ◽  
Danny Dolev ◽  
Yuval Shavitt ◽  
...  
Keyword(s):  
Shortest Path ◽  
Scale Free ◽  
Scale Free Networks ◽  
Shortest Path Trees

scholarly journals Dynamics analysis of an online gambling spreading model on scale-free networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yu Kong ◽  
Tao Li ◽  
Yuanmei Wang ◽  
Xinming Cheng ◽  
He Wang ◽  
...  
Keyword(s):  
Network Topology ◽  
Negative Impact ◽  
Online Gambling ◽  
Basic Reproductive Number ◽  
Reproductive Number ◽  
Scale Free ◽  
Spreading Model ◽  
Spreading Dynamics ◽  
Scale Free Networks ◽  
Gambling Policy

AbstractNowadays, online gambling has a great negative impact on the society. In order to study the effect of people’s psychological factors, anti-gambling policy, and social network topology on online gambling dynamics, a new SHGD (susceptible–hesitator–gambler–disclaimer) online gambling spreading model is proposed on scale-free networks. The spreading dynamics of online gambling is studied. The basic reproductive number $R_{0}$ R 0 is got and analyzed. The basic reproductive number $R_{0}$ R 0 is related to anti-gambling policy and the network topology. Then, gambling-free equilibrium $E_{0}$ E 0 and gambling-prevailing equilibrium $E_{ +} $ E + are obtained. The global stability of $E_{0}$ E 0 is analyzed. The global attractivity of $E_{ +} $ E + and the persistence of online gambling phenomenon are studied. Finally, the theoretical results are verified by some simulations.

scholarly journals Effective gravitation path routing strategy on scale-free networks

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Jinlong Ma ◽  
Junfeng Zhang ◽  
Yongqiang Zhang
Keyword(s):  
Scale Free ◽  
Routing Strategy ◽  
Scale Free Networks
Sign in / Sign up

Export Citation Format

Share Document