CPU schedule in programmable routers: virtual service queuing with feedback algorithm

Abstract

Programmable routers extend the traditional store-and-forward paradigm to a store-process-and-forward paradigm. So how to schedule CPU between competing per-flow processing becomes a key problem. This paper generalizes the processing model of programmable routers and presents a CPU scheduling algorithm called Virtual Service Queuing with Feedback VSQF to schedule processing resource, which queues packets by the amount of virtual service of per-flow based on the estimation of execution time of a packet before processing and updates the amount of virtual service with actual execution time using feedback after processing. The simulation shows VSQF has good fairness. © Springer-Verlag 2004.