Abstract
The problem of finding the optimal routing and flow control of a single-class Markovian network under a suitable optimization criterion is analyzed. It is proven that, if complete information about the state of the network is made available to the network controller, the optimal state dependent routing is essentially deterministic, and the optimal flow control is of a generalized window type. An iterative linear programming algorithm is given for the derivation of the optimal routing and flow control policy.
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.
