Stochastic inequalities for retrial queues with vacations and constant retrial policy
✍ Scribed by Mohamed Boualem; Natalia Djellab; Djamil Aïssani
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 430 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper, we consider an M/G/1 retrial queue with vacations and we derive several stochastic comparison properties in the sense of strong stochastic ordering and convex ordering. The stochastic inequalities provide simple insensitive bounds for the stationary queue length distribution.
📜 SIMILAR VOLUMES
In this paper, we introduce a retrial queueing problem for wireless cellular networks applying the Fractional Guard Channel (FGC) admission control policy and propose a new algorithm to solve the retrial queue problem involving the FGC policy. A comparison between analytical and simulation results
An M/G/1 retrial G-queue with preemptive resume and feedback under N-policy vacation subject to the server breakdowns and repairs, is investigated in this paper. Arrivals of both positive customers and negative customers are two independent Poisson processes, and positive customers receive service i
We consider the M [x] /G/1 queueing system, in which the server operates N policy and a single vacation. As soon as the system becomes empty the server leaves for a vacation of random length V . When he returns from the vacation and the system size is greater than or equal to a threshold value N , h