Abstract
AbstractThis paper describes a general point of view on the subject of store‐and‐forward queueing networks. A systematic approach to a store‐and‐forward network as a whole is applied. This allows network problems which involve dynamic optimization of congestion control and routing to be treated in a common framework. The dynamic model applied is non‐linear and can be handled straightforwardly by optimal control system theory. It is shown that under normal operational conditions the optimal flow pattern is given by the steady‐state solution of the costate equations. Properties of the optimal flow pattern are examined in detail. Then, schemes of the operation of the network under different operating conditions are discussed at length. It is shown that the optimal control strategies depend on the total volume of traffic forwarded to the network. Algorithms are developed for different traffic demand patterns, and a numerical example is also given.
Sign-in/Register to access full text options 
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.
