Preview

Doklady BGUIR

Advanced search

OPTIMAL ROUTING INFORMATION FLOWS WITHIN THE PARAMETERS OF QOS

Abstract

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.

About the Authors

N. I. Listopad
Главный информационно-аналитический центр Министерства образования Республики Беларусь
Belarus


I. O. Velichkevich
Белорусский государственный университет информатики и радиоэлектроники
Belarus


References

1. Копачев А.Г. // Информатизация образования. 2004. №4. С. 69-74.

2. Cisco IOS Technologies. [Электронный ресурс] Режим доступа: http://www.cisco.com/en/US/technologies/tk543/tk766/technologies_white_paper09186a00800a3e2f_ps6610_Products_White_Paper.html.

3. Листопад Н.И., Величкевич И.О. // Вестнiк сувязi. 2009. №2. С. 17-23.

4. Трухан А.В. // Информатизация образования. 2007. №2. С. 65-71

5. Кормен T. Алгоритмы. Построение и анализ. Москва, 2005.


Review

For citations:


Listopad N.I., Velichkevich I.O. OPTIMAL ROUTING INFORMATION FLOWS WITHIN THE PARAMETERS OF QOS. Doklady BGUIR. 2012;(4):111-116. (In Russ.)

Views: 378


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 1729-7648 (Print)
ISSN 2708-0382 (Online)