Знаходження максимального зваженого потоку в комп’ютерних мережах нового покоління

• Дата: 2017
• Автори: Zaychenko, E. Yu., Zaychenko, Yuriy P., Ghamish, Ovi Nafas Aghaei agh
• Формат: Стаття
• Мова: rus
• Опубліковано: The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" 2017
• Теми: new generation networks; Maximal weighted flow; optimality conditions; QoS; максимальный взвешенный поток; условия оптимальности; показатели качества обслуживания; максимальний зважений потік; умови оптимальності; показники якості
• Онлайн доступ: http://journal.iasa.kpi.ua/article/view/119450
• Назва журналу: System research and information technologies

The problem of finding maximal weighted flow (MWF) in new generation networks is considered. The principal differences of the considered problem from the classical one constitute therein that several classes of flows are transmitted in a network and non-linear constraints on Quality of Service (QoS) are introduced. The theorem about properties of a maximal weighted flow is proved and optimality conditions for a maximal weighted flow under constraints on QoS obtained. The algorithm of finding MWF under constraints on QoS for different classes of flows is developed. The algorithm may be applied for survivability estimation in communication networks with perspective technologies.