Data Flows Routing in Multiservice Networks Based on Quality of Service Requirements
Abstract
The article deals with the problem of data flows routing in multiservice networks. It is shown, that using of different values of the weight and cost coefficients allows to realize the multi-criteria search for the optimum route taking into account the limitations for each QoS-setting individually as well as with the composite metric r requirements for the shortest path searching.
About the Authors
N. I. Listopad
Белорусский государственный университет информатики и радиоэлектроники,
Belarus
Belarus
L. O. Bouka
Белорусский государственный университет информатики и радиоэлектроники,
Belarus
Belarus
References
1. Н.И. Листопад, Ю.И. Воротницкий, А.А. Хайдер Оптимальная маршрутизация в мультисервисных сетях телекоммуникаций на основе модифицированного алгоритма Дейкстры // Вестник БГУ. – Сер. 1. – 2015. – № 1 – С.70-76.
Review
For citations:
Listopad N.I., Bouka L.O. Data Flows Routing in Multiservice Networks Based on Quality of Service Requirements. Informatization of Education. 2016;(2):33-40. (In Russ.)
Views: 2897
Email this article 