Abstract
The problem of the optimal flow control of a G/G/l queue at equilibrium is investigated by approximating the general (G-type) distributions by a maximum entropy model with known first two moments. It is shown that the flow control mechanism maximizing the throughput, under a bounded time delay criterion, is of window type (bang-bang control). The maximum number of packets in transit within the system (i.e., sliding window size) is derived in terms of the maximum allowed average time delay. Furthermore, the relationship between the maximum throughput and maximum time delay is determined. Numerical examples provide useful information on how critically the optimal throughput is affected by the distributional form of the interarrival and service patterns and a conjecture on performance bounds is made.
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.
