Abstract
Queueing network models (QNMs) are widely recognised as powerful evaluation tools for representing computer and communication systems and predicting their performance. This paper focuses on arbitrary open exponential QNMs with server vacations and repetitive-service blocking with random destination (RS-RD). A finite capacity M/M/l/N queue with exponential server vacation periods - solved via the principle of minimum relative entropy (MRE) and classical queueing theory - plays the role of an efficient building block in the solution process. A cost-effective algorithm for the analysis of such QNMs is step-wise described and numerical results against simulation are included to demonstrate the credibility of the MRE approach.
Sign-in/Register to access full text options 
Free) 
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 call
