An effective local dynamic strategy to clear congested multidestination networks

DOI10.1109/TAC.1982.1102943MaRDI QIDQ3970141zbMATH OpenFDO

Authors P. E. Sarachik

Publication date 1982

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.1982.1102943

zbMATH Keywords

congested nodedynamical optimal control problemHamilton-Jacobi theorylocal routing problemminimization of total delaymultidestination networksoptimal feedback solutionqueueing networktraffic controltraffic networktwo alternative paths

Mathematics Subject Classification ID

Hamilton-Jacobi theories (49L99) Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Circuits, networks (94C99)

This page was built for publication: An effective local dynamic strategy to clear congested multidestination networks

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