Optimal control of store-and-forward networks

DOI10.1002/oca.4660030205zbMath0484.93037OpenAlexW2043938630MaRDI QIDQ3944435

Janusz Filipiak

Publication date: 1982

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

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

zbMATH Keywords

Pontryagin's minimum principleoptimal routingsteady-state costate solutionstore-and-forward networksoptimal congestion controltransportation and computer networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Nonlinear systems in control theory (93C10) Adaptive control/observation systems (93C40) Traffic problems in operations research (90B20) Control/observation systems governed by ordinary differential equations (93C15) Optimality conditions for problems involving ordinary differential equations (49K15)

Cites Work

• Unnamed Item
• Unnamed Item
• Mathematical theories of traffic flow
• Unloading of congestion in deterministic queueing networks
• Modelling and hierarchical optimization for oversaturated urban road traffic networks
• Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)
• On quadratic adaptive routing algorithms
• A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue
• Dynamic Modeling and Control of Congestion-Prone Systems
• The Modeling of Adaptive Routing in Data-Communication Networks
• Multicommodity network flows—A survey
• Survey of decentralized control methods for large scale systems
• Optimum Control of a System of Oversaturated Intersections
• The flow deviation method: An approach to store‐and‐forward communication network design
• Traffic assignment problem for a general network

This page was built for publication: Optimal control of store-and-forward networks