2013 Poster Sessions : pFabric: Minimalistic Near-Optimal Datacenter Transport

Student Name : Yan Michalevsky
Advisor : Sachin Katti
Research Areas: Information Systems
pFabric, a minimalistic datacenter fabric design that provides near-optimal performance in terms of completion time for high-priority flows and overall network utilization, was proposed recently by Alizadeh et al. pFabric’s design eliminates nearly all buffering on switches (switches have only ∼20KB of buffering per port), requires almost no congestion control and uses only simple mechanisms at each switch.
Specifically, switches are only required to locally and greedily decide what packets to schedule and drop according to priorities in the packet header and do not maintain any flow state or rate estimates. Rate-control is almost unnecessary, all flows start at line-rate and only slow down in the extreme case of congestion collapse. We aim at a 10G hardware implementation of pFabric using the NetFPGA platform and integration with an actual datacenter network, proving pFabric's advantages over existing packet scheduling schemes.

Yan Michalevsky is a first-year PhD student at the Department of Electrical Engineering in Stanford University. His research interests lie in networking, signal processing and security. He got his B.Sc in Electrical Engineering from the Technion Israel Institute of Technology in 2010. Prior to that Yan served in a technological unit in the IDF in the area of embedded systems development. Later on he served as a software team manager working in the areas of networking and operating system security and worked as a consultant for embedded systems development. His previous publications are in the areas of video compression, cloud security and signal processing. Recently he has been working with the Stanford Networked Systems Group (SNSG) on OpenRadio and pFabric projects.