• Publications
  • Influence
OpenFlow: enabling innovation in campus networks
This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day. OpenFlow is based on an Ethernet switch, with an internal flow-table, and aExpand
  • 7,336
  • 1067
A network in a laptop: rapid prototyping for software-defined networks
Mininet is a system for rapidly prototyping large networks on the constrained resources of a single laptop. The lightweight approach of using OS-level virtualization features, including processes andExpand
  • 1,539
  • 235
NOX: towards an operating system for networks
As anyone who has operated a large network can attest, enterprise networks are difficult to manage. That they have remained so despite significant commercial and academic efforts suggests the needExpand
  • 1,446
  • 182
The iSLIP scheduling algorithm for input-queued switches
An increasing number of high performance internetworking protocol routers, LAN and asynchronous transfer mode (ATM) switches use a switched backplane based on a crossbar switch. Most often, theseExpand
  • 1,166
  • 114
ElasticTree: Saving Energy in Data Center Networks
Networks are a shared resource connecting critical IT infrastructure, and the general practice is to always leave them on. Yet, meaningful energy savings can result from improving a network's abilityExpand
  • 940
  • 107
Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN
In Software Defined Networking (SDN) the control plane is physically separate from the forwarding plane. Control software programs the forwarding plane (e.g., switches and routers) using an openExpand
  • 596
  • 96
Header Space Analysis: Static Checking for Networks
Today's networks typically carry or deploy dozens of protocols and mechanisms simultaneously such as MPLS, NAT, ACLs and route redistribution. Even when individual protocols function correctly,Expand
  • 615
  • 90
pFabric: minimal near-optimal datacenter transport
In this paper we present pFabric, a minimalistic datacenter transport design that provides near theoretically optimal flow completion times even at the 99th percentile for short flows, while stillExpand
  • 501
  • 89
A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch
It is well known that head-of-line blocking limits the throughput of an input-queued switch with first-in-first-out (FIFO) queues. Under certain conditions, the throughput can be shown to be limitedExpand
  • 933
  • 85
Packet classification on multiple fields
Routers classify packets to determine which flow they belong to, and to decide what service they should receive. Classification may, in general, be based on an arbitrary number of fields in theExpand
  • 686
  • 79