Steady-state analysis of the single vacation PH/MSP/1/ queue using roots
From MaRDI portal
Publication:4643400
Abstract: We consider an infinite-buffer single-server queue where inter-arrival times are phase-type (), the service is provided according to Markovian service process , and the server may take single, exponentially distributed vacations when the queue is empty. The proposed analysis is based on roots of the associated characteristic equation of the vector-generating function (VGF) of system-length distribution at a pre-arrival epoch. Also, we obtain the steady-state system-length distribution at an arbitrary epoch along with some important performance measures such as the mean number of customers in the system and the mean system sojourn time of a customer. Later, we have established heavy- and light-traffic approximations as well as an approximation for the tail probabilities at pre-arrival epoch based on one root of the characteristic equation. At the end, we present numerical results in the form of tables to show the effect of model parameters on the performance measures.
Recommendations
- scientific article; zbMATH DE number 7233626
- The M/M/1 queue with single T-SPH vacations
- scientific article; zbMATH DE number 562286
- On a single server queue with optional phase type server vacations based on exhaustive deterministic service and a single vacation policy.
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
This page was built for publication: Steady-state analysis of the single vacation \(\mathrm{PH}/\mathrm{MSP}/1/\infty\) queue using roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4643400)
