"JOURNAL OF RADIO ELECTRONICS" (Zhurnal Radioelektroniki ISSN 1684-1719, N 11, 2019

contents of issue      DOI  10.30898/1684-1719.2019.11.17    full text in Russian (pdf)  

Modeling the connection of network streams with different priority


V. M. Antonova 1,2,  A.D. Rebrova 1

1 Bauman Moscow State Technical University, 2-d Baumanskaya str., 5-1, Moscow 105005, Russia

2 Kotelnikov Institute of Radioengineering and Electronics of Russian Academy of Sciences, Mokhovaya str., 11-7, Moscow 125009, Russia


The paper is received on November 19, 2019


Abstract. The article proposes a method of switching two traffic flows with different priorities in the discipline of lossy service. It is based on the model of graph representation of the resource network, in which traffic is represented as an abstract fluid, carried by flows from top to top. One of the problems that can be considered on such a model is the problem of speed regulation on sections with different capacity, which leads to traffic losses in the system. In this article, the problem of separating flows between vertices with different degrees of reachability is solved by the leaky bucket algorithm, and the total losses in the system are taken as the target value, which must be reduced with the help of the proposed algorithm.

Keywords: flows on a network, leaky bucket algorithm.


1. Abdulrahman H. Potoki v resursnykh setyakh s nestandartnoy dostizhimost'yu [Flows in resource networks with non-standard accessibility]. PhD thesis. Rostov-on-Don, Southern Federal University. 2019. (In Russian)

2. Tanenbaum E. Komp'yuternyye seti [Computer networks]. Sankt-Petersburg. Piter Publ. 2003. 992 p. ISBN 5-318-00492-X (In Russian)

3. Abonentskiye seti dostupa i tekhnologii vysokoskorostnykh setey. Lektsiya 7: Upravleniye trafikom [Subscriber access networks and high-speed network technologies. Lecture 7: Traffic Management]. Online resource. National Open University INTUIT. URL http://struk.narod.ru/CNAT/cnat_7.html; https://www.intuit.ru/studies/courses/986/212/info (accessed 26.10.2019). (In Russian)

4.  Algoritmy dlya NP-trudnykh zadach. Lektsiya 5: Priblizhennyye algoritmy [Algorithms for NP-hard problems. Lecture 5: Approximate algorithms]. [online]. URL: https://logic.pdmi.ras.ru/seminars/logic-seminar/2018-09-06. Steklov Institute of Mathematics at St.-Petersburg.  (Accessed 26.10.2019). (In Russian)


For citation:

Antonova V.M., Rebrova A.D. Modeling the connection of network streams with different priority. Zhurnal Radioelektroniki - Journal of Radio Electronics. 2019. No. 11. Available at http://jre.cplire.ru/jre/nov19/17/text.pdf

DOI  10.30898/1684-1719.2019.11.17