SYMBIOTIC ROUTING IN FUTURE DATA CENTER 工科三 陳泰穎. Outline 1. CamCube 1. Traditional data center 2. The problems 3. CamCube philosophy 4. Feature 5. What’s.

Slides:



Advertisements
Similar presentations
IP Router Architectures. Outline Basic IP Router Functionalities IP Router Architectures.
Advertisements

Interconnection Networks: Flow Control and Microarchitecture.
Chapter 1: Introduction to Scaling Networks
Symbiotic Routing in Future Data Centers Hussam Abu-Libdeh, Paolo Costa, Antony Rowstron, Greg OShea, Austin Donnelly Cornell University Microsoft Research.
Computer Network Topologies
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
J. K. Kim Portland. Trend of Data Center By J. Nicholas Hoover, InformationWeek June 17, :00 AMJ. Nicholas Hoover 200 million Euro Data centers.
1 Exploring Efficient and Scalable Multicast Routing in Future Data Center Networks Dan Li, Jiangwei Yu, Junbiao Yu, Jianping Wu Tsinghua University Presented.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts Amherst Operating Systems CMPSCI 377 Lecture.
CISCO NETWORKING ACADEMY Chabot College ELEC Routed and Routing Protocols.
Small-World Graphs for High Performance Networking Reem Alshahrani Kent State University.
Progress Report Wireless Routing By Edward Mulimba.
15-441: Computer Networking Lecture 26: Networking Future.
Analysis of Web Caching Architectures: Hierarchical and Distributed Caching Pablo Rodriguez, Christian Spanner, and Ernst W. Biersack IEEE/ACM TRANSACTIONS.
presented by Hasan SÖZER1 Scalable P2P Search Daniel A. Menascé George Mason University.
Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.
Chuanxiong Guo, Haitao Wu, Kun Tan,
ProActive Routing In Scalable Data Centers with PARIS Joint work with Dushyant Arora + and Jennifer Rexford* + Arista Networks *Princeton University Theophilus.
Data Center Basics (ENCS 691K – Chapter 5)
A Modernize Version of the Antique Telephone Architecture Christopher Francis & Bertha Wilhelm.
Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.
Class 3: SDN Stack Theophilus Benson. Outline Background – Routing in ISP – Cloud Computing SDN application stack revisited Evolution of SDN – The end.
Ji-Yong Shin * Bernard Wong +, and Emin Gün Sirer * * Cornell University + University of Waterloo 2 nd ACM Symposium on Cloud ComputingOct 27, 2011 Small-World.
Chapter 27 Q and A Victor Norman IS333 Spring 2015.
Camdoop: Exploiting In-network Aggregation for Big Data Applications Paolo Costa, Austin Donnelly, Antony Rowstron, Greg O’Shea Presenter – Manoj Kumar(mkumar11)
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—1-1 MPLS Concepts Introducing Basic MPLS Concepts.
ElasticTree: Saving Energy in Data Center Networks 許倫愷 2013/5/28.
CS An Overlay Routing Scheme For Moving Large Files Su Zhang Kai Xu.
Routing and Routing Protocols Routing Protocols Overview.
Peer to Peer Research survey TingYang Chang. Intro. Of P2P Computers of the system was known as peers which sharing data files with each other. Build.
IP Switching for Scalable IP Services Hassan M. Ahmed Ross Callon Andrew G. Malis Hohn Moy Presented by Gao, Yun Shih, Pei-Shin Wei, ShuGuang.
Mobile Networking Challenges1 5.6 Mobile Ad Hoc Networks  Ad hoc network does not have any preexisting centralized server nodes to perform packet routing,
Technical Refresher Session 3. Overview Difference between communication between devices on a single logical network and communication between different.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Connecting to the Network Networking for Home and Small Businesses – Chapter.
DARD: Distributed Adaptive Routing for Datacenter Networks Xin Wu, Xiaowei Yang.
1 Next Few Classes Networking basics Protection & Security.
Internetworking – What is internetworking? Connect multiple networks of one or more organizations into a large, uniform communication system. The resulting.
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
Economic Incentives in Information- Centric Networking: Implications for Protocol Design and Public Policy Group Members: Muhammad Kamran Siddique Adel.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Connecting to the Network Networking for Home and Small Businesses.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 1: Introduction to Scaling Networks Scaling Networks.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 1: Introduction to Scaling Networks Scaling Networks.
Lecture 6 Page 1 Advanced Network Security Review of Networking Basics Advanced Network Security Peter Reiher August, 2014.
MPLS Concepts Introducing Basic MPLS Concepts. Outline Overview What Are the Foundations of Traditional IP Routing? Basic MPLS Features Benefits of MPLS.
Hierarchical Topology Design. 2 Topology Design Topology is a map of an___________ that indicates network segments, interconnection points, and user communities.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Symbiotic Routing in Future Data Centers Hussam Abu-Libdeh Paolo Costa Antony Rowstron Greg O’Shea Austin Donnelly MICROSOFT RESEARCH Presented By Deng.
Real Time Sensor Networks – challenges and solutions Information Prioritization Proposed scheme: Design techniques for priority assignment to an information.
Camdoop Exploiting In-network Aggregation for Big Data Applications
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Design Space Exploration for NoC Topologies ECE757 6 th May 2009 By Amit Kumar, Kanchan Damle, Muhammad Shoaib Bin Altaf, Janaki K.M Jillella Course Instructor:
MPLS Introduction How MPLS Works ?? MPLS - The Motivation MPLS Application MPLS Advantages Conclusion.
© ITT Educational Services, Inc. All rights reserved. IS3120 Network Communications Infrastructure Unit 7 Layer 3 Networking, Campus Backbones, WANs, and.
CIS 700-5: The Design and Implementation of Cloud Networks
Lecture 2: Leaf-Spine and PortLand Networks
Routing Jennifer Rexford.
Data Center Network Architectures
Chuanxiong Guo, et al, Microsoft Research Asia, SIGCOMM 2008
CprE 458/558: Real-Time Systems
FAR: A Fault-avoidance Routing Method for Data Center Networks with Regular Topology Please send.
NTHU CS5421 Cloud Computing
Aled Edwards, Anna Fischer, Antonio Lain HP Labs
Chuanxiong Guo, Haitao Wu, Kun Tan,
Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.
Meshed Multipath Routing: An Efficient Strategy in Wireless Sensor Networks Swades DE Chunming QIAO Hongyi WU EE Dept.
Network Architecture for Cyberspace
Connecting to the Network
COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.
Towards Predictable Datacenter Networks
Presentation transcript:

