Unknown

Dataset Information

0

From the physics of interacting polymers to optimizing routes on the London Underground.


ABSTRACT: Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise.

SUBMITTER: Yeung CH 

PROVIDER: S-EPMC3752220 | biostudies-literature | 2013 Aug

REPOSITORIES: biostudies-literature

altmetric image

Publications

From the physics of interacting polymers to optimizing routes on the London Underground.

Yeung Chi Ho CH   Saad David D   Wong K Y Michael KY  

Proceedings of the National Academy of Sciences of the United States of America 20130729 34


Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled,  ...[more]

Similar Datasets

| S-EPMC6902242 | biostudies-literature
| S-EPMC6442556 | biostudies-literature
| S-EPMC9755232 | biostudies-literature
| S-EPMC4229857 | biostudies-other
| S-EPMC8522868 | biostudies-literature
| S-EPMC6280530 | biostudies-other
| S-EPMC9863878 | biostudies-literature
| S-EPMC10799659 | biostudies-literature
| S-EPMC10537616 | biostudies-literature
| S-EPMC4813905 | biostudies-other