Abstract
In order to provide the required quality of service (QoS), in current data transmission networks, a mechanism is intensively used allowing the data flow access to the communication system and further to the network. For efficient flow management, the flow classes and the priorities corresponding to them are introduced. On the basis of the priorities, the resources of the communication system are allocated. In the present study, a problem is solved on the allocation and distribution of limited resources for the simultaneous arrival of two or more flows falling in the same priority class.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lipaev, V.V. and Yashkov, S.F., Effektivnost’ metodov organizatsii vychislitel’nogo protsessa v ASU (Efficiency of methods of the computational process management in an automated control system), Moscow: Statistika, 1975.
Kolin, K.K. and Lipaev, V.V., Proektirovanie algoritmov upravlyayushchikh TsVM (Algorithms design for controlling digital computers), Moscow: Sovetskoe radio, 1970.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © M. Kulikovs, E. Petersons, 2010, published in Avtomatika i Vychislitel’naya Tekhnika, 2010, No. 1, pp. 58–64.
About this article
Cite this article
Kulikovs, M., Petersons, E. Optimal dispatching of the flows falling in the same priority class. Aut. Conrol Comp. Sci. 44, 42–46 (2010). https://doi.org/10.3103/S0146411610010050
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411610010050