Datacast: A Scalable and Efficient Reliable Group Data Delivery Service for Data Centers Jiaxin Cao, Chuanxiong Guo, Guohan Lu, Yongqiang Xiong, Yixin.

Slides:

Advertisements

Similar presentations

Multicasting in Mobile Ad hoc Networks By XIE Jiawei.

Advertisements

Push Technology Humie Leung Annabelle Huo. Introduction Push technology is a set of technologies used to send information to a client without the client.

System Area Network Abhiram Shandilya 12/06/01. Overview Introduction to System Area Networks SAN Design and Examples SAN Applications.

BCube: A High Performance, Server-centric Network Architecture for Modular Data Centers Chuanxiong Guo1, Guohan Lu1, Dan Li1, Haitao Wu1, Xuan Zhang2,

PortLand: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric. Presented by: Vinuthna Nalluri Shiva Srivastava.

Suphakit Awiphan, Takeshi Muto, Yu Wang, Zhou Su, Jiro Katto

Host Mobility Using an Internet Indirection Infrastructure by Shelley Zhuang, Kevin Lai, Ion Stoica, Randy Katz, Scott Shenker presented by Essi Vehmersalo.

Computer Science 1 ShapeShifter: Scalable, Adaptive End-System Multicast John Byers, Jeffrey Considine, Nicholas Eskelinen, Stanislav Rost, Dmitriy Zavin.

1 A Case For End System Multicast Yang-hua Chu, Sanjay Rao and Hui Zhang Carnegie Mellon University Largely adopted from Jonathan Shapiro’s slides at umass.

Scalable Team Multicast in Wireless Ad hoc networks Exploiting Coordinated Motion Mario Gerla University of California, Los Angeles.

15-441: Computer Networking Lecture 26: Networking Future.

Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.

1 A Framework for Lazy Replication in P2P VoD Bin Cheng 1, Lex Stein 2, Hai Jin 1, Zheng Zhang 2 1 Huazhong University of Science & Technology (HUST) 2.

A loss detection Service for Active Reliable Multicast Protocols Moufida MAIMOUR & C. D. PHAM INRIA-RESO RESAM UCB-Lyon – ENS Lyon INC’02, Plymouth Tuesday,

Application Layer Multicast

Reliable WDM Multicast in Optical Burst-Switched Networks Myoungki Jeong, Chunming Qiao and Yijun Xiong Dep. Of EE and CSE State University of New York.

1 IP Multicasting. 2 IP Multicasting: Motivation Problem: Want to deliver a packet from a source to multiple receivers Applications: –Streaming of Continuous.

BCube: A High Performance, Server-centric Network Architecture for Modular Data Centers Chuanxiong Guo1, Guohan Lu1, Dan Li1, Haitao Wu1, Xuan Zhang2,

1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.

CS218 – Final Project A “Small-Scale” Application- Level Multicast Tree Protocol Jason Lee, Lih Chen & Prabash Nanayakkara Tutor: Li Lao.

Portland: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric Offense Kai Chen Shih-Chi Chen.

Chuanxiong Guo, Haitao Wu, Kun Tan,

Supporting VCR-like Operations in Derivative Tree-Based P2P Streaming Systems Tianyin Xu, Jianzhong Chen, Wenzhong Li, Sanglu Lu Nanjing University Yang.

A Preferred Link Based Multicast Protocol for Wireless Mobile Ad hoc Networks R. S. Sisodia, Karthigeyan. I, B. S. Manoj, and C. Siva Ram Murthy ICC 2003.

Transport Level Protocol Performance Evaluation for Bulk Data Transfers Matei Ripeanu The University of Chicago Abstract:

A Scalable, Commodity Data Center Network Architecture Mohammad Al-Fares, Alexander Loukissas, Amin Vahdat Presented by Gregory Peaker and Tyler Maclean.

An Active Reliable Multicast Framework for the Grids M. Maimour & C. Pham ICCS 2002, Amsterdam Network Support and Services for Computational Grids Sunday,

A Scalable, Commodity Data Center Network Architecture.

1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:

University of Nevada, Reno Virtual Direction Multicast for Overlay Networks Suat Mercan & Dr. Murat Yuksel HOTP2P’11.

1 MASTERING (VIRTUAL) NETWORKS A Case Study of Virtualizing Internet Lab Avin Chen Borokhovich Michael Goldfeld Arik.

IGP Multicast Architecture Lucy Yong, Weiguo Hao, Donald Eastlake Andrew Qu, Jon Hudson, Uma Chunduri February 2015 NVO3 Interim Meeting draft-yong-rtgwg-igp-mutlicast-arch-01.

Scalable Reliable Multicast Architecture Wenjun Zeng Computer Science Department University of Missouri-Columbia.

Approximate Load Balance Based on ID/Locator Split Routing Architecture 1 Sanqi Zhou, Jia Chen, Hongbin Luo, Hongke Zhang Beijing JiaoTong University

ON DESIGING END-USER MULTICAST FOR MULTIPLE VIDEO SOURCES Y.Nakamura, H.Yamaguchi, A.Hiromori, K.Yasumoto †, T.Higashino and K.Taniguchi Osaka University.

Application-Layer Multicast -presented by William Wong.

DARD: Distributed Adaptive Routing for Datacenter Networks Xin Wu, Xiaowei Yang.

Overlay Network Physical LayerR : router Overlay Layer N R R R R R N.

Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.

Aadil Zia Khan and Shahab Baqai LUMS School of Science and Engineering QoS Aware Path Selection in Content Centric Networks Fahad R. Dogar Carnegie Mellon.

IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.

Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.

On the use of Reliable Multicast for Content Distribution Vassilis Chatzigiannakis

