An M/G/1 Queue with Repeated Orbit While in Service

Orbit and retrial queues have been studied extensively in the literature. A key assumption in most of these works is that customers “go to orbit” when they are blocked upon arrival. However, real-life situations exist in which customers opt to go to orbit to efficiently use their orbit time rather than residing dormant at the service station while waiting for their service to be completed. This paper studies such a system, extending the scope of traditional orbit and retrial queues. We consider an M/G/1 queue where customers repeatedly go to orbit while their service remains in progress. That is, if a customer’s service is not completed by within a specified “patience time”, the customer goes to orbit for a random “orbit time”. When the customer orbits, the server continues rendering her/his service. If, on return, the service is already completed, the customer leaves the system. Otherwise, s/he waits for another patience time. This policy is repeated until service completion. We analyze such an intricate system by applying the supplementary variable technique and using Laplace–Stieltjes transforms. Performance measures are derived, and a comparison analysis is provided between various service time distributions.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2024-11-27
DOI
https://doi.org/10.3390/math12233722
Citations
1
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
0.53
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An M/G/1 Queue with Repeated Orbit While in Service

Uri Yechiali, Gabi Hanukov, Yonit Barron
1 citations
Mathematics
Advanced Queuing Theory Analysis
0.53
article

An M/G/1 Queue with Repeated Orbit While in Service

Uri Yechiali, Gabi Hanukov, Yonit Barron
article en
1 citations

Abstract

Orbit and retrial queues have been studied extensively in the literature. A key assumption in most of these works is that customers “go to orbit” when they are blocked upon arrival. However, real-life situations exist in which customers opt to go to orbit to efficiently use their orbit time rather than residing dormant at the service station while waiting for their service to be completed. This paper studies such a system, extending the scope of traditional orbit and retrial queues. We consider an M/G/1 queue where customers repeatedly go to orbit while their service remains in progress. That is, if a customer’s service is not completed by within a specified “patience time”, the customer goes to orbit for a random “orbit time”. When the customer orbits, the server continues rendering her/his service. If, on return, the service is already completed, the customer leaves the system. Otherwise, s/he waits for another patience time. This policy is repeated until service completion. We analyze such an intricate system by applying the supplementary variable technique and using Laplace–Stieltjes transforms. Performance measures are derived, and a comparison analysis is provided between various service time distributions.

MathematicsVol. 12(23)
Tel Aviv University (IL), Ariel University (IL)
Openalex Percentile: Top 24%
Advanced Queuing Theory Analysis
0.53
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.