• Publications
  • Influence
Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN
TLDR
The RMT (reconfigurable match tables) model is proposed, a new RISC-inspired pipelined architecture for switching chips, and the essential minimal set of action primitives to specify how headers are processed in hardware are identified.
Efficient fair queueing using deficit round-robin
TLDR
This paper describes 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.
CONGA: distributed congestion-aware load balancing for datacenters
TLDR
It is argued that datacenter fabric load balancing is best done in the network, and requires global schemes such as CONGA to handle asymmetry, and CONGA is nearly as effective as a centralized scheduler while being able to react to congestion in microseconds.
Header Space Analysis: Static Checking for Networks
TLDR
The goal is to automatically find an important class of failures, regardless of the protocols running, for both operational and experimental networks, with a general and protocol-agnostic framework, called Header Space Analysis (HSA).
P4: programming protocol-independent packet processors
TLDR
This paper proposes P4 as a strawman proposal for how OpenFlow should evolve in the future, and describes how to use P4 to configure a switch to add a new hierarchical label.
Efficient Fair Queuing Using Deficit Round -
TLDR
A new approximation of fair queuing, that is called deficit round-robin, that achieves nearly perfeet fairness in terms of throughput, requirea only 0(1) work to process a packe~ and is simple essougb to implement in hardware.
Efficient fair queueing using deficit round robin
TLDR
This paper describes 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.
Packet classification using multidimensional cutting
TLDR
This paper introduces a classification algorithm called phHyperCuts, which can provide an order of magnitude improvement over existing classification algorithms and can be fully pipelined to provide one classification result every packet arrival time, and also allows fast updates.
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), which incrementally checks for compliance of state changes, using a novel set of conceptual tools that maintain a dependency graph between rules.
Packet classification using tuple space search
TLDR
The Pruned Tuple Space search is the only scheme known to us that allows fast updates and fast search times, and an optimal algorithm is described, called Rectangle Search, for two-dimensional filters.
...
...