IGP Multicast Architecture Lucy Yong, Weiguo Hao, Donald Eastlake Andrew Qu, Jon Hudson, Uma Chunduri November 2014 Honolulu USA draft-yong-rtgwg-igp-mutlicast-arch-00.

A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.

Overcast: Reliable Multicasting with an Overlay Network Paper authors: Jannotti, Gifford, Johnson, Kaashoek, O’Toole Jr. Slides by Chris Johnstone.

《 Hierarchical Caching Management for Software Defined Content Network based on Node Value 》 Reporter ： Jing Liu ， China Affiliation ： University of Science.

2007/03/26OPLAB, NTUIM1 A Proactive Tree Recovery Mechanism for Resilient Overlay Network Networking, IEEE/ACM Transactions on Volume 15, Issue 1, Feb.

Dual Centric Data Center Network Architectures DAWEI LI, JIE WU (TEMPLE UNIVERSITY) ZHIYONG LIU, AND FA ZHANG (CHINESE ACADEMY OF SCIENCES) ICPP 2015.

Chuanxiong Guo, Haitao Wu, Kun Tan, Lei Shi, Yongguang Zhang, Songwu Lu SIGCOMM 2008 Presented by Ye Tian for Course CS05112.

Symbiotic Routing in Future Data Centers Hussam Abu-Libdeh Paolo Costa Antony Rowstron Greg O’Shea Austin Donnelly MICROSOFT RESEARCH Presented By Deng.

Reliable Multicast Routing for Software-Defined Networks.

SecondNet: A Data Center Network Virtualization Architecture with Bandwidth Guarantees Chuanxiong Guo 1, Guohan Lu 1, Helen J. Wang 2, Shuang Yang 3, Chao.

CS5248 Student Presentation1 Scalable Resilient Media Streaming Suman Banerjee, Seungjoon Lee, Ryan Braud, Bobby Bhattacharjee, Aravind Srinivasan NOSSDAV.

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #09: SOLUTIONS Shivkumar Kalyanaraman: GOOGLE: “Shiv.

A Case for End System Multicast 學號：報告人：通訊所吳瑞益指導教授：楊峻權日期： ACM SIGMETRICS.

Jiaxin Cao, Rui Xia, Pengkun Yang, Chuanxiong Guo,

CubicRing ENABLING ONE-HOP FAILURE DETECTION AND RECOVERY FOR DISTRIBUTED IN- MEMORY STORAGE SYSTEMS Yiming Zhang, Chuanxiong Guo, Dongsheng Li, Rui Chu,

IS-IS Extension For Building Distribution Trees draft-yong-isis-ext-4-distribution-tree-01 Lucy Yong, Weiguo Hao, Donald Eastlake Andrew Qu, Jon Hudson.

CMPE 252A: Computer Networks

5/3/2018 3:51 AM Memory Efficient Loss Recovery for Hardware-based Transport in Datacenter Yuanwei Lu1,2, Guo Chen2, Zhenyuan Ruan1,2, Wencong Xiao2,3,

Chuanxiong Guo, et al, Microsoft Research Asia, SIGCOMM 2008

ElasticTree Michael Fruchtman.

FAR: A Fault-avoidance Routing Method for Data Center Networks with Regular Topology Please send.

BCube: A High Performance, Server-centric Network Architecture for Modular Data Centers Chuanxiong Guo1, Guohan Lu1, Dan Li1, Haitao Wu1, Xuan Zhang2,

11/13/ :11 PM Memory Efficient Loss Recovery for Hardware-based Transport in Datacenter Yuanwei Lu1,2, Guo Chen2, Zhenyuan Ruan1,2, Wencong Xiao2,3,

Chuanxiong Guo, Haitao Wu, Kun Tan,

Overlay Networking Overview.

Coded Caching in Information-Centric Networks

Tarun Banka Department of Computer Science Colorado State University

Presentation transcript:

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: given a data source, Src,and a set of receivers, R 1, R 2, …, R n, how to reliably transmit bulk data from Src to all the receivers? In a data center network, 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!

The architecture of Datacast Fabric Manager Master i Master j Src R1R1 R2R2 IMD Src R1R1 R2R2 R3R3 R4R4 RGDD Group i 1 RGDD Group i 2 RGDD Group i n 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: 1.Use specific algorithms to construct spanning trees. 2.Prune the spanning trees. 3.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): Inst Data Inst Data Inst Data Inst Data

Datacast transport protocol

Simulation: multiple Steiner trees algorithm We tested our algorithm in Fattree(24,3), BCube(8, 3), Torus(16, 3) under the link failure rates (LFR) of 1%, 3% and 5%. Running times.Steiner tree numbers.

Simulation: Datacast congestion control Steiner Tree 1.Steiner Tree 2.

Simulation: Datacast congestion control Based on Theorem 1, Datacast needs 125KB caches to work at full rate. Based on Theorem 2, the duplicate data ratios is 1.19%. Cache Size (KB)Throughput(Mbps)Duplicate Data Ratio (%)

Simulation: Datacast congestion control Compare with BitTorrent. Fattree.BCube.Torus.

Experiment: Datacast congestion control

We compare Datacast with BitTorrent. We use both of them to transmit 4GB data. Finish time (s)Link stress Datacast BitTorrent521.39

Related work Reliable IP multicast Pgm congestion control (pgmcc) Active Reliable Multicast (ARM) End-host based overlays SplitStream End System Multicast Cornet

Conclusion In this paper, we propose Datacast which Calculates multiple edge-disjoint Steiner trees in DCNs Uses CCN to turn hard group states to soft packet caching Uses a simple rate-based AIMD congestion control algorithm to achieve high efficiency Datacast is scalable and achieves high bandwidth efficiency

Thank you!