Skip navigation
Please use this identifier to cite or link to this item: https://libeldoc.bsuir.by/handle/123456789/28089
Title: Многокритериальная маршрутизация информационных потоков
Authors: Листопад, Н. И.
Короткевич, А. В.
Михневич, С. Ю.
Хайдер, А. А.
Keywords: материалы конференций
многокритериальная маршрутизация
информационные потоки
Issue Date: 2017
Publisher: БГУИР
Citation: Многокритериальная маршрутизация информационных потоков / Н. И. Листопад и другие // BIG DATA and Advanced Analytics: collection of materials of the third international scientific and practical conference. (Minsk, Belarus, May 3 – 4, 2017) / editorial board : М. Batura [etc.]. – Minsk : BSUIR, 2017. – С. 278 - 281.
Abstract: Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to distribute the network. So an iterative algo- rithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions
URI: https://libeldoc.bsuir.by/handle/123456789/28089
Appears in Collections:BIG DATA and Advanced Analytics. Использование BIG DATA для оптимизации бизнеса и информационных технологий (2017)

Files in This Item:
File Description SizeFormat 
Listopad_Mnogokriterialnaya.PDF827,17 kBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.