EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS
From MaRDI portal
Recommendations
- Improved efficient routing strategy on scale-free networks
- Efficient routing on scale-free networks based on local information
- Optimal scale-free compact routing schemes in networks of low doubling dimension
- Scale-free compact routing schemes in networks of low doubling dimension
- Self avoiding paths routing algorithm in scale-free networks
- An efficient routing strategy for traffic dynamics on two-layer complex networks
- Local routing algorithm optimization and design of scale-free networks
Cited in
(16)- Robustness analysis of static routing on networks
- Effective usage of shortest paths promotes transportation efficiency on scale-free networks
- Distance-based routing strategy for traffic transport in spatial networks
- Self avoiding paths routing algorithm in scale-free networks
- A global routing method for weighted scale-free networks
- TRAFFIC CONGESTION ANALYSIS IN COMPLEX NETWORKS BASED ON VARIOUS ROUTING STRATEGIES
- A LOCAL INFORMATION-BASED ROUTING STRATEGY ON THE SCALE-FREE NETWORK
- Integrating local dynamic and global static information for routing traffic on networks
- Improved efficient routing strategy on scale-free networks
- The self-adaptive routing strategy to alleviate packet loss in finite buffer networks
- Dynamic routing algorithm based on local information in a free-scale network
- An efficient routing strategy for traffic dynamics on two-layer complex networks
- Local routing algorithm optimization and design of scale-free networks
- Routing optimization in networks based on traffic gravitational field model
- An adaptive routing strategy for packet delivery in complex networks
- Efficient routing on scale-free networks based on local information
This page was built for publication: EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5320901)