Optimal flow control of multi server time sharing queueing network with priority
by Pankaj Sharma
International Journal of Mathematics in Operational Research (IJMOR), Vol. 9, No. 3, 2016

Abstract: In this investigation, a multi server queueing network problem with cutoff priority is studied. The two types of input traffic are allowed in the system with different arrival rates. One type of input traffic has priority over the other type of traffic. Service times of the input traffic are independent and identically distributed according to exponential distribution. The maximum number of packets of each class traffic and the optimal input rates in the system are determined under the maximum allowed mean time delay and maximum input rate. The product type solution has been employed to obtain the queue size. Numerical illustrations are given to validate the analytical results.

Online publication date: Sat, 03-Sep-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com