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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kohler, E., Morris, R., Chen, B., Jannotti, J., Kaashoek, M.F.: The Click Modular Router. ACM Transactions on Computer Systems 18(3), 263–297 (2000)
Peterson, L., Karlin, S., Li, K.: OS Support for General-Purpose Routers. In: Proceedings of the 7th Workshop on Hot Topcs in Operating Systems (March 1999)
Decasper, D., Dittia, Z., Parulkar, G., Plattner, B.: Router Plugins: A Software Architecture for Next Generation Routers. IEEE/ACM Transcations on Networking 8(1), 2–15 (2000)
Gottlieb, Y., Peterson, L.: A Comparative Study of Extensible Routers. In: Proceedings of OpenArch 2002 (June 2002)
Karlin, S.C.: Embedded Computational Elements in Extensible Routers. PhD thesis, Department of Computer Science, Princeton University (January 2003)
Taylor, D., Parwatikar, J., Spitznagel, E., Turner, J., Wong, K.: Design of a High Performance Dynamically Extensible Router. In: DARPA Active Networks Conference and Exposition (May 2002)
Pappu, P., Wolf, T.: Scheduling Processing Resources in Programmable Routers. In: Proceedings of IEEE INFOCOM 2002 (June 2002)
Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of fair queuing. J. Internetworking Res Experience 1(10), 3–26 (1990)
Bennett, J., Zhang, H.: WF2Q: worst-case Fair Queuing Algorithms. In: IEEE INFOCOM 1996 (June 1996)
Goyal, P., Vin, H.M., Cheng, H.: Start-time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks. In: Proceeding of ACM SIGCOMM, pp. 157–168. ACM, New York (August 1996)
Suili, F., Wu, Y., Ravi, S., Feng, K.: A Novel Packet Scheduling Algorithm without Timestamp. Journal of China Institute of Communication 7, 27–32 (2002)
Qie, X., Bavier, A., Peterson, L., Karlin, S.: Scheduling Computations on a Software-Based Router. In: Proceedings of SIGMETRICS 2001 (June 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, T. (2004). CPU Schedule in Programmable Routers: Virtual Service Queuing with Feedback Algorithm. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-24680-0_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21993-4
Online ISBN: 978-3-540-24680-0
eBook Packages: Springer Book Archive