Unloading of congestion in deterministic queueing networks

DOI10.1002/OCA.4660020104zbMATH Open0457.90030OpenAlexW2172193154MaRDI QIDQ3907384FDOQ3907384

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

• Title not available (Why is that?)
• Traffic assignment problem for a general network
• Optimum Control of a System of Oversaturated Intersections
• The Modeling of Adaptive Routing in Data-Communication Networks
• Queuing Networks with Population Size Constraints
• On quadratic adaptive routing algorithms

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)