A Novel Model Based on Window-Pass Preferences for Data Emergency Aware Scheduling in Computer Networks

The breakdown of vital communication infrastructures is one of the most common characteristics of all disasters. It can cause severe communication problems such as time delays and data loss, which cause deterioration in system performance. New techniques are needed to cope with such situations, many of which have been made possible due to the ongoing evolution of artificial intelligence technologies. In this study, we consider the case of a network consisting of several router allocation problems in situations of high priority and emergency data allocation. A novel network component called the scheduler is introduced and window constraints for routers are imposed. To solve the studied problem, four different algorithms are developed in this work. These algorithms were then applied in a particular scenario consisting of several routers and 2200 instances. In terms of the gap and running time, the proposed algorithms provide acceptable results. The best performances were achieved using the critical packet algorithm for 80% of instances with an average gap value of 0.009 and an average time of 0.209 s.