Browsing by Author "Гордієнко, В. Ю."

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Алгоритми маршрутизації та якість обслуговування повідомлень мультисервісної мережі зв'язку
    (Видавництво Львівської політехніки, 2013) Ложковський, А. Г.; Куліш, Є. Б.; Гордієнко, В. Ю.
    This paper considers the options for combining routing algorithms in a single method for multiservice communication networks. For a comparative analysis of the quality of service communications multiservice communication network for various routing algorithms used the following input data: the dependence of the average number of packets from the input load of packages, the dependence of the average number of packets from the load generated by switched virtual circuits, the distribution function of packet service time in switching center, the average time and the distribution of packet delivery time given structure, the probability of loss applications for switching channels in a given network structure, bandwidth efficiency of edges, the number of computational operations to perform a rebuild operation, the total number of calculations required for the network operation of the algorithm routing over the period of observation. The first group of these results concerning the estimates of the number of packages in the middle of switching enabled the initial redistribution capacity of edges in the design of multiservice networks. The growth of the number of packets in the system depending on the crossing burden created by applications for switching virtual circuits or packet, in addition, defines the limit load value for a given quality of service. In this sense, the obvious advantages of systems with movable boundary between the regions of a frame allocated to applications for circuit switching and packet switching, as well as the use of digital speech interpolation. The second group of results can find applications of dynamic adaptive routing in comparison with the optimal streaming routing. Number of computational operations identified by analyzing all stages of computing routing algorithm and characterized using spent on the process of iteration time. For comparison, the order of evaluation examined the number of calculations for adaptive dynamic routing in the formation of routing matrix method for the relief packages and Probabilistic gaming applications for switching virtual circuits. Cited simulation results, the number and computation time for performing the process of forming a single optimal route routing several orders of magnitude greater than the formation routes for adaptive dynamic routing. This has been the case for selective formation of block matrices for applications for switching virtual circuits and applications for the packet, and the formation of block matrices with given redistribute bandwidth links between different types of traffic at the expense of moving the border between the regions of the frame. The numerical value of transaction routing methods and compared their performance time indicates that the optimal streaming algorithm that monitors bandwidth usage ribs and entire network as a whole rational use for long time periods between adjustments to the operation of his background adaptive dynamic routing. The time value adjustment and quality of service required characteristics should be taken into account in a comprehensive route selection criteria. Розглянуто можливі варіанти комплексування алгоритмів маршрутизації в межах єдиного методу для мультисервісної мережі зв’язку та здійснений порівняльний аналіз якості обслуговування повідомлень для різних алгоритмів маршрутизації.
  • Thumbnail Image
    Item
    Функція розподілу станів системи масового обслуговування та ймовірність відмов для моделі типу HM/D/m
    (Видавництво Львівської політехніки, 2010) Ложковський, А. Г.; Гордієнко, В. Ю.
    Запропоновано апроксимацію усіченим нормальним законом імовірнісної функції розподілу станів повнодоступної системи з втратами, яка обслуговує мультисервісний трафік з постійною тривалістю обслуговування вимог. На основі цієї апроксимації запропонована формула розрахунку ймовірності втрати вимоги. For the full-accessible lossy system with multi-services traffic flow and constant holding time the approximating of probability distribution function by the truncated Gauss law is offered. On the basis of the given approximating the account formula of loss probability of the request is offered.