IEEE Transactions on Parallel and Distributed Systems
Design, Analysis and Implementation of a Novel Multiple Resource Scheduler
IEEE Transactions on Computers
A novel resource scheduling algorithm for QoS-aware services on the Internet
Computers and Electrical Engineering
| Hi-index | 0.00 |
In active and programmable networks, packetprocessing could be accomplished in the router withinthe data path. For efficient resource allocation in suchnetworks, the packet scheduling schemes should considermultiple resources such as CPU and memory in additionto the bandwidth to improve overall performance. Theinherent unpredictability of processing times of activepackets poses a significant challenge in CPU scheduling.It has been identified that unlike bandwidth scheduling,prior estimation of CPU requirements of a packet is verydifficult since it is platform dependent and it alsodepends on processing load at the time of execution andoperating system scheduling etc. This paper presents anadaptive solution for estimating the processingrequirements of active flows efficiently and accurately.The estimation process has been used in our compositescheduling algorithm called CBCS WFQ to estimateprocessing requirement. The performances of theestimation process for our composite scheduler havebeen analyzed through simulation works.