Unreliable Queueing System with Threshold Strategy of the Backup Server Connection

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider an unreliable queuing system with an infinite buffer, the main unreliable server and absolutely reliable backup server. Customers arrive at the system according to a BMAP (Batch Markovian Arrival Process). Breakdowns arrive at the main server in accordance with a MAP (Markovian Arrival Process). After a breakdown occurs, the main server fails and its repairing immediately begins. If at that moment the number of customers in the system exceeds a certain specified number (threshold), then the backup server is connected to the service of the customer whose service was interrupted by the breakdown arrival. Otherwise, the customer returns to the queue. Service and repair times have PH (Phase type) distribution. The system can be used to model a hybrid communication system consisting of FSO - Free Space Optics channel and radio wave channel. We derive the condition for the stable operation of the system, calculate the stationary distribution and the main performance measures of the system. We consider the optimization problem of choosing the threshold value minimizing the economic criterion of the quality of system operation.

Cite

CITATION STYLE

APA

Klimenok, V., Kim, C., Vishnevsky, V. M., & Dudin, A. (2019). Unreliable Queueing System with Threshold Strategy of the Backup Server Connection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11965 LNCS, pp. 249–262). Springer. https://doi.org/10.1007/978-3-030-36614-8_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free