SYMBIOTIC ROUTING IN FUTURE DATA CENTER 工科三 陳泰穎

Outline 1. CamCube 1. Traditional data center 2. The problems 3. CamCube philosophy 4. Feature 5. What’s different? 2. Symbiotic Routing 1. Service 1. TCP/IP 2. VM distribution service 3. Cache service 4. Aggregation service 2. Properties 3. Conclusion

1. CamCube – the Goal  Design a data center from the perspective of a distributed systems builder

1.1 Traditional Data Center  Distributed system philosophy vs. reality

1.2 The Problems ( of the traditional data center)  Addressing  Bandwidth  Server has little or no control over network

1.3 ComCube Philosophy  No Swiches  Topology: 3D Torus

1.3 CamCube Philosophy – why?  The CamCube API  (x,y,z) coordinate  Coordinate easily remapped in case of failure  1-hop API (send/recv from 1-hop neighbors)

1.4 feature  Two types of networks:  Dierect-connect for intra-server traffic  Switched network for inter-camcube traffic Multiple independent network can be used

What’s different?  High Performance Computing  CamCube make topology explicit  Service can intercept(modify) packet on path  Failure resilience  Multiple independent service  Distributed System  Key-space naturally mapped physically  Networking  No switches/routers (symmetry of role)  Not using TCP/IP

2. Symbiotic Routing  Symbiotic Routing is coupled with CamCube because:  Each server link to other server closer  Each server plays a role of switch/router too  Each server share the resourse (memory/FS)

2.1 TCP/IP Service  Required to implement TCP/IP for existing service  CamCube use its own method to enhance performance

2.2 VM distribution Service  Traditional: may create high number of interior server and edges (of tree of file system) than necessary.  New approach with CamCube:  Use its topology feature.  The custom routing protocol is hierarchical, recursively dividing the coordinate space into 3D mini-cubes.

2.3 Cache service  Traditional remote cache  Here Llcal cache Not local cache

2.4 Aggregation  Don’t have to do traverse  Use 3D topology feature (ex. X->y->z)

2.5 Properties  Key to server mapping  Path specification (x,y,z)  Fault-tolerance  Multipath  Packet buffers  Prioritization

3. Conclusion  Symbiotic Routing is coupled with CamCube-like Infrastructure  This routing method provide flexible implement of service (protocol)  Support in-network packet processing  CamCube + API(this routing method) = easy-built data center

Comment  Challenge  If service goes inner the CamCube, chances may be multi-hop network.  Beyond network efficiency, what’s else can we benefit from CamCube ?  High level switch/router is costly  The energy saves by remove switch/router  Make better use of energy consumption in computation

Thank you