M/M/1/N Queues with Energy Enabled Service and General Vacation Times

We consider the performance analysis of an M/M/1/N queueing system where the server consumes energy from a battery during the service of customers. The energy supply of the battery depends on a randomly changing environment. When the battery gets empty, the server goes on vacation for a random amount of time. We model the energy level of the battery as the fluid in an infinite fluid buffer and the environment as a continuous-time Markov chain (CTMC). The analytical framework resembles the one used in fluid vacation models with exhaustive discipline, but the properties of the considered queueing model require the extension of the available methodology, because the model evolution is different during the service and the vacation period due to the inactivity of the server during vacation. Essentially, new results are derived to cope with the general properties of the considered model. Consequently, the results in this article extend the analysis of fluid vacation models to a more general class than the fluid vacation models with exhaustive discipline. The steady-state vector density of the fluid level, its Laplace transform, and the mean fluid level are derived together with the probability mass function of the queue size. A special case of the model with phase-type (PH)-distributed vacation time is also analyzed.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Modeling and Performance Evaluation of Computing Systems
Published
2025-06-06
DOI
https://doi.org/10.1145/3743129
Citations
2
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
4.57
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

M/M/1/N Queues with Energy Enabled Service and General Vacation Times

T. G. Deepak, Miklós Telek, Anand Nikhil
2 citations
ACM Transactions on Modeling and Performance Evaluation of Computing Systems
Advanced Queuing Theory Analysis
4.57
article

M/M/1/N Queues with Energy Enabled Service and General Vacation Times

T. G. Deepak, Miklós Telek, Anand Nikhil
article en
2 citations

Abstract

We consider the performance analysis of an M/M/1/N queueing system where the server consumes energy from a battery during the service of customers. The energy supply of the battery depends on a randomly changing environment. When the battery gets empty, the server goes on vacation for a random amount of time. We model the energy level of the battery as the fluid in an infinite fluid buffer and the environment as a continuous-time Markov chain (CTMC). The analytical framework resembles the one used in fluid vacation models with exhaustive discipline, but the properties of the considered queueing model require the extension of the available methodology, because the model evolution is different during the service and the vacation period due to the inactivity of the server during vacation. Essentially, new results are derived to cope with the general properties of the considered model. Consequently, the results in this article extend the analysis of fluid vacation models to a more general class than the fluid vacation models with exhaustive discipline. The steady-state vector density of the fluid level, its Laplace transform, and the mean fluid level are derived together with the probability mass function of the queue size. A special case of the model with phase-type (PH)-distributed vacation time is also analyzed.

ACM Transactions on Modeling and Performance Evaluation of Computing SystemsVol. 10(3)
Budapest University of Technology and Economics (HU), Indian Institute of Space Science and Technology (IN)
Openalex Percentile: Top 6%
Advanced Queuing Theory Analysis
4.57
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.