Scheduling Resources in Programmable and Active Networks Based on Adaptive Estimations

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Fariza Sabrina Articles by Sanjay Jha

28th Annual IEEE International Conference on Local Computer Networks (LCN'03)

Bonn/K?nigswinter, Germany

October 20-October 24

ISBN: 0-7695-2037-5

	ASCII Text	x
	Fariza Sabrina, Sanjay Jha, "Scheduling Resources in Programmable and Active Networks Based on Adaptive Estimations," Local Computer Networks, Annual IEEE Conference on, pp. 2, 28th Annual IEEE International Conference on Local Computer Networks (LCN'03), 2003.

	BibTex	x
	@article{ 10.1109/LCN.2003.1243107, author = {Fariza Sabrina and Sanjay Jha}, title = {Scheduling Resources in Programmable and Active Networks Based on Adaptive Estimations}, journal ={Local Computer Networks, Annual IEEE Conference on}, volume = {0}, year = {2003}, issn = {0742-1303}, pages = {2}, doi = {http://doi.ieeecomputersociety.org/10.1109/LCN.2003.1243107}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Local Computer Networks, Annual IEEE Conference on TI - Scheduling Resources in Programmable and Active Networks Based on Adaptive Estimations SN - 0742-1303 SP EP A1 - Fariza Sabrina, A1 - Sanjay Jha, PY - 2003 KW - null VL - 0 JA - Local Computer Networks, Annual IEEE Conference on ER -

Fariza Sabrina, The University of New South Wales, Australia

Sanjay Jha, The University of New South Wales, Australia

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LCN.2003.1243107

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 CBCS WFQ to estimate processing requirement. The performances of the estimation process for our composite scheduler have been analyzed through simulation works.

Citation:

Fariza Sabrina, Sanjay Jha, "Scheduling Resources in Programmable and Active Networks Based on Adaptive Estimations," lcn, pp.2, 28th Annual IEEE International Conference on Local Computer Networks (LCN'03), 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.