The algorithms coordinating traffic in computer network

Authors

  • I. A. Zhukov National Aviation University
  • N. K. Pechurin National Aviation University
  • L. P. Kondratova National technical university of Ukraine "Kiev Polytechnic Institute"
  • S. N. Pechurin National Aviation University

DOI:

https://doi.org/10.18372/2073-4751.4.10333

Keywords:

unipolar flow, multipolar flow, flow with set value, maximum flow, model of linear programming, system of a linear algebraic equations

Abstract

In this article there is examined the possibility to bring to the stream algorithms for solving systems oflinear algebraic equations. A way to determine the allowable flow in a computer network on a base ofthe linear algebraic equations system provides a solution comparable to the result of a well-knownalgorithms to search minimum cost streams and maximum streams

Author Biographies

I. A. Zhukov, National Aviation University

doctor of science

N. K. Pechurin, National Aviation University

doctor of science

L. P. Kondratova, National technical university of Ukraine "Kiev Polytechnic Institute"

candidate of technical science

S. N. Pechurin, National Aviation University

candidate of technical science

References

Алгоритмы и программы решения задач на графах и сетях / М.И.Нечипуренко, В.К.Попков, С.М.Майнагашев и др.–Новосибирск: Наука. Сиб. отд-ние, 1990. – 515 с.

Филипс Д., Гарсиа-Диас А. Методы анализа сетей: Пер. с англ. – М.: Мир, 1984. – 496 с.

Marcon A.J. Flows in Networks: An Algorithmic Approach // Dissertation submitted in fulfillment for the degree of Master of Science in mathematics. – University of Johannesburg. – 2012.

Майника Э. Алгоритмы оптимизации на сетях и графах. – М.:Мир, 1981. – 323 с.

Новиков Ф.А. Дискретная математика для программистов: Учебник. – СПб: Питер, 2000. – 304 с.

Назарова И.А. Анализ переборных алгоритмов для задачи оценки уязвимости многопродуктовых сетей. – М.:ВЦ РАН, 2006. – 72 с.

Бахтин В.И., Коваленок А.П., Лебедев А.В., Лысенко Ю.В. Исследование операций. – Минск: БГУ, 2003. – 199 с.

Bozhenyuk A., Gerasimenko E., Rozenberg I. The Methods of Maximum Flow and Minimum Cost Flow Finding in Fuzzy Network. - http://ceur-ws.org/Vol-871/paper_1.pdf

Downloads

How to Cite

Zhukov, I. A., Pechurin, N. K., Kondratova, L. P., & Pechurin, S. N. (2015). The algorithms coordinating traffic in computer network. Problems of Informatization and Control, 4(52), 31–36. https://doi.org/10.18372/2073-4751.4.10333

Issue

Vol. 4 No. 52 (2015)

Section

Статті

License

The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.

All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.

Copyright

Authors who publish their works in the journal:

  • retain the copyright to their publications;

  • grant the journal the right of first publication of the article;

  • agree to the distribution of their materials under the CC BY 4.0 license;

  • have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.