Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length

DOI10.1016/j.physa.2016.02.002zbMath1400.90153OpenAlexW2253579294MaRDI QIDQ1619461

R. Smith

Publication date: 13 November 2018

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

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

zbMATH Keywords

networkscongestionbiased-shortest pathlinear-prediction

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Traffic problems in operations research (90B20)

Cites Work

• Unnamed Item
• Finding good approximate vertex and edge partitions is NP-hard
• 2SI2R rumor spreading model in homogeneous networks
• Emergence of Scaling in Random Networks
• Transport optimization on complex networks
• Optimal Routing in a Packet-Switched Computer Network

This page was built for publication: Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length