Efficient algorithm for routing optimization via statistical mechanics

• Published in: 2013 IEEE International Conference on Communications Workshops (ICC) pp. 1420 - 1424
• Main Author: Chi Ho Yeung
• Format: Conference Proceeding
• Language: English
• Published: 01.06.2013
• Subjects: Convergence; Cost function; Heuristic algorithms; Physics; Receivers; Routing; Routing protocols
• ISSN: 2164-7038
• DOI: 10.1109/ICCW.2013.6649460

Many practical routing algorithms are heuristic, adhoc and centralized, rendering generic and optimal path configurations difficult to obtain. Here we study a scenario whereby selected nodes in a given network communicate with fixed routers and employ statistical physics methods to obtain optimal routing solutions subject to a generic cost. A distributive message-passing algorithm capable of optimizing the path configuration in real instances is devised, based on the analytical derivation, and is greatly simplified by expanding the cost function around the optimized flow. Good algorithmic convergence is observed in most of the parameter regimes. By applying the algorithm, we study and compare the pros and cons of balanced traffic configurations to that of consolidated traffic, which provides important implications to practical communication and transportation networks. Interesting macroscopic phenomena are observed from the optimized states as an interplay between the communication density and the cost functions used.