Abstract
We consider multichannel systems and open queueing networks with unreliable elements: nodes, paths between nodes, and channels at nodes. Computation of limiting distributions in a product form for these models is based on choosing recovery schemes for unreliable elements (independent recovery, recovery at a single site, recovering network scheme), routing algorithms, and service disciplines. Thus, by introducing a certain control, we constructively relate queueing theory with reliability theory. Results of the paper can be transferred to closed networks almost without changes.
Similar content being viewed by others
References
Vishnevskii, V.M., Rebortovich, B.I., and Timokhova, T.A., Analysis of Structural Configurations of Multiprocessor Computing Centers for Automated Queueing Systems with Reliability Considerations, Avtomat. Telemekh., 1977, vol. 38, no. 9, pp. 169–176 [Automat. Remote Control (Engl. Transl.), 1978, vol. 38, no. 9, pp. 1411–1417].
Netes, V.A., Pareto Analysis Approach to Reliability Improvement, Proc. 2nd Int. Workshop on the Design of Reliable Communication Networks (DRCN 2000) “Reliable Networks for the Information Age,” Munich, Germany, Eberspächer, J., Ed., Munich: Herbert Utz, 2000, pp. 187–191.
Netes, V.A., Quality of Service in Communication Networks: A Review of ITU Recommendations, Seti i Sistemy Svyazi, 1999, no. 3, pp. 66–71.
Intven, H., Oliver, J., and Sepulveda, E., Telecommunication Regulation Handbook, Washington: World Bank, 2000.
Kakubava, R.V. and Khurodze, R.A., Probabilistic Analysis of the Downtime of a Duplicated System with Recovery and Switching, Avtomat. Telemekh., 2000, vol. 61, Part 1, no. 9, pp. 84–89 [Automat. Remote Control (Engl. Transl.), 2000, vol. 61, Part 1, no. 9, pp. 1489–1494].
Tsitsiashvili, G.Sh. and Osipova, M.A., Probability Distribution in Varying-Structure Queueing Networks, Probl. Peredachi Inf., 2006, vol. 42, no. 2, pp. 101–108 [Probl. Inf. Trans. (Engl. Transl.), 2006, vol. 42, no. 2, pp. 158–165].
Basharin, G.P. and Tolmachev, A.L., Queueing Network Theory and Its Applications to the Analysis of Information-Computing Networks, in Itogi Nauki Tekh. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., vol. 21, Moscow: VINITI, 1983, pp. 3–119.
Ivchenko, G.I., Kashtanov, V.A., and Kovalenko, I.N., Teoriya massovogo obsluzhivaniya (Queueing Theory), Moscow: Vyssh. Shkola, 1982.
Tsitsiashvili, G.Sh. and Osipova, M.A., New Product Theorems for Queueing Networks, Probl. Peredachi Inf., 2005, vol. 41, no. 2, pp. 111–122 [Probl. Inf. Trans. (Engl. Transl.), 2005, vol. 41, no. 2, pp. 171–181].
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © G.Sh. Tsitsiashvili, M.A. Osipova, 2008, published in Problemy Peredachi Informatsii, 2008, Vol. 44, No. 4, pp. 109–119.
Supported in part by the Russian Foundation for Basic Research, project no. 06-01-00063a, and the Far East Branch of the Russian Academy of Sciences, project no. 06-III-A-01-016.
Rights and permissions
About this article
Cite this article
Tsitsiashvili, G.S., Osipova, M.A. Limiting distributions in queueing networks with unreliable elements. Probl Inf Transm 44, 385–394 (2008). https://doi.org/10.1134/S0032946008040091
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946008040091