Optimization of transport protocols with path-length constraints in complex networks
arXiv:1006.0711 · doi:10.1103/PhysRevE.82.036119
Abstract
We propose a protocol optimization technique that is applicable to both weighted or unweighted graphs. Our aim is to explore by how much a small variation around the Shortest Path or Optimal Path protocols can enhance protocol performance. Such an optimization strategy can be necessary because even though some protocols can achieve very high traffic tolerance levels, this is commonly done by enlarging the path-lengths, which may jeopardize scalability. We use ideas borrowed from Extremal Optimization to guide our algorithm, which proves to be an effective technique. Our method exploits the degeneracy of the paths or their close-weight alternatives, which significantly improves the scalability of the protocols in comparison to Shortest Paths or Optimal Paths protocols, keeping at the same time almost intact the length or weight of the paths. This characteristic ensures that the optimized routing protocols are composed of paths that are quick to traverse, avoiding negative effects in data communication due to path-length increases that can become specially relevant when information losses are present.
arXiv comment8 pages, 8 figures
References in corpus (28)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Finding and evaluating community structure in networks
- Who is the best connected scientist? A study of scientific coauthorship networks
- Breakdown of the Internet under intentional attack
- Universal Behavior of Load Distribution in Scale-free Networks
- Scale-Free Networks are Ultrasmall
- Generation of uncorrelated random scale-free networks
- Efficient routing on complex networks
- Optimal network topologies for local search with congestion
- Communication in networks with hierarchical branching
- Optimization with Extremal Dynamics
- Nature's Way of Optimizing
- Improved routing strategies for Internet traffic delivery
- Dynamics of jamming transitions in complex networks
- Optimal routing on complex networks
- Optimal Paths in Disordered Complex Networks
- Communication Bottlenecks in Scale-Free Networks
- Transport optimization on complex networks
- Optimal Path and Minimal Spanning Trees in Random Weighted Networks
- Current Flow in Random Resistor Networks: The Role of Percolation in Weak and Strong Disorder
- Comment on: 'Universal Behavior of Load Distribution in Scale-free Networks'
- Universal behavior of optimal paths in weighted networks with general disorder
- Limited path percolation in complex networks
- Load distribution in weighted complex networks
- Effect of Disorder Strength on Optimal Paths in Complex Networks
- Optimal transport on wireless networks
- Anomalous electrical and frictionless flow conductance in complex networks
Cited by in corpus (7)
- A model to identify urban traffic congestion hotspots in complex networks
- Decongestion of urban areas with hotspot-pricing
- Traffic flow in a Manhattan-like urban system
- Self Avoiding Paths Routing Algorithm in Scale-Free Networks
- Enhancing Transport Efficiency by Hybrid Routing Strategy
- A link model approach to identify congestion hotspots
- The K Shortest Paths Problem with Application to Routing