METHOD OF DEFINITION OF PROBABILITY-TIME CHARACTERISTICS OF LAYER OF SERVICES AND APPLICATIONS SERVERS OF IMS
Keywords:IMS, probability-time characteristics, layer of services and applications servers, approaches of the queuing theory, tensor analysis, types of services.
AbstractContext. Article is devoted to development of a method of definition of probability-time characteristics of layer of services and
applications servers of IMS. It is shown that constantly growing a variety of services which IMS, and increase in demand for them
among users is capable to provide and also the fact that with development of telecommunications the increasing attention is paid to
quality of providing services – QoS, the problem of assessment of quality of providing services causes relevance of development of a
method of definition of probability-time characteristics of layer of services and applications servers of IMS.
Objective. Develop a method of definition of probability-time characteristics of layer of services and applications servers of IMS
taking into account different types of services which IMS is capable to provide.
Method. It is considered architecture of IMS. The main attention is paid to the layer of services and applications servers. For development
of a method of definition of probability-time characteristics of layer of services and applications servers of IMS it is offered
to use approaches of the queuing theory and the tensor analysis of networks. The offered method represents the sequence of
stages which execution allows to define structural blocks of layers of services and applications servers of IMS which are responsible
for providing services of different types; present call session control function and the layer of services and applications servers in the
form of separate laid on network – initial queuing network; for use of a planimetric method to enter the imagined branch which creates
the closed circuit; enter planimetric intensity and define their directions; define a transition matrix from initial network to primitive
network; present the invariant equation for initial network; define planimetric intensity and on their basis to calculate intensity of
receipt of requests for services and loadings of servers in initial network. As a result – to receive expressions for calculation of probability-
time characteristics of layer of services and applications servers.
Results. The method of definition of probability-time characteristics of layer of services and applications servers of IMS on the
basis of approaches of the queuing theory and tensor analysis of networks which allows to consider different types of services which
IMS is capable to provide is offered.
Conclusions. The method of definition of probability-time characteristics of layer of services and applications servers of IMS
will allow designers IMS to calculate probability-time characteristics at early stages of the project that will allow to define the necessary
network resources for ensuring required value of quality of providing services of different types. Further, at development of the
offered method, at a research of layer of services and applications servers of IMS for the purpose of definition of probability-time
characteristics accounting of self-similarity of a flow of requests for services and restrictions of a buffer memory of servers is reasonable.
Kniazieva N. O., Shestopalov S. V. Upravlinnia intelektualnymy servisamy v merezhakh nastupnoho pokolinnia.
Odesa, TOV Pluton, 2017, 268 p. ISBN 978-617-7424-78-8
Goldshteyn A. B., Goldshteyn B. S. Softswitch. SPb, BKhV, 2006, 368 p. ISBN 5-8206-0117-3
Khalid Al’Begain, Chitra Balakrishna, Luis Angel Galindo, David Moro IMS: A Development and Deployment Perspective.
John Wiley & Sons, 2009, 316 p. Print ISBN:9780470740347 | Online ISBN:9780470750001 | DOI:10.1002/9780470750001
Kleynrok L., Grushko I. I. Teoriya massovogo obsluzhivaniya:per. s angl. Moscow, Mashinostroyeniye, 1979, 432 p.
Ponomarev D. Yu. Programmnaya sistema dlya raspredeleniya nagruzki informatsionnyih sistem, Kibernetika i
programmirovanie, 2013, No. 5, pp. 29–36. DOI:10.7256/2306-4196.2013.5.9762
Zhang Y., Roughan M., Duffield N., Greenberg A. Fast Accurate Computation of Large-Scale IP Traffic Matrices
from Link Loads, ACM SIGMETRICS, 2003, pp. 206–217. DOI: 10.1145/781027.781053
Jiang Y., Liu Y. Stochastic Network Calculus. Springer-Verlag London Limited, 2008, 229 p. DOI: 10.1007/978-1-84800-127-5
Ephremides A. Limitations of Queueing Models in Communication Networks, Performance Limits in Communication
Theory and Practice, 1988, pp. 143–153. DOI: 10.1007/978-94-009-2794-0
Kron G. Tenzornyy analiz setey. Moscow, Sovetskoye radio, 1978, 720 p.
Lemeshko O., Yeremenko O. In Hu Z., Petoukhov S., Dychka I., He M. (eds) QoS Ensuring over Probability of
Timely Delivery in Multipath Routing, Advances in Computer Science for Engineering and Education. ICCSEEA
Advances in Intelligent Systems and Computting. Springer, Cham, 2019, Vol. 754, pp. 244–254. DOI:
Globalnaya informatsionnaya infrastruktura. as-pekty protokola internet i seti posleduyushchikh pokoleniy: MSE-T
Y.3001. [Deystvitelen ot 2011-05-20]. Zheneva, Study Group, 2012, 26 p.
Internet protocol data communication service – IP packet transfer and availability performance parameters: ITU-T
Recommendation Y.1540. [Effective from 2016-07-29], Geneva, Study Group, 2016, 51 p.
Quality of telecommunication services: concepts, models, objectives and dependability planning – Terms and definitions,
related to Quality of Services and network performance including dependability, ITU-R Recommendation
E.800. [Effective from 2008-09-29]. Geneva, Study Group, 2009, 30 p.
Aliyev T. I. Osnovy modelirovaniya diskretnykh sistem. SPb, SPbGU ITMO. 2009, 363 p. ISBN 978-5-7577-0336-7
Network Performance Objectives for IP-Based Services: ITU-T Recommendation Y.1541. [Effective from 2002-05-
. Geneva, Study Group, 2002, 50 p.
How to Cite
Copyright (c) 2020 N. O. Kniazieva, S. V. Shestopalov, O. I. Sirenko
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.