Modeling of Complex Non-Full-Availability Systems

• Autorzy: Hanczewski Sławomir , Stasiak Maciej , Weissenberg Michał

Identyfikatory

DOI

10.26636/jtit.2020.143320

• Języki publikacji: EN

Abstrakty

EN

This article presents an analytical model of complex non-full-availability telecommunications systems. The high degree of accuracy of the model is demonstrated by a comparison with the results of simulation experiments. Due to the introduction of an availability parameter, this model may be used in the future for analyzing real systems, such as, for example, cloud computing infrastructure. This will be possible provided that the function combining the physical structure of the system and the availability parameter is specified. This problem will be addressed in our future work and will constitute the next stage of research undertaken by the authors.

Słowa kluczowe

EN

analytical model; availability; non-full availability systems

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2020
• Tom: nr 2
• Strony: 70--77
• Opis fizyczny: Bibliogr. 27 poz., rys.

Twórcy

autor

Hanczewski Sławomir

• Faculty of Computing and Telecommunications Poznan University of Technology Polanka 3 60-965 Poznan, Poland

autor

Stasiak Maciej

• Faculty of Computing and Telecommunications Poznan University of Technology Polanka 3 60-965 Poznan, Poland

autor

Weissenberg Michał

• Faculty of Computing and Telecommunications Poznan University of Technology Polanka 3 60-965 Poznan, Poland

Bibliografia

