OPTIMAL ROUTING INFORMATION FLOWS WITHIN THE PARAMETERS OF QOS

A classification of traffic in IP-based networks is described. The problem of traffic within the parameters of quality of service is formulated. The algorithms to maximize flow and minimize cost are reviewed. The algorithm of the problem of the «maximum minimum cost flow» is modificated so that woul...

Full description

Saved in:
Bibliographic Details
Main Authors: N. I. Listopad, I. O. Velichkevich
Format: Article
Language:Russian
Published: Educational institution «Belarusian State University of Informatics and Radioelectronics» 2019-06-01
Series:Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki
Subjects:
Online Access:https://doklady.bsuir.by/jour/article/view/55
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1839568059311849472
author N. I. Listopad
I. O. Velichkevich
author_facet N. I. Listopad
I. O. Velichkevich
author_sort N. I. Listopad
collection DOAJ
description A classification of traffic in IP-based networks is described. The problem of traffic within the parameters of quality of service is formulated. The algorithms to maximize flow and minimize cost are reviewed. The algorithm of the problem of the «maximum minimum cost flow» is modificated so that would be taken into account when choosing a path not only cost, but also the delay. Implementation of this algorithm in Java is developed. The program to test the algorithm with the ability to model the characteristics of the network is written.
format Article
id doaj-art-def0347ae6b841bdb0bb8e3ce92f3c20
institution Matheson Library
issn 1729-7648
language Russian
publishDate 2019-06-01
publisher Educational institution «Belarusian State University of Informatics and Radioelectronics»
record_format Article
series Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki
spelling doaj-art-def0347ae6b841bdb0bb8e3ce92f3c202025-08-04T17:38:11ZrusEducational institution «Belarusian State University of Informatics and Radioelectronics»Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki1729-76482019-06-010411111654OPTIMAL ROUTING INFORMATION FLOWS WITHIN THE PARAMETERS OF QOSN. I. Listopad0I. O. Velichkevich1Главный информационно-аналитический центр Министерства образования Республики БеларусьБелорусский государственный университет информатики и радиоэлектроникиA classification of traffic in IP-based networks is described. The problem of traffic within the parameters of quality of service is formulated. The algorithms to maximize flow and minimize cost are reviewed. The algorithm of the problem of the «maximum minimum cost flow» is modificated so that would be taken into account when choosing a path not only cost, but also the delay. Implementation of this algorithm in Java is developed. The program to test the algorithm with the ability to model the characteristics of the network is written.https://doklady.bsuir.by/jour/article/view/55обеспечение качества обслуживаниясети с коммутацией пакетовтрафикмаксимальный потокпропускная способность
spellingShingle N. I. Listopad
I. O. Velichkevich
OPTIMAL ROUTING INFORMATION FLOWS WITHIN THE PARAMETERS OF QOS
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki
обеспечение качества обслуживания
сети с коммутацией пакетов
трафик
максимальный поток
пропускная способность
title OPTIMAL ROUTING INFORMATION FLOWS WITHIN THE PARAMETERS OF QOS
title_full OPTIMAL ROUTING INFORMATION FLOWS WITHIN THE PARAMETERS OF QOS
title_fullStr OPTIMAL ROUTING INFORMATION FLOWS WITHIN THE PARAMETERS OF QOS
title_full_unstemmed OPTIMAL ROUTING INFORMATION FLOWS WITHIN THE PARAMETERS OF QOS
title_short OPTIMAL ROUTING INFORMATION FLOWS WITHIN THE PARAMETERS OF QOS
title_sort optimal routing information flows within the parameters of qos
topic обеспечение качества обслуживания
сети с коммутацией пакетов
трафик
максимальный поток
пропускная способность
url https://doklady.bsuir.by/jour/article/view/55
work_keys_str_mv AT nilistopad optimalroutinginformationflowswithintheparametersofqos
AT iovelichkevich optimalroutinginformationflowswithintheparametersofqos