Unloading of congestion in deterministic queueing networks

DOI10.1002/OCA.4660020104MaRDI QIDQ3907384zbMATH OpenOpenAlexFDO

Authors Janusz Filipiak

Publication date 1981

Published in Optimal Control Applications \& Methods (Search for Journal in Brave)

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

zbMATH Keywords

uniquenessPontryagin maximum principleexistence of optimal solutionsoptimal routingoptimal flow patterncontrol proceduredeterministic queueing networkstopological optimization algorithmunloading of congestion

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3181355 (Why is no real title available?)
• On quadratic adaptive routing algorithms
• Optimum Control of a System of Oversaturated Intersections
• Queuing Networks with Population Size Constraints
• The Modeling of Adaptive Routing in Data-Communication Networks
• Traffic assignment problem for a general network

Cited in

(1)

• Optimal control of store-and-forward networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3907384)