Networking - A Statistical Physics Perspective

Abstract

Efficient networking has a substantial economic and societal impact in a broad range of areas including transportation systems, wired and wireless communications and a range of Internet applications. As transportation and communication networks become increasingly more complex, the ever increasing demand for congestion control, higher traffic capacity, quality of service, robustness and reduced energy consumption require new tools and methods to meet these conflicting requirements. The new methodology should serve for gaining better understanding of the properties of networking systems at the macroscopic level, as well as for the development of new principled optimization and management algorithms at the microscopic level. Methods of statistical physics seem best placed to provide new approaches as they have been developed specifically to deal with non-linear large scale systems. This paper aims at presenting an overview of tools and methods that have been developed within the statistical physics community and that can be readily applied to address the emerging problems in networking. These include diffusion processes, methods from disordered systems and polymer physics, probabilistic inference, which have direct relevance to network routing, file and frequency distribution, the exploration of network structures and vulnerability, and various other practical networking applications.

(Review article) 71 pages, 14 figures

References in corpus (32)

• Modularity and community structure in networks
• Synchronization in complex networks
• Critical phenomena in complex networks
• Loopy Belief Propagation for Approximate Inference: An Empirical Study
• Community structure in directed networks
• Cascade control and defense in complex networks
• New Model of Internet Topology Using k-shell Decomposition
• Thresholds for epidemic spreading in networks
• Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems
• Survey propagation: an algorithm for satisfiability
• Statistical physics-based reconstruction in compressed sensing
• A Landscape Analysis of Constraint Satisfaction Problems
• Laplacian spectra of complex networks and random walks on them: Are scale-free architectures really important?
• Scale-free trees: the skeletons of complex networks
• Loopy Belief Propagation as a Basis for Communication in Sensor Networks
• Random walks on complex trees
• Statistical Mechanics of Steiner trees
• On the number of circuits in random graphs
• The Competition for Shortest Paths on Sparse Graphs
• Impact of hierarchical modular structure on ranking of individual nodes in directed networks
• A rigorous analysis of the cavity equations for the minimum spanning tree
• Inference and Optimization of Real Edges on Sparse Graphs - A Statistical Physics Perspective
• Finding long cycles in graphs
• Tracing the Evolution of Physics on the Backbone of Citation Networks
• Random walks on networks: cumulative distribution of cover time
• Percolation and Loop Statistics in Complex Networks
• Minimizing Unsatisfaction in Colourful Neighbourhoods
• Optimal Resource Allocation in Random Networks with Transportation Bandwidths
• Next nearest neighbour Ising models on random graphs
• Extremal Properties of Complex Networks
• Random Walks in Local Dynamics of Network Losses
• Random Walks on Complex Networks

Cited by in corpus (11)

• Percolation on complex networks: Theory and application
• Quasi-equilibrium in glassy dynamics: an algebraic view
• Solving the undirected feedback vertex set problem by local search
• The average number of distinct sites visited by a random walker on random graphs
• Agent-Based Models in Social Physics
• Designing optimal networks for multi-commodity transport problem
• Multicommodity routing optimization for engineering networks
• Cohesive urban bicycle infrastructure design through optimal transport routing in multilayer networks
• Complete Visitation Statistics of 1d Random Walks
• Infrastructure adaptation and emergence of loops in network routing with time-dependent loads
• Learning the optimally coordinated routes from the statistical mechanics of polymers