Millions of little minions
Authors:
Open Access
- 17 August 2014
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 44 (4) , 3-14
Abstract
This paper presents a practical approach to rapidly introducing new dataplane functionality into networks: End-hosts embed tiny programs into packets to actively query and manipulate a network's internal state. We show how this "tiny packet program" (TPP) interface gives end-hosts unprecedented visibility into network behavior, enabling them to work with the network to achieve a desired functionality. Our design leverages what each component does best: (a) switches forward and execute tiny packet programs (at most 5~instructions) in-band at line rate, and (b) end-hosts perform arbitrary (and easily updated) computation on network state. By implementing three different research proposals, we show that TPPs are useful. Using a hardware prototype on a NetFPGA, we show our design is feasible at a reasonable cost.Keywords
Funding Information
- Division of Computer and Network Systems (CNS-1040190)
This publication has 19 references indexed in Scilit:
- Forwarding metamorphosis2013
- B42013
- FCP2013
- Reproducible network experiments using container-based emulation2012
- Abstractions for network update2012
- Stability and fairness of explicit congestion control with small buffersACM SIGCOMM Computer Communication Review, 2008
- OpenFlowACM SIGCOMM Computer Communication Review, 2008
- Why flow-completion time is the right metric for congestion controlACM SIGCOMM Computer Communication Review, 2006
- Design issues for high-performance active routersIEEE Journal on Selected Areas in Communications, 2001
- The click modular routerACM Transactions on Computer Systems, 2000