Datacast: a scalable and efficient reliable group data delivery service for data centers

Authors:
Jiaxin Cao;Chuanxiong Guo;Guohan Lu;Yongqiang Xiong;Yixin Zheng;Yongguang Zhang;Yibo Zhu;Chen Chen
Affiliations:
University of Science and Technology of China, Hefei, China;Microsoft Research Asia, Beijing, China;Microsoft Research Asia, Beijing, China;Microsoft Research Asia, Beijing, China;Tsinghua University, Beijing, China;Microsoft Research Asia, Beijing, China;University of California, Santa Barbara, Santa Barbara, CA, USA;University of Pennsylvania, Philadelphia, PA, USA
Venue:
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Year:
2012

Citing 16
Cited 1

Towards an active network architecture

ACM SIGCOMM Computer Communication Review
A reliable multicast framework for light-weight sessions and application level framing

IEEE/ACM Transactions on Networking (TON)
pgmcc: a TCP-friendly single-rate multicast congestion control scheme

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
The Google file system

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
SplitStream: high-bandwidth multicast in cooperative environments

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Parallel construction of optimal independent spanning trees on hypercubes

Parallel Computing
MapReduce: simplified data processing on large clusters

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Dryad: distributed data-parallel programs from sequential building blocks

Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
A scalable, commodity data center network architecture

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Packet caches on routers: the implications of universal redundant traffic elimination

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
BCube: a high performance, server-centric network architecture for modular data centers

Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Networking named content

Proceedings of the 5th international conference on Emerging networking experiments and technologies
Independent Spanning Trees on Multidimensional Torus Networks

IEEE Transactions on Computers
Symbiotic routing in future data centers

Proceedings of the ACM SIGCOMM 2010 conference
ServerSwitch: a programmable and high performance platform for data center networks

Proceedings of the 8th USENIX conference on Networked systems design and implementation
Managing data transfers in computer clusters with orchestra

Proceedings of the ACM SIGCOMM 2011 conference

Rethinking the physical layer of data center networks of the next decade: using optics to enable efficient *-cast connectivity

ACM SIGCOMM Computer Communication Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reliable Group Data Delivery (RGDD) is a pervasive traffic pattern in data centers. In an RGDD group, a sender needs to reliably deliver a copy of data to all the receivers. Existing solutions either do not scale due to the large number of RGDD groups (e.g., IP multicast) or cannot efficiently use network bandwidth (e.g., end-host overlays). Motivated by recent advances on data center network topology designs (multiple edge-disjoint Steiner trees for RGDD) and innovations on network devices (practical in-network packet caching), we propose Datacast for RGDD. Datacast explores two design spaces: 1) Datacast uses multiple edge-disjoint Steiner trees for data delivery acceleration. 2) Datacast leverages in-network packet caching and introduces a simple soft-state based congestion control algorithm to address the scalability and efficiency issues of RGDD. Our analysis reveals that Datacast congestion control works well with small cache sizes (e.g., 125KB) and causes few duplicate data transmissions (e.g., 1.19%). Both simulations and experiments confirm our theoretical analysis. We also use experiments to compare the performance of Datacast and BitTorrent. In a BCube(4, 1) with 1Gbps links, we use both Datacast and BitTorrent to transmit 4GB data. The link stress of Datacast is 1.01, while it is 1.39 for BitTorrent. By using two Steiner trees, Datacast finishes the transmission in 16.9s, while BitTorrent uses 52s.