Scheduling processing resources in programmable routers

To provide flexibility in deploying new protocols and services, general-purpose processing engines are being placed in the datapath of routers. Such network processors are typically simple RISC multiprocessors that perform forwarding and custom application processing of packets. The inherent unpredictability of execution time of an arbitrary instruction code poses a significant challenge in providing QoS guarantees for data flows that compete for such processing resources in the network. However, we show that network processing workloads are highly regular and predictable. Using estimates of execution times of various applications on packets of given lengths, we provide a method for admission control and QoS scheduling of processing resources. We present a processor scheduling algorithm called estimation-based fair queuing (EFQ) which uses these estimates, and provides significantly better delay guarantees than processor scheduling algorithms which do not take packet execution times into consideration.

[1]  Kevin Mills,et al.  Expressing meaningful processing requirements among heterogeneous nodes in an active network , 2000, WOSP '00.

[2]  Jonathan S. Turner,et al.  Design of a gigabit ATM switch , 1997, Proceedings of INFOCOM '97.

[3]  Tilman Wolf,et al.  Configuring sessions in programmable networks , 2003, Comput. Networks.

[4]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[5]  NodeOS Interface Specification , 2001 .

[6]  Banu Özden,et al.  Fair queuing for aggregated multiple links , 2001, SIGCOMM.

[7]  Tilman Wolf,et al.  Configuring sessions in programmable networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  GoyalPawan,et al.  A hierarchial CPU scheduler for multimedia operating systems , 1996 .

[9]  Bernhard Plattner,et al.  A scalable high-performance active network node , 1999 .

[10]  D. Stiliadis,et al.  Rate-proportional servers: a design methodology for fair queueing algorithms , 1998, TNET.

[11]  William D. Richard,et al.  The Smart Port Card: An Embedded Unix Processor Architecture for Network Management and Active Networking , 2001 .

[12]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[13]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[14]  Bernhard Plattner,et al.  Router Plugins: A Modular and Extensible Software Framework for Modern High Performance Integrated Services Routers , 1998 .

[15]  Tilman Wolf,et al.  CommBench-a telecommunications benchmark for network processors , 2000, 2000 IEEE International Symposium on Performance Analysis of Systems and Software. ISPASS (Cat. No.00EX422).

[16]  Harrick M. Vin,et al.  A hierarchial CPU scheduler for multimedia operating systems , 1996, OSDI '96.

[17]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[18]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM 1996.

[19]  Scott Nettles,et al.  Practical programmable packets , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[20]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM '96.

[21]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[22]  G.J. Minden,et al.  A survey of active network research , 1997, IEEE Communications Magazine.

[23]  Larry L. Peterson,et al.  Scheduling computations on a software-based router , 2001, SIGMETRICS '01.

[24]  Hermann de Meer,et al.  A survey of programmable networks , 1999, CCRV.

[25]  Banu Ozden,et al.  Fair queuing for aggregated multiple links , 2001, SIGCOMM 2001.