Multiclass G-Networks of Processor Sharing Queues with Resets
We consider an open queueing network of generalized queues with several class of customers and one class of signal. Each queue has an infinite capacity and one server. The service time is exponential. The service discipline is Processor Sharing. After its service completion a customer moves to another queue and may become a signal. When the signal enters a non empty queue it vanishes while it resets the queue when it enters an empty queue. We prove that the steady state distribution for such a network of queues has a product form solution. To the best of our knowledge it is the first multiclass network of generalized queues and resets with product form solution.
KeywordsService Discipline Processor Sharing Service Completion Negative Customer Queue Network Model
Unable to display preview. Download preview PDF.
- 3.Fourneau, J.M.: Computing the steady-state distribution of networks with positive and negative customers. In: 13th IMACS World Congress on Computation and Applied Mathematics, Dublin (1991)Google Scholar
- 5.Fourneau, J.M., Kloul, L., Quessette, F.: Multiple class G-networks with jumps back to Zero. IEEE Mascots 95, 28–32 (1995)Google Scholar
- 7.Fourneau, J.M.: Closed G-networks with resets: Product Form solution. In: 4th International Conference on the Quantitative Evaluation of Systems QEST 2007, Edinburgh, pp. 287–296 (2007)Google Scholar
- 12.Gelenbe, E.: G-Networks with signals and batch removal. Probability in the Engineering and Informational Sciences 7, 335–342 (1993)Google Scholar