Self avoiding paths routing algorithm in scale-free networks
From MaRDI portal
Publication:2944678
DOI10.1063/1.4790864zbMath1320.68036arXiv1302.3440OpenAlexW3097984811WikidataQ46155490 ScholiaQ46155490MaRDI QIDQ2944678
Mohamed Jedra, Abdeljalil Rachadi, Nour-Eddine 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
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (1)
Cites Work
- Unnamed Item
- Efficient routing on scale-free networks based on local information
- A genetic algorithm for the weight setting problem in OSPF routing
- Emergence of Scaling in Random Networks
- Scale-Free Networks
- Transport optimization on complex networks
- Optimal structure of complex networks for minimizing traffic congestion
- The Structure and Function of Complex Networks
- CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
This page was built for publication: Self avoiding paths routing algorithm in scale-free networks