1. Introduction
The field of transient/non-stationary analysis has limited literature, which can be categorized into simulation, transient analysis, analysis, and applications techniques. These categories encompass various approaches to studying systems that change over time, including simulations, analysing transient behaviour, and exploring non-stationary phenomena. In certain cases, mathematical transformations can be used to obtain a closed form expression for analysing non-stationary queueing systems. However, evaluating these expressions can be computationally complex. As a result, there has been a focus on numerically determining the transient behaviour of such systems instead of deriving closed form expressions.
The current exposition contributes to solving for first time ever, the longstanding unsolved problem of obtaining the state variable of the time varying 𝑀/𝐷/1 queueing system.
The following flowchart shows how this paper is organized.
2. PSFFA
Let
and
serve as the temporal flow in, and fow out
respectively. Therefore,
links server utilization,
and the time-dependent mean service rate,
by:
For an infite queue waiting space:
The stable subcase of (2.4) (i.e.,
0), implies:
The numerical invertibility of
, yields
The
queueing system is made of Poisson arrival, one exponential (Poisson) server, FIFO (First-In-First-Out). Thus,
queueing system’s -
(c.f., [
1]) reads:
Therefore, the time varying
queueing system’s -PSFFA model reads:
TVQSs’ life example [
6] is depicted by Figure1.
3. Solving the Non-Stationary M/D/1 queueing System’s PSFFA (c,f., (2.9))
Figure 2 shows a new phenomenon to queuing theorist. The possibility that time will converge to a certain value for sufficiently large number in the time varying
queuing system. This is for an increasing temporal mean service rate.
This shows that as the time varying queuing system’s state variable becomes sufficiently large, time vanishes.
Numerical experiment Two
Figure 3 visualizes a new phenomenon to queuing theorist. The possibility that time will converge to a certain value for sufficiently large number in the time varying
queuing system. This is for a decreasing temporal mean service rate.
4. Closing Remarks with Next Phase of Research
In this work, a challenging topic in queueing theory is examined; more precisely, the underlying queue’s state variable is determined. The article offers a solution to this issue by utilizing a pointwise stationary fluid flow approximation (PSFFA) technique to formulate the non-stationary queueing system. Future work will concentrate on resolving open research issues and investigating applications of non-stationary queues in other scientific areas. The study also examines the effects of time, combined with and queueing parameters on the underlying queue’s stability dynamics.
References
- Zhao, X.; Wang, Y.; Li, L.; Delahaye, D. A queuing network model of a multi-airport system based on point-wise stationary approximation. Aerospace 2022, 9, 390. [Google Scholar] [CrossRef]
- Iversen, V.B. ITU Teletraffic Engineering Handbook; Technical University of Denmark: Kongens Lyngby, Denmark, 2021. [Google Scholar]
- Mageed, I.A.; Zhang, Q. Solving the open problem for GI/M/1 pointwise stationary fluid flow approximation model (PSFFA) of the non-stationary D/M/1 queueing system. Electron. J. Comput. Sci. Inf. Technol. 2023, 1, 1–6. [Google Scholar]
- A Mageed, D.I. Upper and Lower Bounds of the State Variable of M/G/1 PSFFA Model of the Non-Stationary M/Ek/1 Queueing System. Preprints 2024, 2024012243. [Google Scholar] [CrossRef]
- Hu, L.; Zhao, B.; Zhu, J.; Jiang, Y. Two time-varying and state-dependent fluid queuing models for traffic circulation systems. Eur. J. Oper. Res. 2019, 275, 997–1019. [Google Scholar] [CrossRef]
- Roubos, A.; Bhulai, S.; Koole, G. Flexible staffing for call centers with non-stationary arrival rates. Markov Decis. Process. Pract. 2017, 487–503. [Google Scholar]
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).