Abstract
The paper considers a single-line retrial queueing (RQ) system with an unreliable server controlled by a adaptive random multiple access protocol. The study is carried out using the method of asymptotic analysis under conditions of heavy system load. In this paper, the main characteristics of the system were found.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Keywords
1 Introduction
Unreliable servers can be used in telecommunications, call centers and data networks. For example, faulty hardware or software can lead to network failures, loss of communications, interruptions in data transmission, or incorrect processing of information. Research into unreliable devices in such areas helps to identify the causes of failures and develop methods to prevent them.
RQ queuing system with unreliable server and adaptive random multiple access protocol is a system that combines elements of queuing, unreliable server and adaptive random multiple access protocols in a data network.
In such systems, a large number of customers or clients are served using unreliable devices that may be subject to failures or malfunctions. To ensure efficiency and reliability, such a system can be equipped with an adaptive random multiple access protocol, which provides mechanisms for optimizing the use of available resources and managing data transmission in the face of varying network load, interference, or frequent server failures.
Adaptive Random Multiple Access Protocol is a method of controlling access to a common data link that allows multiple devices to share available resources. It is a form of multiple access protocol that allows devices to compete for access to data communications.
Unlike static protocols, an adaptive random multiple access protocol can change its parameters depending on current network conditions such as load, collisions and delays. This allows you to optimize the use of the available data channel and significantly reduce the likelihood of collisions (a situation in which two or more devices try to transmit data at the same time, resulting in signal loss).
Many scientific works are devoted to the study of various models of data transmission networks and random multiple access protocols. There are various modifications of access protocols [1,2,3,4,5,6,7,8].
In papers [9,10,11,12], authors investigate models with adaptive access protocols. The papers [13,14,15,16,17,18,19,20] consider the study of queuing systems with a dynamic access protocol.
In this paper, we study a single-channel RQ system with an unreliable device controlled by an adaptive access protocol. The server is considered unreliable if it periodically fails and requires time to be restored. Which, accordingly, can lead to a decrease in the efficiency of the system and an increase in waiting time for service.
2 Description of the Mathematical Model
Let’s consider an RQ system with an adaptive access protocol, the input of which receives a simple flow of requests with parameter \(\lambda \). The time for servicing a customer by the server is distributed exponentially with the parameter \({{\mu }_{1}}\). We assume that the server is unreliable. An unreliable device can be in one of the following states: idle, busy or under repair. When a new customer arrives and the server is idle, then the servicing immediately begins.
If at this moment another customer arrives, and the device is busy, then the received customer goes into orbit and waits for the opportunity to occupy the device during the next attempt. After a random delay, a request with intensity \(\sigma =1/T(t)\) again tries to occupy the server for service, where T(t) is the state of the adapter at time t (see Fig. 1).
The working time is distributed exponentially with parameter \({{\gamma }_{1}}\), if server is idle and with parameter \({{\gamma }_{2}}\), if the server is busy. As soon as a breakdown occurs, the server is sent to repair and the servicing customer goes into the orbit. During repairing, all incoming customers go into the orbit. The recovery time is distributed exponentially with parameter \({{\mu }_{2}}\).
The goal of the research is to study such a system, as well as to determine its main characteristics and to find the throughput of the system and the stationary probability distribution of server states.
Let i(t) be the number of customers in the orbit at time t and \(k\left( t \right) \) determine the state of the server as follows:
The process of changing adapter states T(t) is defined as follows:
where \(\alpha >0, ~\beta >0\) are adapter parameters, the values of which are indicated.
If the device is idle, then T(t) decreases linearly with intensity \(\alpha \); if the device is busy, then T(t) does not change; if the device is under repair, then T(t) increases linearly with intensity \(\beta \).
3 The Method of Asymptotic Analysis
Let us denote
- the probability that at time t the server is in state k and i customers in the orbit.
The probability distribution \(P\left( k,\ i,\ T,\ t \right) \) satisfies the following system of equations:
Let us compose a system of Kolmogorov differential equations for the stationary probability distribution \(P\left( k,\ i,\ T \right) \):
Let us denote the partial characteristic functions
Functions \({H}_{k}({u}_{1},\ {u}_{2})\) have the following properties:
Using the Eq. (2) and the properties of characteristic functions from System (1) we obtain:
We introduce a parameter
that characterizes the system load, then we get
There are no exact analytical methods for solving the System (3), so we will find the main characteristics of the adaptive system.
Let’s study the System (3) under the condition of heavy load. Let us define the throughput S of an adaptive RQ system as the exact upper bound of system load values \(\rho \) for which there is a steady-state regime with \(\rho \uparrow S.\)
Let us denote
Assuming that \(\varepsilon \rightarrow 0\) in the System (2), we will perform the following substitutions:
Then, we obtain:
Theorem 1
The values of the parameters S and y in the adaptive RQ-system are determined by the equalities
where \(\alpha >0, ~\beta >0\) are adapter parameters, the values of which are indicated.
Proof
Let us denote \(\underset{\varepsilon \rightarrow 0}{\mathop {\lim }}\,{{F}_{k}}({{w}_{1}},{{w}_{2}},\varepsilon )={{F}_{k}}({{w}_{1}},{{w}_{2}})\) and for \(\varepsilon \rightarrow 0\), we get
We will look for the solution \({{F}_{k}}({{w}_{1}},{{w}_{2}})\) of the System (5) in the form:
Assuming that the function \(\varphi (w)\) is equal to zero at infinity, we obtain
Then we rewrite the System (5):
Let us add a normalization condition to the System (7):
We obtain:
Then from the System (8) we find expressions for the stationary distribution of server states:
To find the values S and y, we sum up all the equations of the System (4) and for \(\varepsilon \rightarrow 0\), we obtain
Dividing resulting equation by \(\varepsilon \), we get:
Then using the Taylor expansion, we obtain:
Applying (6) to the equation, we get:
Let us write the equation in the form:
Then we rewrite the Eq. (9):
In order to turn the equation into an identity in \({{w}_{1}}\) and \({{w}_{2}}\), it is enough to require the following equalities:
By substituting \({{R}_{0}}(S,y)\), \({{R}_{1}}(S,y)\), \({{R}_{2}}(S,y)\) into the System (10), we get:
Definition. Throughput S is the upper limit of those load values \(\rho =\frac{\lambda }{{{\mu }_{1}}}\), for which there is the steady-state regime.
The inequality
determines the condition for the existence of a steady-state regime for the considered adaptive system.
So Theorem 1 is proved.
4 Numerical Example
We consider a system with parameters:
Table 1 shows the values of S and y for a given system for different \(\alpha \).
According to the data in Table 1, we can conclude that as \(\alpha \) increases, the value of throughput S increases, and the value of y also increases significantly.
For adaptive RQ systems, under the limiting condition of heavy system load, random processes i(t) and T(t) are linearly dependent with some parameter y equal to the ratio of linearly dependent random processes i(t)/T(t).
When \(\alpha =0,9\), the throughput of the adaptive RQ system \(S=0,334\) and \(y=2\), which corresponds to the throughput of the dynamic RQ system M/M/1 \(S=0,334\) at \(y=2\), which confirms the asymptotic equivalence of the adaptive and dynamic RQ systems with the simplest incoming flow of customers.
Consequently, adaptive RQ systems are asymptotically, under heavy load conditions, equivalent to dynamic RQ systems with the specified value of the parameter y, calculated in the work [21].
5 Conclusion
In this paper, we study the adaptive RQ-system M/M/1 with an unreliable server. The study was carried out using the method of asymptotic analysis under conditions of heavy system load. As a result, the main characteristics of the system, the stationary distribution of server states, and the throughput of the system under consideration are found.
References
Lyubina, T.V., Nazarov, A.A.: Research of dynamic and adaptive RQ-systems with an incoming MMPP flow of applications. Bull. Tomsk State Univ. Manage. Comput. Technol. Inform. 3(24), 104–112 (2013)
Ephremides, A.: Analysis of protocols of multiple access. In: Modelling and Performance Evaluation Methodology, pp. 563–575. Springer, Heidelberg (1984)
Nazarov, A.A., Tsoy, S.A.: A general approach to the analysis of Markov models of data communication networks controlled by static random multiple access protocols. Autom. Control. Comput. Sci. 38(4), 64–75 (2004)
Nazarov, A.A., Nikitina, M.A.: Application of Markov chain ergodicity conditions to the study of the existence of stationary regimes in communication networks. Autom. Control. Comput. Sci. 37(1), 50–55 (2003)
Gao, J., Rubin, I.: Analysis of a random-access protocol under long-range-dependent traffic. IEEE Trans. Veh. Technol. 52(3), 693–700 (2003)
Nazarov, A.A., Sudyko, E.A.: Method of asymptotic semiinvariants for studying a mathematical model of a random access network. Probl. Inf. Transm. 46(1), 86–102 (2010)
Nazarov, A.A.: Research of computer communication networks with random multiple access protocols. Bull. Tomsk State Univ. No. 271, 72–73 (2000)
Kuznetsov, D.Y., Nazarov, A.A.: Analysis of a communication network governed by an adaptive random multiple access protocol in critical load. Probl. Inf. Transm. 40(3), 243–253 (2004)
Kuznetsov, D.Y., Nazarov, A.A.: Investigation of communication networks with adaptive random multiple access protocol under heavy load conditions for an infinite number of nodes. Autom. Control. Comput. Sci. 37(3), 47–55 (2003)
Nazarov, A.A., Odyshev, Y.D.: Analysis of a communication network with the adaptive ALOHA protocol for a finite number of stations under overload. Problemy Peredachi Informatsii 36(3), 83–93 (2000)
Anyugu Francis Lin, B., Ye, X., Hao, S.: Adaptive protocol for full-duplex two-way systems with the buffer-aided relaying. IET Commun. 13(1), 54–58 (2019)
Lyubina, T.V., Nazarov, A.A.: Study of an adaptive RQ system with an incoming MMPP flow of customers using the method of asymptotic analysis. Information technologies and mathematical modeling (ITMM-2012): materials of the XI All-Russian scientific and practical conference with international participation (Anzhero-Sudzhensk, 23–24 November, 2012). Kemerovo: Practice, Part 2, pp. 94–99 (2013)
Shokhor, S.L.: Distribution of the number of messages in a communication network with channel reservation and a dynamic access protocol. Bull. Tomsk State Univ. 271, 67–69 (2000)
Lyubina, T.V., Nazarov, A.A.: Investigation of a Markovian dynamic RQ-system with conflicts of requests. Bulletin of the Tomsk State University. Management, computer technology and informatics 3(12), 73–84 (2010)
Nazarov A. A., Shokhor S. L.: Comparison of an asymptotic and prelimit model of a communication network with a dynamic protocol of random multiple access. In: Mathematical Modeling and Probability Theory, ed. I.A. Alexandrova and others, Tomsk: Peleng, pp. 233–241 (1988)
Gupur, G., Li, X.Z., Zhu, G.T.: The Application of C 0 -semigroup Theory to Dynamic Queueing Systems. Semigroup Forum 62, pp. 205–216 (2001). https://doi.org/10.1007/s002330010030
Ouyang H., Nelson B.L.: Simulation-based predictive analytics for dynamic queueing systems. 2017 Winter Simulation Conference (WSC), IEEE, pp. 1716–1727 (2017)
Mounce, R.: Existence of equilibrium in a continuous dynamic queueing model for traffic networks with responsive signal control. Transp. Traffic Theory 2009: Golden Jubilee, Springer, Boston, MA, pp. 327–344 (2009)
Filipiak, J.: Dynamic routing in a queueing system with a multiple service facility. Oper. Res. 32(5), 1163–1180 (1984)
Nazarov, A.A., Odyshev, Y.D.: Investigation of communications networks with dynamic synchronous ALOHA protocol under heavy load conditions. Avtomat. Vychisl. Tekhn. 35(1), 77–84 (2001)
Voronina, N.M., Rozhkova, S.V., Fedorova, E.A.: Research of Dynamic RQ System M/M/1 with unreliable server. In: Dudin, A., Nazarov, A., Moiseev, A. (eds.) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM 2022. Communications in Computer and Information Science, vol. 1803, pp. 212–224. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-32990-6_18
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Voronina, N.M., Rozhkova, S.V. (2024). Research of Adaptive RQ System M/M/1 with Unreliable Server. In: Dudin, A., Nazarov, A., Moiseev, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM WRQ 2023 2023. Communications in Computer and Information Science, vol 2163. Springer, Cham. https://doi.org/10.1007/978-3-031-65385-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-031-65385-8_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-65384-1
Online ISBN: 978-3-031-65385-8
eBook Packages: Computer ScienceComputer Science (R0)