University of Cambridge > Talks.cam > Computer Laboratory Systems Research Group Seminar > Systematic Rateless Coding for Efficient Data Transport in Data Centres

Systematic Rateless Coding for Efficient Data Transport in Data Centres

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Srinivasan Keshav.

The talk describes SCDP , a novel, general purpose data transport protocol for data centres that, in contrast to all other protocols proposed to date, natively supports one-to-many and many-to-one data communication, which is extremely common in modern data centres. SCDP does so without compromising on efficiency for short and long unicast flows. SCDP achieves this by integrating RaptorQ codes with receiver-driven data transport, in-network packet trimming and Multi-Level Feedback Queuing (MLFQ); (1) RaptorQ codes enable efficient one-to-many and many-to-one data transport; (2) on top of RaptorQ codes, receiver-driven flow control, in combination with in-network packet trimming, enable efficient usage of network resources as well as multi-path transport and packet spraying for all transport modes. Incast and Outcast are eliminated; (3) the systematic nature of RaptorQ codes, in combination with MLFQ , enable fast, decoding-free completion of short flows. We extensively evaluate SCDP in a wide range of simulated scenarios with realistic data centre workloads. For one-to-many and many-to-one transport sessions, SCDP performs significantly better compared to NDP . For short and long unicast flows, SCDP performs equally well or better compared to NDP ”

Bio:

Mohammed Alasmar received his Ph.D from the Department of Informatics, University of Sussex, in October 2019. His research is about designing and implementing robust data transport in data centres, with a focus on distributed storage systems. Since November 2018, he has been working as a Network Engineer at MAVIS Broadcast Ltd in Brighton, UK.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity