Minimizing Congestion in Single-Source, Single-Sink Queueing Networks

DOI10.1137/21m1457515zbMath1523.90094OpenAlexW4386785195MaRDI QIDQ6073292

Unnamed Author, Unnamed Author, S. D. Howison, Unnamed Author, Mason A. Porter

Publication date: 17 October 2023

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/21m1457515

zbMATH Keywords

random walksqueueing networkscomplex systemscongestionhuman mobility

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamical systems on networks. A tutorial
• Random walks and diffusion on networks
• Traffic dynamics on complex networks: a survey
• Optimal information transmission in organizations: Search and congestion
• Stochastic Networks
• A Proof for the Queuing Formula: L = λW
• Spatial Networks
• Synchronization in complex oscillator networks and smart grids
• Communication and optimal hierarchical networks

This page was built for publication: Minimizing Congestion in Single-Source, Single-Sink Queueing Networks