short-paper

Free access

Polyraptor: Embracing Path and Data Redundancy in Data Centres for Efficient Data Transport

Authors:

Mohammed Alasmar,

George Parisis,

Jon CrowcroftAuthors Info & Claims

SIGCOMM '18: Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos

Pages 69 - 71

https://doi.org/10.1145/3234200.3234222

Published: 07 August 2018 Publication History

PDF eReader

Abstract

In this paper, we introduce Polyraptor, a novel data transport protocol that uses RaptorQ (RQ) codes and is tailored for one-to-many and many-to-one data transfer patterns, which are extremely common in modern data centres. Polyraptor builds on previous work on fountain coding-based transport and provides excellent performance, by exploiting native support for multicasting in data centres and data resilience provided by data replication.

References

[1]

C. Raiciu et al. 2011. Improving Datacenter Performance and Robustness with Multipath TCP. Proc. of SIGCOMM.

Digital Library

Google Scholar

[2]

D. Li et al. 2014. Reliable Multicast in data center networks. IEEE Transactions on Computers.

Digital Library

Google Scholar

[3]

G.Parisis et al. 2013. Trevi: Watering Down Storage Hotspots with Cool Fountain Codes. Proc. of HotNets.

Digital Library

Google Scholar

[4]

K. Rashmi et al. 2013. A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the facebook warehouse cluster. Proc. of USENIX.

Digital Library

Google Scholar

[5]

M.Luby et al. {n. d.}. RaptorQ Forward Error Correction Scheme for Object Delivery. IETF, RFC 6330, 2011.

Google Scholar

[6]

M. Handley et al. 2017. Re-architecting datacenter networks and stacks for low latency and high performance. Proc. of SIGCOMM.

Digital Library

Google Scholar

[7]

M. Kheirkhah et al. 2016. MMPTCP: A multipath transport protocol for data centers. Proc. of INFOCOM.

Digital Library

Google Scholar

[8]

P. Cheng et al. 2014. Catch the Whole Lot in an Action: Rapid Precise Packet Loss Notification in Data Center. Proc. of USENIX.

Digital Library

Google Scholar

[9]

S. Ghemawat et al. 2003. The Google File System. SOSP.

Digital Library

Google Scholar

Cited By

View all

Yin CXu ZLi WLi TYuan SLiu Y(2023)Erasure Codes for Cold Data in Distributed Storage SystemsApplied Sciences10.3390/app1304217013:4(2170)Online publication date: 8-Feb-2023
https://doi.org/10.3390/app13042170
Wang JDing WHe MHu JXiong N(2023)Reducing tail latency with coding-based packet spraying in edge datacentersJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2022.102783134:COnline publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1016/j.sysarc.2022.102783
Alasmar MParisis GCrowcroft J(2021)SCDP: Systematic Rateless Coding for Efficient Data Transport in Data CentersIEEE/ACM Transactions on Networking10.1109/TNET.2021.309838629:6(2723-2736)Online publication date: 15-Dec-2021
https://dl.acm.org/doi/10.1109/TNET.2021.3098386
Show More Cited By

Index Terms

Polyraptor: Embracing Path and Data Redundancy in Data Centres for Efficient Data Transport
1. Networks

Recommendations

Sliding Window-Based Erasure Correction Using Biased Sampling
ICSNC '09: Proceedings of the 2009 Fourth International Conference on Systems and Networks Communications

We study a packet erasure correction method based on biased sampling in asliding window. This kind of coding works especially well for streamingdata, where the data have real-time requirements and expire after sometime.The coding method resembles ...
Fountain-inspired erasure coding for real-time traffic

An erasure correction strategy based on fountain coding is proposed for traffic with real-time requirements. A sliding window marks the range of non-expired data. Each new block entering the window is once sent as such, followed by probabilistically ...
Trevi: watering down storage hotspots with cool fountain codes
HotNets-XII: Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks

Datacenter networking has brought high-performance storage systems' research to the foreground once again. Many modern storage systems are built with commodity hardware and TCP/IP networking to save costs. In this paper, we highlight a group of problems ...

Comments

Information & Contributors

Information

Published In

SIGCOMM '18: Proceedings of the ACM SIGCOMM 2018 Conference on Posters and Demos

August 2018

165 pages

ISBN:9781450359153

DOI:10.1145/3234200

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 August 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper
Research
Refereed limited

Conference

SIGCOMM '18

Sponsor:

SIGCOMM

SIGCOMM '18: ACM SIGCOMM 2018 Conference

August 20 - 25, 2018

Budapest, Hungary

Acceptance Rates

Overall Acceptance Rate 92 of 158 submissions, 58%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
446
Total Downloads

Downloads (Last 12 months)103
Downloads (Last 6 weeks)14

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yin CXu ZLi WLi TYuan SLiu Y(2023)Erasure Codes for Cold Data in Distributed Storage SystemsApplied Sciences10.3390/app1304217013:4(2170)Online publication date: 8-Feb-2023
https://doi.org/10.3390/app13042170
Wang JDing WHe MHu JXiong N(2023)Reducing tail latency with coding-based packet spraying in edge datacentersJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2022.102783134:COnline publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1016/j.sysarc.2022.102783
Alasmar MParisis GCrowcroft J(2021)SCDP: Systematic Rateless Coding for Efficient Data Transport in Data CentersIEEE/ACM Transactions on Networking10.1109/TNET.2021.309838629:6(2723-2736)Online publication date: 15-Dec-2021
https://dl.acm.org/doi/10.1109/TNET.2021.3098386
Besta MSchneider MKonieczny MCynk KHenriksson EGirolamo SSingla AHoefler T(2020)FatPaths: Routing in Supercomputers and Data Centers when Shortest Paths Fall ShortSC20: International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC41405.2020.00031(1-18)Online publication date: Nov-2020
https://doi.org/10.1109/SC41405.2020.00031

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Sliding Window-Based Erasure Correction Using Biased Sampling

Fountain-inspired erasure coding for real-time traffic

Trevi: watering down storage hotspots with cool fountain codes

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Sliding Window-Based Erasure Correction Using Biased Sampling

Fountain-inspired erasure coding for real-time traffic

Trevi: watering down storage hotspots with cool fountain codes

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations