Improved routing strategies for Internet traffic delivery

Abstract

We analyze different strategies aimed at optimizing routing policies in the Internet. We first show that for a simple deterministic algorithm the local properties of the network deeply influence the time needed for packet delivery between two arbitrarily chosen nodes. We next rely on a real Internet map at the autonomous system level and introduce a score function that allows us to examine different routing protocols and their efficiency in traffic handling and packet delivery. Our results suggest that actual mechanisms are not the most efficient and that they can be integrated in a more general, though not too complex, scheme.

Final version

References in corpus (8)

• Emergence of scaling in random networks
• The spread of epidemic disease on networks
• Evolution of networks
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Resilience to damage of graphs with degree correlations
• Dynamical properties of model communication networks
• Local versus Global Knowledge in the Barabasi-Albert scale-free network model

Cited by in corpus (53)

• The structure and dynamics of multilayer networks
• Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
• Efficient routing on complex networks
• Layered Complex Networks
• Data Based Identification and Prediction of Nonlinear and Complex Dynamical Systems
• Dynamics of jamming transitions in complex networks
• Optimal routing on complex networks
• Integrating static and dynamic information for routing traffic
• Congestion induced by the structure of multiplex networks
• Communication Bottlenecks in Scale-Free Networks
• The Large Scale Curvature of Networks
• Extreme events in dynamical systems and random walkers: A review
• On the universality of the scaling of fluctuations in traffic on complex networks
• Scaling breakdown in flow fluctuations on complex networks
• Transport optimization on complex networks
• An adaptive routing strategy for packet delivery in complex networks
• Traffic optimization in transport networks based on local routing
• An efficient approach of controlling traffic congestion in scale-free networks
• Efficient routing strategies in scale-free networks with limited bandwidth
• Impact of community structure on information transfer
• Mobility and Congestion in Dynamical Multilayer Networks with Finite Storage Capacity
• Efficient routing on multilayered communication networks
• Congestion-gradient driven transport on complex networks
• Critical fluctuations in spatial complex networks
• Traffic dynamics in scale-free networks with limited packet-delivering capacity
• Collectively optimal routing for congested traffic limited by link capacity
• Congestion diffusion and decongestion strategy in networked traffic
• The Dynamics of Internet Traffic: Self-Similarity, Self-Organization, and Complex Phenomena
• The effect of bandwidth in scale-free network traffic
• Local Empathy provides Global Minimization of Congestion in Communication Networks
• Immunization of traffic-driven epidemic spreading
• Information transport in multiplex networks
• Traffic flow in a Manhattan-like urban system
• Traffic-driven epidemic spreading in correlated networks
• Preferential Behaviour and Scaling in Diffusive Dynamics on Networks
• Optimal transport on wireless networks
• Optimization of transport protocols with path-length constraints in complex networks
• Generalized optimal paths and weight distributions revealed through the large deviations of random walks on networks
• Synchronization of networks with variable local properties
• Scaling behavior of an artificial traffic model on scale-free networks
• A Survey of Interdependency Models for Critical Infrastructure Networks
• Self Avoiding Paths Routing Algorithm in Scale-Free Networks
• The Gradient Mechanism in a Communication Network
• Optimal transport on supply-demand networks
• Michaelis-Menten Dynamics in Complex Heterogeneous Networks
• Enhancing Transport Efficiency by Hybrid Routing Strategy
• Preferential Detachment in Broadcast Signaling Networks: Connectivity and Cost Trade-off
• Optimal forwarding ratio on dynamical networks with heterogeneous mobility
• Traffic-driven epidemic spreading on scale-free networks with tunable degree distribution
• Study of dynamic and static routing for improvement of the transportation efficiency on small complex networks
• Jamming of directed traffic on a square lattice
• Internet data packet transport: from global topology to local queueing dynamics
• Mean First Hitting Time of Searching for Path Through Random Walks on Complex Networks