Abstract
A branching system which consists of several parallel nonidentical communication devices with finite input buffers is considered in this paper. The system is designed and operated under a stochastic congestion control policy. Several job routing and buffer allocation decision models are analyzed in order to maximize the aggregate system throughput, or to minimize the storage space costs. The polynomial and pseudo-polynomial optimization algorithms which are presented here take advantage of the structural properties of this system. The results obtained are also of particular relevance in the design of load balancing policies for distributed computer systems.
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.
