• Publications
  • Influence
Efficient fair queueing using deficit round-robin
TLDR
We describe a new approximation of fair queuing that achieves nearly perfect fairness in terms of throughput, requires only O(1) work to process a packet, and is simple enough to implement in hardware. Expand
  • 999
  • 107
Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN
TLDR
We propose the RMT (reconfigurable match tables) model, a new RISC-inspired pipelined architecture for switching chips, and we identify the essential minimal set of action primitives to specify how headers are processed in hardware. Expand
  • 636
  • 104
  • PDF
Header Space Analysis: Static Checking for Networks
TLDR
We developed a general and protocol-agnostic framework, called Header Space Analysis (HSA). Expand
  • 636
  • 93
  • PDF
Efficient Fair Queuing Using Deficit Round -
Fair queubsg is a teebnique that allows each flow passing through a network device to have a fair share of network reaoumea. Previous schemes for fair qsseaing that achieved nearlv perfect fairnessExpand
  • 513
  • 92
  • PDF
P4: programming protocol-independent packet processors
TLDR
P4 is a high-level language for programming protocol-independent packet processors. Expand
  • 1,139
  • 79
  • PDF
Efficient fair queueing using deficit round robin
TLDR
We describe a new approximation of fair queuing that achieves nearly perfect fairness in terms of throughput, requires only O(1) work to process a packet, and is simple enough to implement in hardware. Expand
  • 910
  • 78
  • PDF
Packet classification using multidimensional cutting
This paper introduces a classification algorithm called phHyperCuts. Like the previously best known algorithm, HiCuts, HyperCuts is based on a decision tree structure. Unlike HiCuts, however, inExpand
  • 521
  • 77
  • PDF
Real Time Network Policy Checking Using Header Space Analysis
TLDR
This paper introduces a real time policy checking tool called NetPlumber based on Header Space Analysis (HSA) that incrementally checks for compliance of state changes. Expand
  • 445
  • 57
  • PDF
CONGA: distributed congestion-aware load balancing for datacenters
TLDR
We present the design, implementation, and evaluation of CONGA, a network-based distributed congestion-aware load balancing mechanism for datacenters. Expand
  • 265
  • 55
Fast and scalable layer four switching
TLDR
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header fields of the packet such as source address, TCP and UDP port numbers. Expand
  • 516
  • 54
  • PDF