Multistage Packet Processing in Nodes of Packet-Switched Computer Communication Networks
P. Świątek · Theoretical and Applied Informatics · 2007
In this paper the model of the multistage packet processing system is defined in terms of the control theory. Basing on the proposed model, problems of single and multistage packet scheduling are formulated. Moreover, the problem of coordination of local control (scheduling) algorithms in the multistage scheduling system is defined. Since formulated problems are NP-hard, optimal algorithms cannot be applied to the real-time traffic control. Instead, one can use on-line approaches, which approximate the optimal solution. Therefore, we show how to adapt existing single stage scheduling algorithms to the on-line version of the multistage packet scheduling problem. Finally, we give some remarks concerning the application of the artificial intelligence methods to the considered problem. The discussion is followed by the illustrative numerical example, which confirms the efficiency of proposed solutions.