Transport optimization on complex networks

DOI10.1063/1.2731718zbMath1159.37342arXivcond-mat/0701184OpenAlexW2049548647WikidataQ51626161 ScholiaQ51626161MaRDI QIDQ3624815

John A. Marsh, K. E. Bassler, Bogdan Dănilă, Yong Yu

Publication date: 30 April 2009

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0701184

Mathematics Subject Classification ID

Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)

Related Items (9)

Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length ⋮ Communication network designing: transmission capacity, cost and scalability ⋮ Self avoiding paths routing algorithm in scale-free networks ⋮ Traffic dynamics on complex networks: a survey ⋮ Malleability of complex networks ⋮ Distance-based routing strategy for traffic transport in spatial networks ⋮ IMPROVED EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS ⋮ Introduction: Optimization in networks ⋮ The self-adaptive routing strategy to alleviate packet loss in finite buffer networks

Cites Work

• Finding good approximate vertex and edge partitions is NP-hard
• A genetic algorithm for the weight setting problem in OSPF routing
• Scaling in small-world resistor networks
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• A critical point for random graphs with a given degree sequence
• Collective dynamics of ‘small-world’ networks
• Unnamed Item

This page was built for publication: Transport optimization on complex networks