Datacast: A Scalable and Efficient Reliable Group
Author : trish-goza | Published Date : 2025-05-12
Description: Datacast A Scalable and Efficient Reliable Group Data Delivery Service for Data Centers Jiaxin Cao Chuanxiong Guo Guohan Lu Yongqiang Xiong Yixin Zheng Yongguang Zhang Yibo Zhu Chen Chen University of Science and Technology of China
Presentation Embed Code
Download Presentation
Download
Presentation The PPT/PDF document
"Datacast: A Scalable and Efficient Reliable Group" is the property of its rightful owner.
Permission is granted to download and print the materials on this website for personal, non-commercial use only,
and to display it on your personal computer provided you do not modify the materials and that you retain all
copyright notices contained in the materials. By downloading content from our website, you accept the terms of
this agreement.
Transcript:Datacast: A Scalable and Efficient Reliable Group:
Datacast: A Scalable and Efficient Reliable Group Data Delivery Service for Data Centers Jiaxin Cao, Chuanxiong Guo, Guohan Lu, Yongqiang Xiong, Yixin Zheng, Yongguang Zhang, Yibo Zhu, Chen Chen University of Science and Technology of China Microsoft Research Asia Tsinghua University University of California, Santa Barbara University of Pennsylvania Reliable Group Data Delivery The problem of RGDD is: <0,0> 01 02 03 10 11 12 13 20 21 22 23 30 31 32 33 <1,0> <1,1> <1,2> <1,3> <0,1> <0,2> <0,3> 00 given a data source, Src, and a set of receivers, R1, R2, …, Rn, how to reliably transmit bulk data from Src to all the receivers? In a data center network, Data Data Data Data Data Data Reliable Group Data Delivery RGDD is important in DCNs: Bootstrapping or OS upgrading. Distributed file systems, e.g., GFS. VM setup. And more... Reliable Group Data Delivery A good RGDD design should have the following properties: Scalable (large group numbers and large group sizes) High bandwidth efficiency Existing solutions to RGDD Existing solutions can be classified into two categories: Reliable IP multicast. Not scalable, e.g., ACK implosion. End-host based overlays. Low bandwidth efficiency. None of the existing systems can perfectly achieve RGDD. New opportunities in DCN Recently, there are two clear trends in DCN: Multiple edge-disjoint Steiner trees for RGDD. Practical packet caching abilities in network devices. We can cache packet! <0,0> 00 01 02 03 <0,1> 10 11 12 13 <0,2> 20 21 22 23 <0,3> 30 31 32 33 <1,1> <1,2> <1,3> <1,0> 00 10 20 30 <1,1> 01 11 21 31 <1,2> 02 12 22 32 <1,3> 03 13 23 33 <0,1> <0,2> <0,3> The architecture of Datacast Fabric Manager Master i Master j Src R1 R2 RGDD Group i1 RGDD Group i2 RGDD Group in Network Topology How to calculate multiple Steiner trees? How to efficiently transmit data in each Steiner tree? Multiple edge-disjoint Steiner trees in DCN Our multiple Steiner trees algorithm takes three steps: Use specific algorithms to construct spanning trees. Prune the spanning trees. Use Breath First Search(BFS) to repair the trees broken by network failures. This algorithm is fast (O(k|V|) + O(|E|) + O(k|E|)) and efficient. Datacast transport protocol Datacast is built on top of Content Centric Network (CCN): 00 01 02 03 10 11 12 13 20 21 22 23 30 31 32 33 Inst Data Data Data Inst Data Data Inst Data
