The MAP/G/1 G‐Queue with Unreliable Server and Multiple Vacations

Abstract

In this paper, we consider a MAP/G/1 G‐queues with unreliable server and multiple vacations . The arrival of a negative customer not only removes the customer being in service, but also makes the server under repair. The server leaves for a vacation as soon as the system empties and is allowed to take repeated (multiple) vacations. By using the supplementary variables method and the censoring technique, we obtain the queue length distributions. We derive the mean of the busy period based on the renewal theory. Furthermore, we analyze some main reliability indexes and investigate some important special cases.

References

Vol. 43, No. 4 (2019)

Authors

  • Yi Peng

DOI:

https://doi.org/10.31449/inf.v43i4.3007

Downloads

Published

12/15/2019

Issue

Vol. 43 No. 4 (2019)

Section

Regular papers

License

Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.

All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.

Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.

How to Cite

The MAP/G/1 G‐Queue with Unreliable Server and Multiple Vacations. (2019). Informatica, 43(4). https://doi.org/10.31449/inf.v43i4.3007