Unloading of congestion in deterministic queueing networks

DOI10.1002/OCA.4660020104zbMath0457.90030OpenAlexW2172193154MaRDI QIDQ3907384

Janusz Filipiak

Publication date: 1981

Published in: Optimal Control Applications and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/oca.4660020104

zbMATH Keywords

uniquenessexistence of optimal solutionsPontryagin maximum principleoptimal routingoptimal flow patterncontrol proceduredeterministic queueing networkstopological optimization algorithmunloading of congestion

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items (1)

Optimal control of store-and-forward networks

Cites Work

• Unnamed Item
• On quadratic adaptive routing algorithms
• Queuing Networks with Population Size Constraints
• The Modeling of Adaptive Routing in Data-Communication Networks
• Optimum Control of a System of Oversaturated Intersections
• Traffic assignment problem for a general network

This page was built for publication: Unloading of congestion in deterministic queueing networks