Efficient algorithm for routing optimization via statistical mechanics

Research output: Chapter in Book/Report/Conference proceedingChapters

1 Citation (Scopus)

Abstract

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. Copyright © 2013 IEEE.
Original languageEnglish
Title of host publicationThe proceedings of 2013 IEEE International Conference on Communications Workshops (ICC)
EditorsDong-In KIM, Peter MUELLER
Place of PublicationDanvers, MA
PublisherIEEE
Pages1420-1424
ISBN (Print)9781467357531
DOIs
Publication statusPublished - 2013

Citation

Yeung, C. H. (2013). Efficient algorithm for routing optimization via statistical mechanics. In D.-I. Kim & P. Mueller (Eds.), The proceedings of 2013 IEEE International Conference on Communications Workshops (ICC) (pp. 1420-1424). Danvers, MA: IEEE.

Fingerprint Dive into the research topics of 'Efficient algorithm for routing optimization via statistical mechanics'. Together they form a unique fingerprint.