Abstract
The problem of optimum flow control of a class of queueing systems which appears as a model of datagram and virtual circuit computer communication networks is investigated. This class intuitively has the property that by increasing the load on the network, both the average throughput and the average time delay also increase. It is shown that the control that achieves the maximum throughput under a bounded average time delay criterion can be specified by a flow control mechanism (bang-bang control). The window size L , the maximum number of unacknowledged packets in the system, can be easily derived from the preassigned upper bound on the time delay T , the Norton equivalent of the queueing system μ, and the maximum admissible total load on the network c .
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.
