Abstract
An approach to the solution of the dynamic routing problem in a queueing network is presented in the paper, based on Lagrangian duality and decomposition techniques. A numerical solution can be obtained by a multilevel off-line computational procedure. The considered network has deterministic inputs and initial state, and the optimization problem is in discrete time. Link capacity and queue length constraints are taken into account.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
