In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, b
Interrelationship between controlling arrival and service in queueing systems
β Scribed by Surendra M. Gupta
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 481 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0305-0548
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper deals with the statistical analysis from a Bayesian point of view, of bulk arrival queues where the batch size is considered as a fixed constant. The focus is on prediction of the usual measures of performance of the system in the steady state. The probability generating function of the p
In this paper, we give an explicit relation between steady-state probability distributions of the buffer occupancy at customer entrance and departure epochs, for the classical single-server system G/G [N] /1 with batch services and for the finite capacity case. The method relies on level-crossing ar
A controlled single-server retrial queueing system is investigated. Customers arrive according to batch Markovian arrival process. The system has several operation modes which are controlled by means of a threshold strategy. The stationary distribution is calculated. Optimization problem is consider