Upper bound of network capacity and a static optimal packet routing strategy

DOI10.1016/j.physa.2014.01.045zbMath1395.90041OpenAlexW2052074900MaRDI QIDQ1782676

Xiang Ling, Cai Hong Kai, Mao-Bin Hu, Jiancheng Long

Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2014.01.045

zbMATH Keywords

network capacityscale-free networkstraffic efficiencyMAX-flow-MIN-cost problempacket routing strategy

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

Improve traffic efficiency with advanced travel time feedback in urban networks

Uses Software

• GAMS

Cites Work

• Unnamed Item
• Efficient routing on scale-free networks based on local information
• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• The maximum concurrent flow problem
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Upper bound of network capacity and a static optimal packet routing strategy