Fair Queuing in Active and Programmable Networks

At present the Internet is being transformed to a sophisticated system where network researchers are exploring new ways to dynamically program network switches, routers to accelerate network innovation. This trend introduces the concept of Active and programmable networks. The goal is to simplify the deployment of network services, leading to networks that explicitly support the process of service creation and deployment. To use such technology safely and efficiently, individual nodes must provide mechanisms to enforce resource lim- its to the contending flows. In active and programmable networks, the packet scheduling schemes should consider multiple resources such as CPU and memory in addition to bandwidth to achieve overall fairness. Maintaining fairness of one resource allocation does not ensure the fair allocation of other resources automatically. The dynamic nature of network load, and the unpredictability of processing times of active packets pose another significant challenge in providing fairness guarantees between contending flows. This chapter presents a fair resource allocation mechanism for a programmable/active node.

[1]  Sanjay Jha,et al.  An Adaptive Resource Management Architecture for Active Networks , 2003, Telecommun. Syst..

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

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

[4]  David Wetherall,et al.  Introducing new Internet services: why and how , 1998, IEEE Netw..

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

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

[7]  John V. Guttag,et al.  ANTS: a toolkit for building and dynamically deploying network protocols , 1998, 1998 IEEE Open Architectures and Network Programming.

[8]  Stephen F. Bush,et al.  Predicting and controlling resource usage in a heterogeneous active network , 2001, Proceedings Third Annual International Workshop on Active Middleware Services.

[9]  Shueng-Han Gary Chan,et al.  Fair resource allocation in active networks , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[10]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[11]  Scott Shenker,et al.  Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[12]  Tilman Wolf,et al.  Scheduling processing resources in programmable routers , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.