Abstract
This study considers a network problem, for which we propose a new component in a network architecture called a scheduler. For each set of packets requested by a user, the scheduler solves a scheduling problem in assigning packets to routers. The related problem is NP-hard. We search to find some approximate solutions to solve the problem. This is because the optimal solution is based on the branch and bound method, which is generally characterized by a very high run time. In this study, we propose several heuristics, based essentially on multi-fit, a subset-sum problem, and dispatching rules. The efficiency of the heuristics is measured by using several indicators,including a comparison with a lower bound. The performance of the algorithms is represented in experimental results. As shown herein, in 100% of cases, the best heuristic value represents the optimal solution.