A Single Server Queue With Limited Capacity And A Flexible Service Rate

The arrival process of the model under studies in this paper is Poisson with state-dependent parameters, and the service time distribution is negative exponential with state-dependent rate. If there are n customers in the system, then the arrival rate is , and the service rate is . When a customer finds a server free, they enter the service station immediately; if not, they enter a queue of size N (N>0). In the waiting line, the customer follows to the First Come, First Served policy. During the customer's service period, if they are satisfied with the service at any point during the service period, they will either continue with probability or leave the system with probability 1 - . At this point, the service rate becomes (0< ).The group transformed inverse of the infinitesimal generator has been used for the analysis of this model, which is defined using the infinitesimal generator matrix. We derive the steady-state probabilities analytically using the group generalized inverses. On the basis of the same, performance metrics are generated. Moreover, a few calculations are given.

Authors

Institutions

Publication Details

Journal
Louis Savenien Dupuis Journal of Multidisciplinary Research
Published
2024-12-31
DOI
https://doi.org/10.21839/lsdjmr.2024.v3.118
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Single Server Queue With Limited Capacity And A Flexible Service Rate

R. Vijayalakshmi, V. Hemalatha
Louis Savenien Dupuis Journal of Multidisciplinary Research
Advanced Queuing Theory Analysis
article

A Single Server Queue With Limited Capacity And A Flexible Service Rate

R. Vijayalakshmi, V. Hemalatha
article en

Abstract

The arrival process of the model under studies in this paper is Poisson with state-dependent parameters, and the service time distribution is negative exponential with state-dependent rate. If there are n customers in the system, then the arrival rate is , and the service rate is . When a customer finds a server free, they enter the service station immediately; if not, they enter a queue of size N (N>0). In the waiting line, the customer follows to the First Come, First Served policy. During the customer's service period, if they are satisfied with the service at any point during the service period, they will either continue with probability or leave the system with probability 1 - . At this point, the service rate becomes (0< ).The group transformed inverse of the infinitesimal generator has been used for the analysis of this model, which is defined using the infinitesimal generator matrix. We derive the steady-state probabilities analytically using the group generalized inverses. On the basis of the same, performance metrics are generated. Moreover, a few calculations are given.

Louis Savenien Dupuis Journal of Multidisciplinary Research
Immaculata University (US)
Openalex Percentile: Top 56%
Advanced Queuing Theory Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Single Server Queue With Limited Capacity And A Flexible Service Rate — R. Vijayalakshmi, V. Hemalatha · Louis Savenien Dupuis Journal of Multidisciplinary Research (2024) | TGRS Research Map | TGRS