Abstract
Our object of study is a multiclass queueing network (MQNET) which consists of a collection of (connected) single-server stations. Exogenous arrivals into the system form independent Poisson streams, service times are exponential and we have Markovian routing of customers between stations. Recent results concerning linear programming (LP) based approaches enable us to establish a simple and intuitive stability condition. This is of interest in its own right, but also enables us to progress with a study of optimal scheduling and performance analysis. Our methodology here is also based on LP. A primal-dual approach exploits the fact that the system satisfies (approximate) conservation laws to yield perform-ance guarantees for a natural index-based scheduling heuristic. We are also able to analyse the performance of an arbitrary priority policy.
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.
