Self avoiding paths routing algorithm in scale-free networks

DOI10.1063/1.4790864MaRDI QIDQ2944678zbMATH OpenOpenAlexWikidataFDO

Authors Abdeljalil Rachadi, Mohamed Jedra, N. Zahid

Publication date 2 September 2015

Published in Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1302.3440

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Abstract: In this paper, we present a new routing algorithm called "the Self Avoiding Paths Routing Algorithm". Its application to traffic flow in scale-free networks shows a great improvement over the so called "efficient routing" protocol while at the same time maintaining a relatively low average packet travel time. It has the advantage of minimizing path overlapping throughout the network in a self consistent manner with a relatively small number of iterations by maintaining an equilibrated path distribution especially among the hubs. This results in a significant shifting of the critical packet generation rate over which traffic congestion occurs, thus permitting the network to sustain more information packets in the free flow state. The performance of the algorithm is discussed both on a Bar'abasi-Albert (BA) network and real autonomous system (AS) network data.

Recommendations

• EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS
• Improved efficient routing strategy on scale-free networks
• Local routing algorithm optimization and design of scale-free networks
• Scale-free compact routing schemes in networks of low doubling dimension
• A global routing method for weighted scale-free networks
• Optimal scale-free compact routing schemes in networks of low doubling dimension

Cites work

• A genetic algorithm for the weight setting problem in OSPF routing
• CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
• Efficient routing on scale-free networks based on local information
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 710624 (Why is no real title available?)
• Optimal structure of complex networks for minimizing traffic congestion
• Scale-Free Networks
• The Structure and Function of Complex Networks
• Transport optimization on complex networks

Cited in

(8)

• A hybrid routing model for mitigating congestion in networks
• Self-adaptive management policy for scale-free networks
• scientific article; zbMATH DE number 2009832 (Why is no real title available?)
• Dynamic routing algorithm based on local information in a free-scale network
• EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS
• Self-organization scheme for balanced routing in large-scale multi-hop networks
• Efficient routing on scale-free networks based on local information
• On the critical packet injection rate of a preferential next-nearest neighbor routing traffic model on Barabási-Albert networks

This page was built for publication: Self avoiding paths routing algorithm in scale-free networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944678)