Physics-inspired methods for networking and communications

Advances in statistical physics relating to our understanding of large-scale complex systems have recently been successfully applied in the context of communication networks. Statistical mechanics methods can be used to decompose global system behavior into simple local interactions. Thus, large-scale problems can be solved or approximated in a distributed manner with iterative lightweight local messaging. This survey discusses how statistical physics methodology can provide efficient solutions to hard network problems that are intractable by classical methods. We highlight three typical examples in the realm of networking and communications. In each case we show how a fundamental idea of statistical physics helps solve the problem in an efficient manner. In particular, we discuss how to perform multicast scheduling with message passing methods, how to improve coding using the crystallization process, and how to compute optimal routing by representing routes as interacting polymers.

[1]  Paolo Giaccone,et al.  A belief-propagation approach for multicast scheduling in input-queued switches , 2013, 2013 IEEE International Conference on Communications Workshops (ICC).

[2]  Chi Ho Yeung,et al.  From the physics of interacting polymers to optimizing routes on the London Underground , 2013, Proceedings of the National Academy of Sciences.

[3]  Chi Ho Yeung,et al.  Networking—a statistical physics perspective , 2011, 1110.2931.

[4]  François Baccelli,et al.  A mean-field analysis of short lived interacting TCP flows , 2004, SIGMETRICS '04/Performance '04.

[5]  Patrick Thiran,et al.  On the fairness of large CSMA networks , 2009, IEEE Journal on Selected Areas in Communications.

[6]  Nicolas Macris,et al.  Threshold Saturation in Spatially Coupled Constraint Satisfaction Problems , 2011, ArXiv.

[7]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[8]  Florent Krzakala,et al.  Statistical physics-based reconstruction in compressed sensing , 2011, ArXiv.

[9]  Chi Ho Yeung,et al.  Shortest node-disjoint paths on random graphs , 2014, ArXiv.

[10]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[11]  Rüdiger L. Urbanke,et al.  Spatially coupled ensembles universally achieve capacity under belief propagation , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[12]  Leandros Tassiulas,et al.  On emulating hardware/software co-designed control algorithms for packet switches , 2014, SimuTools.

[13]  Chi Ho Yeung,et al.  The Competition for Shortest Paths on Sparse Graphs , 2012, Physical review letters.

[14]  Devavrat Shah,et al.  Message Passing for Maximum Weight Independent Set , 2008, IEEE Transactions on Information Theory.

[15]  S. Stenholm.  Information, Physics and Computation, by Marc Mézard and Andrea Montanari , 2010 .