CPU Resource Scheduling in Programmable Networks

CPU Resource Scheduling in Programmable Networks (2003)

by Fariza Sabrina , Sanjay Jha

Citations:

2 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	CPU Resource Scheduling in Programmable Networks	SVM HeaderParse 0.1
AUTHOR NAME	Fariza Sabrina	user correction - Legacy Corrections
AUTHOR NAME	Sanjay Jha	user correction - Legacy Corrections
ABSTRACT	Programmable network paradigm allows packet processing in the routers within the data path. One of the key problems in programmable networks is the inability to determine execution times of packets from information in headers for scheduling which is in contrast to using packet length in transport resources scheduling. This paper presents a scheduling algorithm called Prediction based Fair Queueing (PBFQ) which uses prediction algorithm to estimate CPU requirements of packet and according to that it then schedules the CPU resource adaptively, fairly and efficiently among all the competing flows. The effectiveness of this algorithm is shown through simulation work.	user correction - Legacy Corrections
YEAR	2003	user correction - Legacy Corrections
CITATIONS	7 found	ParsCit 1.0