By Topic

Scheduling resources in programmable and active networks based on adaptive estimations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sabrina, F. ; Sch. of Comput. Sci. & Eng., New South Wales Univ., Sydney, NSW, Australia ; Sanjay Jha

In active and programmable networks, packet processing could be accomplished in the router within the data path. For efficient resource allocation in such networks, the packet scheduling schemes should consider multiple resources such as CPU and memory in addition to the bandwidth to improve overall performance. The inherent unpredictability of processing times of active packets poses a significant challenge in CPU scheduling. It has been identified that unlike bandwidth scheduling, prior estimation of CPU requirements of a packet is very difficult since it is platform dependent and it also depends on processing load at the time of execution and operating system scheduling etc. This paper presents an adaptive solution for estimating the processing requirements of active flows efficiently and accurately. The estimation process has been used in our composite scheduling algorithm called CBCSWFQ to estimate processing requirement. The performances of the estimation process for our composite scheduler have been analyzed through simulation works.

Published in:

Local Computer Networks, 2003. LCN '03. Proceedings. 28th Annual IEEE International Conference on

Date of Conference:

20-24 Oct. 2003