Open AccessBuilding Complex Schedules of Data Packets Processing with Setting Time Limits of a Conveyor System Functioning
Author(s) -
Кирилл Викторович Кротов
Publication year - 2020
Publication title -
trudy učebnyh zavedenij svâzi
Language(s) - English
Resource type - Journals
eISSN - 2712-8830
pISSN - 1813-324X
DOI - 10.31854/1813-324x-2020-6-3-75-90
Subject(s) - downtime , network packet , pipeline (software) , computer science , duration (music) , real time computing , limit (mathematics) , distributed computing , computer network , operating system , mathematics , art , mathematical analysis , literature
The problem of planning data packet processing in a pipeline system with a time limit on the duration of its operation intervals is considered. The solution of the problem involves determining the composition of data packets, the composition of groups of data packets processed during these time intervals, and the schedules for processing packets of each group. To optimize solutions, the hierarchical game theory is applied. Conditions have been introduced that allow you to determine packages that are processed or readjusted to processing, which causes maximum downtime of pipeline segments. A method for constructing effective group compositions is proposed, which involves excluding packages that are determined in accordance with these conditions and placing packages that are not included in them in groups.