• [1] M. Głąbowski, S. Hanczewski, M. Stasiak, and J. Weissenberg, „Modeling Erlang's Ideal Grading with multi-rate BPP traffic", Mathem. Problems in Engin., vol. 2012, no. 2, 2012 (DOI: 10.1155/2012/456910).
• [2] A. Lotze, „History and development of grading theory", in Proc. 5th International Teletraffic Congress ITC5, New York, USA, 1967, pp. 148-161, 1967.
• [3] J. Kaufman, „Blocking with retrials in a completely shared resource environment", J. of Perform. Eval., vol. 15, no. 2, pp. 99-116, 1992 (DOI: 10.1016/0166-5316(92)90058-O).
• [4] M. Stasiak and M. Głąbowski, „A simple approximation of the link model with reservation by a one-dimensional Markov chain", Perform. Eval., vol. 41, no. 2-3, pp. 195-208, 2000 (DOI: 10.1016/S0166-5316(00)00008-0).
• [5] „Vmware and your cloud. Maximize IT Agility to Drive Business Agility", Tech. Rep., VMware, 2011 [Online]. Available: https://www.vmware.com/content/dam/digitalmarketing/vmware/en/ files/images/microsite/whiteboard/vmcloud.pdf
• [6] „Future of cloud computing", Tech. Rep., Google, 2018 [Online]. Available: https://services.google.com/fh/files/misc/ futurecloudcomputing.pdf
• [7] D. Kapil, P. Tyagi, S. Kumar, and V. P. Tamta, „Cloud computing: Overview and research issues", in Proc. Int. Conf. on Green Inform. ICGI 2017, Fuzhou, China, 2017, pp. 71-76 (DOI: 10.1109/ICGI.2017.18).
• [8] F. Shakeel and S. Sharma, „Green cloud computing: A review on efficiency of data centres and virtualization of servers", in Proc. Int. Conf. on Comput., Commun. and Autom. ICCCA 2017, Greater Noida, India, 2017, pp. 1264-1267 (DOI: 10.1109/CCAA.2017.8230012).
• [9] T. Bonald and J. Roberts, „Internet and the Erlang formula", ACM Comp. Commun. Rev., vol. 42, pp. 23-30, 2012 [Online]. Available: https://hal-imt.archives-ouvertes.fr/hal-00941783/PDF/BR11.pdf
• [10] G. Fodor, S. Racz, and M. Telek, „On providing blocking probability and throughput guarantees in a multi-service environment", Int. J. of Commun. Syst., vol. 15, no. 4, 257-285, 2002 (DOI: 10.1002/dac.532).
• [11] M. Głąbowski, A. Kaliszan, and M. Stasiak, „Modelling overow systems with distributed secondary resources", Comp. Networks, vol. 108, pp. 171-183, 2016 (DOI: 10.1016/j.comnet.2016.08.015).
• [12] S. Hanczewski, M. Stasiak, and J. Weissenberg, „Queueing model of a multi-service system with elastic and adaptive traffic", Comp. Networks, vol. 147, pp. 146-161, 2018 (DOI: 10.1016/j.comnet.2018.09.023).
• [13] I. D. Moscholios, J. S. Vardakas, M. D. Logothetis, and A. C. Boucouvalas, „Congestion probabilities in a batched Poisson multirate loss model supporting elastic and adaptive traffic", Annals of Telecommun., vol. 68, no. 5, pp. 327-344, 2013 (DOI: 10.1007/s12243-012-0326-7).
• [14] D. Parniewicz, M. Stasiak, J. Wiewióra, and P. Zwierzykowski, „An approximate model of the WCDMA interface servicing a mixture of multi-rate traffic streams with priorities", in Computer Performance Engineering. 5th European Performance Engineering Workshop, EPEW 2008, Palma de Mallorca, Spain, September 24-25, 2008, Proceedings, N. Thomas and C. Juiz, Eds., LNCS, vol. 5261, pp. 168-180. Berlin Heidelberg: Springer, 2008 (DOI: 10.1007/978-3-540-87412-6 13).
• [15] G. M. Stamatelos and V. N. Koukoulidis, „Reservation-based bandwidth allocation in a radio ATM network", IEEE/ACM Trans. on Network., vol. 5, no. 3, pp. 420-428, 1997 (DOI: 10.1109/90.611106).
• [16] M. Głąbowski, S. Hanczewski, and M. Stasiak, „Modelling load balancing mechanisms in self-optimising 4G mobile networks with elastic and adaptive traffic", IEICE Trans. on Commun., vol. E99.B, no. 8, pp. 1718-1726, 2016 (DOI: 10.1587/transcom.2015CCP0016).
• [17] M. Głąbowski, „Recurrent calculation of blocking probability in multiservice switching networks", in Proc. of Asia-Pacific Conf. on Commun., Busan, South Korea, 2006 (DOI: 10.1109/APCC.2006.255964).
• [18] M. Głąbowski, S. Hanczewski, and M. Stasiak, „Modelling of cellular networks with traffic overow", Mathem. Problems in Engin., vol. 2015, Article ID 286490, 2015 (DOI: 10.1155/2015/286490).
• [19] S. Hanczewski, M. Sobieraj, and M. D. Stasiak, „The direct method of effective availability for switching networks with multiservice traffic", IEICE Trans. on Commun., vol. E99-B, no. 6, pp. 1291-1301, 2016 (DOI: 10.1587/transcom.2015EUP0009).
• [20] M. Głąbowski, A. Kaliszan, and M. Stasiak, „Modeling product-form state-dependent systems with BPP traffic", Perform. Eval., vol. 67, no. 3, pp 174-197, 2010 (DOI: 10.1016/j.peva.2009.10.002).
• [21] V. Paxson and S. Floyd, „Wide area traffic: the failure of poisson modeling", IEEE/ACM Trans. on Network., vol. 3, no. 3, 226-244, 1995 (DOI: 10.1109/90.392383).
• [22] J. Roberts, V. Mocci, and I. Virtamo, Eds., “Broadband Network Teletraffic: Performance Evaluation and Design of Broadband Multiservice Networks”, Final Report of Action COST 242, LNCS, vol. 1155. Berlin: Springer, 1996 (ISBN: 978-3540618157).
• [23] S. Hanczewski and M.Weissenberg, „Concept of an analytical model for cloud computing infrastructure", in Proc. 11th Int. Symp. on Commun. Syst., Netw. & Digit. Sig. Process. CSNDSP 2018, Budapest, Hungary, 2018 (DOI: 10.1109/CSNDSP.2018.8471814).
• [24] F. Kelly, „Notes on effective bandwidth", in Stochastic Networks: Theory and Applications, F. P. Kelly, S. Zachary, and I. Ziedins, Eds. Clarendon Press, 1996 (ISBN: 978-0198523994).
• [25] M. Stasiak, „Blocking probability in a limited-availability group carrying mixture of different multichannel traffic streams", Annales des Telecommun.. vol. 48, no. 1-2, pp. 71-76, 1993 (DOI: 10.1007/BF03005233).
• [26] E. Brockmeyer, H. Halstrom, and A. Jensen, “The life and works of A. K. Erlang”. Acta polytechnica scandinavica. Mathematics and computing machinery series, no. 6. Danish Academy of Technical Sciences, 1960.
• [27] S. Hanczewski, M. Stasiak, and M. Weissenberg, „The analytical model of complex non-full-availability system", in Image Processing and Communications, M. Choraś and R. S. Choraś, Eds. AISC, vol. 1062, pp. 279-286. Springer, 2019 (DOI: 10.1007/978-3-030-31254-1 33).

Uwagi

Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2020).