Optimal flow control of multi server time sharing queueing network with priority

Pankaj Sharma

International Journal of Mathematics in Operational Research, 2016, vol. 9, issue 3, 363-374

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.

Keywords: cutoff priority; throughput; mean time delay; time sharing; blocking; probability; optimal flow control; multi server queueing networks. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=78826 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:9:y:2016:i:3:p:363-374

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().