Optimization of power distribution of network channels based on Orlin's algorithm

Authors

  • E. V. Іvоhіn Taras Shevchenko National University of Kyiv
  • M. F. Makhno Taras Shevchenko National University of Kyiv
  • V. O. Shklyar Taras Shevchenko National University of Kyiv

DOI:

https://doi.org/10.17721/1812-5409.2021/1.7

Keywords:

communication channels, power distribution, optimization of transparency, flow algorithm

Abstract

The article proposes an algorithm for solving the problem of optimal distribution of the capacity of data transmission channels between providers and Internet users. A mathematical model of the problem of distribution of a limited homogeneous resource with transport-type constraints is formulated. A solution method based on Orlin's stream algorithm is considered. A practical application of the algorithm for solving a real distribution problem is proposed. The results of the capacity of the channels of the computer network are obtained with a perspective increase in the capacity of the connections represented by the intervals of the planned changes. An analysis of the solutions obtained with different number of switching servers was made, conclusions about the choice of the provider to meet the optimal information needs of users were made.

Pages of the article in the issue: 63 - 68

Language of the article: Ukrainian

Author Biographies

E. V. Іvоhіn, Taras Shevchenko National University of Kyiv

професор кафедри системного аналізу та теорії прийняття рішень, д.ф.-м.н., професор

M. F. Makhno, Taras Shevchenko National University of Kyiv

асистент кафедри системного аналізу та теорії прийняття рішень, к.т.н.

V. O. Shklyar, Taras Shevchenko National University of Kyiv

аспірант

References

Raskin L.G., Kirichenko I.O. Mnogo-indeksnyye zadachi lineynogo programmiro-vaniya. – M.: Radio i svyaz'. – 240 р.

Skhreyver A. Teoriya lineynogo i tselochislennogo programmirovaniya. – M.: Mir. – 360 p.

Prilutskiy M.Kh., Kartomin A.G. Potokovyye algoritmy raspredeleniya resursov v iyerarkhicheskikh sistemakh // Issledovano v Rossii. – 39. – P. 444-452.

Prilutskiy M.Kh., Afraymovich L.G. Raspredeleniye resursov v iyerarkhicheskikh sistemakh transportnogo tipa. Nizhniy Novgorod. – 80p.

Pentico D.W. Assignment problems: A golden anniversary survey // European Journal of Operational Research. – V. 176. – P.774-793.

Orlin J.B. A Faster strongly polynomial minimum cost flow algorithm // Operations research. – V. 41. – N 2. – P.338-350.

Kalitkin N.N. Chislennyye metody [Numerical methods]. – M.: Nauka. – 512p.

Ivokhin E.V., Adzhubey L.T. Pro rozv’yazok odniyeyi dvorivnevoyi modeli vyrobnycho-transportnoyi zadachi // Visnyk KNU imeni Tarasa Shevchenka. Ser. FMN. – 2014 – №3. – P.122-125.

No 1 (2021)

Downloads

Published

2021-06-16

How to Cite

Іvоhіn E. V., Makhno, M. F., & Shklyar, V. O. (2021). Optimization of power distribution of network channels based on Orlin’s algorithm. Bulletin of Taras Shevchenko National University of Kyiv. Physical and Mathematical Sciences, (1), 63–68. https://doi.org/10.17721/1812-5409.2021/1.7

Issue

No. 1 (2021)

Section

Computer Science and Informatics

License

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).