Scheduling processing resources in programmable routers

Proceedings - IEEE INFOCOM - Tập 1 - Trang 104-112 vol.1
P. Pappu1, T. Wolf1
1Department of Computer Science, Washington University, Saint Louis, MO, USA

Tóm tắt

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.

Từ khóa

#Processor scheduling #Scheduling algorithm #Bandwidth #Search engines #Quality of service #Delay estimation #Protocols #Admission control #Internet #Switches

Tài liệu tham khảo

10.1109/INFCOM.1997.635108 1996, Private Network-Network Interface Specification Version 1 0 10.1109/ISPASS.2000.842295 dehart, 0, The smart port card: An embedded UNIX processor architecture for network management and active networking 10.1145/238721.238766 bennett, 0, Hierarchial packet fair queuing algorithms, Proc of ACM SIGCOMM Palo Alto CA Aug 1996, 43 10.1109/90.664265 goyal, 0, Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks, Proc of ACM SIGCOMM Palo Alto CA Aug 1996 ACM, 157 bennett, 0, Worst case fair weighted fair queuing, Proc of IEEE INFOCOM 95 Boston MA Apr 1995, 120 golestani, 0, A self clocked fair queuing scheme for broad-band applications, Proc of IEEE INFOCOM 94 Toronto Canada June 1994, 636 10.1016/S1389-1286(02)00396-1 10.1145/505733.505735 10.1145/350391.350398 10.1109/35.568214 10.1145/383059.383074 parekh, 0, A generalized processor sharing approach to flow control: The single node case, Proc of IEEE INFOCOM 92 Florence Italy May 1992, 915 10.1145/378420.378425 2001, NodeOS interface specification decasper, 0, Router Plugins - A modular and extensible software framework for modern high performance integrated services routers, Proc of ACM SIGCOMM 98 Vancouver BC Sept 1998 10.1109/65.750445 10.1109/5.469298 10.1109/INFCOM.2001.916685