3.8 Article

Batch arrival retrial G-queue with orbital search and non-persistent customers

Journal

JOURNAL OF INTERDISCIPLINARY MATHEMATICS
Volume 19, Issue 1, Pages 95-109

Publisher

TARU PUBLICATIONS
DOI: 10.1080/09720502.2015.1113673

Keywords

Batch arrivals; G-queues; Retrial queues; Orbital search; Non-persistent

Categories

Funding

  1. CPSF [2015M572327]
  2. NSFC [71131003, 71371075]
  3. NSFA [KJ2013B162, KJ2013B165, KJ2014A174]
  4. Chaohu University Scientific Research Fund

Ask authors/readers for more resources

An M-X/G/1 retrial G-queue with orbital search and unreliable server is investigated in this paper. Arrivals of positive customers form a compound Poisson process, and one of the positive customers receives service immediately if the server is free upon their arrivals and others may enter a retrial orbit and try their luck after a random time interval. Arrival of negative customer removes the positive customer being in service from the system and causes the server breakdown. After a completion of a service or a repair, the server searches for the customers in the orbit or remains idle. By using the supplementary variables method, we obtain the steady-state solutions for the system measures. The effects of various parameters on the system performance are analyzed numerically.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available