Presentation is loading. Please wait.

Presentation is loading. Please wait.

ProActive Routing In Scalable Data Centers with PARIS Joint work with Dushyant Arora + and Jennifer Rexford* + Arista Networks *Princeton University Theophilus.

Published byLoren Adams Modified over 9 years ago

Similar presentations

Presentation on theme: "ProActive Routing In Scalable Data Centers with PARIS Joint work with Dushyant Arora + and Jennifer Rexford* + Arista Networks *Princeton University Theophilus."— Presentation transcript:

1 ProActive Routing In Scalable Data Centers with PARIS Joint work with Dushyant Arora + and Jennifer Rexford* + Arista Networks *Princeton University Theophilus Benson Duke University

2 Data Center Networks Must … Support diverse application – High throughput/low latency – Utilize multiple paths Scale to cloud size – 5-10 million VMs Support flexible resource utilization – Support seamless VM mobility

3 Evolution of Data Center Networks… Scalable Seamless mobility Multipath routing Layer 2: Flat Addresses Layer 3: Hierarchical Addresses Overlays: VL2/Portland PARIS

4 PARIS in a Nutshell… PARIS is a scalable and flexible flat layer 3 network fabric. PARIS hierarchically partitions addresses at the core PARIS runs on a data center of commodity switches

5 Outline Evolution of Data Center Networks PARIS Architecture Evaluation and Conclusion

6 Evolution of Data Center Networks Flat layer 2: Spanning Tree – Uses flooding to discover location of hosts Supports seamless VM migration – Traffic restricted to single network path Not scalable Seamless mobility No Multipath

7 Evolution of Data Center Networks Layer 3:Hierarchical Addresses – Host locations are predefined – During VM mobility, IP-addresses change – Load balances over k shortest paths Scalable No seamless mobility Multipath

8 Evolution of Data Center Networks Overlay solutions: Portland/VL2 – Uses two addressing schemes: hierarchical addresses: for routing traffic flat addresses: for identifying VMs Seamless mobility Multipath Not scalable

9 Overheads introduced by Overlays Solutions… – Address resolution infrastructure Inflated flow startups times – Switch CPU for encapsulation – Switch storage for caching address resolutions Flat-Address Hierarchical- Address FA Payload HA Payload HA Resolve

10 Evolution of Data Center Networks… Scalable Seamless mobility Multipath routing Layer 2: Flat Addresses Layer 3: Hierarchical Addresses Overlays: VL2/Portland

11 Challenges.. Develop data center network that supports benefits of overlay routing while eliminating.. – Overheads of caching and packet-encapsulation – Overheads of address translation

12 ProActive Routing In Scalable PARIS Architecture

13 Architectural Principles Flat layer-three network – Allows for seamless VM mobility Proactive installation of forwarding state – Eliminates startup latency overheads Hierarchical partitioning of network state – Promotes scalability

14 Paris Architecture Network Controller End-Hosts: /32 addresses Default GW: edge switch Switches: Support ECMP Programmable devices Switches: Support ECMP Programmable devices Network Controller: Monitors network traffic Performs traffic engineering Tracks network topology Pro-actively installs forwarding entries Network Controller: Monitors network traffic Performs traffic engineering Tracks network topology Pro-actively installs forwarding entries Overheads eliminated Pro-active rule installation  No start-up delay for switch rule installation No addresses indirection  No address resolution, encapsulation, caching /32 network addresses  No broadcast traffic; no ARP Overheads eliminated Pro-active rule installation  No start-up delay for switch rule installation No addresses indirection  No address resolution, encapsulation, caching /32 network addresses  No broadcast traffic; no ARP

15 Evolution of Data Center Networks… Scalable Seamless mobility Multipath routing Layer 2: Flat Addresses Layer 3: Hierarchical Addresses Overlays: VL2/Portland PARIS

16 Paris Network Controller Switches have 1 million entries – But data center has 5-10 million VMs – Each pod has ~100K VMs Network Controller Pod-Addressing Core-Addressing Pod switch track addresses for all VMs in the pod Partition IP-Address across core devices

17 Pod-Addressing Module Edge & aggregation addressing scheme – Edge: stores address for all connected end-hosts – Pod: stores addresses for all end-hosts in pod 10.10.10.1 10.10.10.2 10.10.10.3 10.10.10.4

18 Pod-Addressing Module Edge & aggregation addressing scheme – Edge: stores address for all connected end-hosts – Agg: stores addresses for all end-hosts in pod 10.10.10.1 10.10.10.2 10.10.10.3 10.10.10.4 10.10.10.1->2 10.10.10.2->2 10.10.10.3->1 10.10.10.4->1 10.10.10.1->1 10.10.10.2->1 10.10.10.3->2 10.10.10.4->2 10.10.10.1->1 10.10.10.2->1 10.10.10.3->1 10.10.10.4->1 default->(2,3) 1 2 3

19 Core Addressing-Modules Partitions the IP-space into virtual-prefix Each core is an Appointed prefix switch (APS) – Tracks all address in a virtual-prefix 10.0.0.0/14

20 Core Addressing-Modules Partitions the IP-space into virtual-prefix Each core is an Appointed prefix switch (APS) – Tracks all address in a virtual-prefix 10.0.0.0/15 10.3.0.0/16 10.0.0.0/16 10.1.0.0/1610.2.0.0/16

21 Core Addressing-Modules Partitions the IP-space into virtual-prefix Each core is an Appointed prefix switch (APS) – Tracks all address in a virtual-prefix 10.0.0.0/15 10.3.0.0/16 10.0.0.0/16 10.1.0.0/1610.2.0.0/16

22 1 2 3 4 1 2 1 2 DIP:10.3.0.1->1 DIP:10.3.0.2->1 DIP:*.*.*.*->{2,3} DIP:10.0.0.1->1 DIP:10.0.0.2->1 DIP:*.*.*.*->{2,3} DIP:10.0.0.0/16->{1,2} DIP:10.1.0.0/16->{3,4} DIP:10.0.0.1->1 DIP:10.0.0.2->1 DIP:10.1.0.0/16->3 DIP:10.0.0.3->2 DIP:10.0.0.4->2 DIP:10.2.0.0/16->4 DIP:10.3.0.0/16->4 DIP:10.0.0.0/16->3 DIP:10.3.0.1->1 DIP:10.3.0.2->1 DIP:10.2.0.0/16->3 DIP:10.3.0.3->2 DIP:10.3.0.4->2 DIP:10.0.0.0/16->4 DIP:10.1.0.0/16->4 DIP:10.3.0.0/16->3 DIP:10.3.0.2->1 10.3.0.110.0.0.1

23 DIP:10.3.0.1->1 DIP:10.3.0.2->1 DIP:*.*.*.*->{2,3} DIP:10.3.0.1->1 DIP:10.3.0.2->1 DIP:10.2.0.0/16->3 DIP:10.3.0.3->2 DIP:10.3.0.4->2 DIP:10.0.0.0/16->4 DIP:10.3.0.0/16->{1,2} DIP:10.1.0.0/16->4 DIP:10.2.0.0/16->{3,4} 1 2 3 4 1 2 DIP:10.0.0.1->1 DIP:10.0.0.2->1 DIP:*.*.*.*->{2,3} DIP:10.0.0.1->1 DIP:10.0.0.2->1 DIP:10.1.0.0/16->3 DIP:10.0.0.3->2 DIP:10.0.0.4->2 DIP:10.2.0.0/16->4 DIP:10.0.0.0/16->{1,2} DIP:10.3.0.0/16->4 DIP:10.1.0.0/16->{3,4} DIP:10.0.0.0/16->3 DIP:10.3.0.0/16->3 DIP:10.3.0.2->1 Limitations No Load balancing between the core nodes Multi-path in core is not utilized! Limitations No Load balancing between the core nodes Multi-path in core is not utilized!

24 DIP:10.3.0.1->1 DIP:10.3.0.2->1 DIP:*.*.*.*->{2,3} DIP:10.3.0.1->1 DIP:10.3.0.2->1 DIP:10.2.0.0/16->3 DIP:10.3.0.3->2 DIP:10.3.0.4->2 DIP:10.0.0.0/16->4 DIP:10.3.0.0/16->{1,2} DIP:10.1.0.0/16->4 DIP:10.2.0.0/16->{3,4} 1 2 3 4 1 2 DIP:10.0.0.1->1 DIP:10.0.0.2->1 DIP:*.*.*.*->{2,3} DIP:10.0.0.1->1 DIP:10.0.0.2->1 DIP:10.1.0.0/16->3 DIP:10.0.0.3->2 DIP:10.0.0.4->2 DIP:10.2.0.0/16->4 DIP:10.0.0.0/16->{1,2} DIP:10.3.0.0/16->4 DIP:10.1.0.0/16->{3,4} DIP:10.0.0.0/16->3 DIP:10.3.0.0/16->3 DIP:10.3.0.2->1 Limitations No Load balancing between the core nodes Multi-path in core is not utilized! Limitations No Load balancing between the core nodes Multi-path in core is not utilized! Not utilized Highly utilized

25 DIP:10.3.0.1->1 DIP:10.3.0.2->1 DIP:*.*.*.*->{2,3} DIP:10.3.0.1->1 DIP:10.3.0.2->1 DIP:10.2.0.0/16->3 DIP:10.3.0.3->2 DIP:10.3.0.4->2 DIP:10.0.0.0/16->4 DIP:10.3.0.0/16->{1,2} DIP:10.1.0.0/16->4 DIP:10.2.0.0/16->{3,4} 1 2 3 4 1 2 DIP:10.0.0.1->1 DIP:10.0.0.2->1 DIP:*.*.*.*->{2,3} DIP:10.0.0.1->1 DIP:10.0.0.2->1 DIP:10.1.0.0/16->3 DIP:10.0.0.3->2 DIP:10.0.0.4->2 DIP:10.2.0.0/16->4 DIP:10.0.0.0/16->{1,2} DIP:10.3.0.0/16->4 DIP:10.1.0.0/16->{3,4} DIP:10.0.0.0/16->3 DIP:10.3.0.0/16->3 DIP:10.3.0.2->1 DIP:10.0.0.0/14->{3,4} High-BW PARIS: Connect core nodes in a mesh Change rules at aggregation to load balance across core nodes Use Valiant Load-balancing in the core High-BW PARIS: Connect core nodes in a mesh Change rules at aggregation to load balance across core nodes Use Valiant Load-balancing in the core

26 DIP:10.3.0.1->1 DIP:10.3.0.2->1 DIP:*.*.*.*->{2,3} DIP:10.3.0.1->1 DIP:10.3.0.2->1 DIP:10.2.0.0/16->3 DIP:10.3.0.3->2 DIP:10.3.0.4->2 DIP:10.0.0.0/16->4 DIP:10.3.0.0/16->{1,2} DIP:10.1.0.0/16->4 DIP:10.2.0.0/16->{3,4} 1 2 3 4 1 2 DIP:10.0.0.1->1 DIP:10.0.0.2->1 DIP:*.*.*.*->{2,3} DIP:10.0.0.1->1 DIP:10.0.0.2->1 DIP:10.1.0.0/16->3 DIP:10.0.0.3->2 DIP:10.0.0.4->2 DIP:10.2.0.0/16->4 DIP:10.0.0.0/16->{1,2} DIP:10.3.0.0/16->4 DIP:10.1.0.0/16->{3,4} DIP:10.0.0.0/16->3 DIP:10.3.0.0/16->3 DIP:10.3.0.2->1 DIP:10.0.0.0/14->{3,4} High-BW PARIS: Connect core nodes in a mesh Change rules at aggregation to load balance across core nodes Use Valiant Load-balancing in the core High-BW PARIS: Connect core nodes in a mesh Change rules at aggregation to load balance across core nodes Use Valiant Load-balancing in the core

27 DIP:10.3.0.1->1 DIP:10.3.0.2->1 DIP:*.*.*.*->{2,3} DIP:10.3.0.2->1 DIP:10.2.0.0/16->3 DIP:10.3.0.3->2 DIP:10.3.0.4->2 DIP:10.0.0.0/16->4 DIP:10.3.0.0/16->{1,2} DIP:10.1.0.0/16->4 DIP:10.2.0.0/16->{3,4} 1 2 3 4 1 2 DIP:10.0.0.1->1 DIP:10.0.0.2->1 DIP:*.*.*.*->{2,3} DIP:10.0.0.1->1 DIP:10.0.0.2->1 DIP:10.1.0.0/16->3 DIP:10.0.0.3->2 DIP:10.0.0.4->2 DIP:10.2.0.0/16->4 DIP:10.0.0.0/16->{1,2} DIP:10.3.0.0/16->4 DIP:10.1.0.0/16->{3,4} DIP:10.0.0.0/16->3 DIP:10.3.0.0/16->3 DIP:10.3.0.2->1 DIP:10.3.0.1->{7,8} DIP:10.3.0.1->1

28 Evaluation

29 How does PARIS scale to large data centers? Does PARIS ensure good performance? How does PARIS perform under failures? How quickly does PARIS react to VM migration?

30 Evaluation How does PARIS scale to large data centers? Does PARIS ensure good performance? How does PARIS perform under failures? How quickly does PARIS react to VM migration?

31 TestBed Emulate data center topology using Mininet Generate traffic using IPerf Random traffic traffic matrix Implemented PARIS on NOX Data center topology 32 hosts, 16 edge, 8 aggregation, and 4 core No over-subscription – Link capacity: Server Uplinks: 1Mbps Switch-Switch: 10Mbps

32 Scaling to Large Data Centers NoviFlow has developed switches with 1 million entries [1]. 128 ports* [1] NoviFlow. 1248 Datasheet. http://bit.ly/1baQd0A.http://bit.ly/1baQd0A

33 Does PARIS Ensure Good Performance? How low is latency? – Recall: random traffic matrix. Communication PatternLatency Inter-pod61us Intra-pod106us

34 Summary PARIS achieves scalability and flexibility – Flat layer 3 network – Pre-positioning forwarding state in switches – Using topological knowledge to partition forwarding state Our evaluations show that PARIS is practical! – Scales to large data-centers – Can be implemented using existing commodity devices

35 Questions

Download ppt "ProActive Routing In Scalable Data Centers with PARIS Joint work with Dushyant Arora + and Jennifer Rexford* + Arista Networks *Princeton University Theophilus."

Similar presentations

Data Center Fabrics Lecture 12 Aditya Akella.

Data Center Fabrics Lecture 12 Aditya Akella.
Introducing Campus Networks

Introducing Campus Networks
SDN Controller Challenges

SDN Controller Challenges
VCRIB: Virtual Cloud Rule Information Base Masoud Moshref, Minlan Yu, Abhishek Sharma, Ramesh Govindan HotCloud 2012.

VCRIB: Virtual Cloud Rule Information Base Masoud Moshref, Minlan Yu, Abhishek Sharma, Ramesh Govindan HotCloud 2012.
PortLand: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric

PortLand: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric
CloudWatcher: Network Security Monitoring Using OpenFlow in Dynamic Cloud Networks or: How to Provide Security Monitoring as a Service in Clouds? Seungwon.

CloudWatcher: Network Security Monitoring Using OpenFlow in Dynamic Cloud Networks or: How to Provide Security Monitoring as a Service in Clouds? Seungwon.
Introduction into VXLAN Russian IPv6 day June 6 th, 2012 Frank Laforsch Systems Engineer, EMEA

Introduction into VXLAN Russian IPv6 day June 6 th, 2012 Frank Laforsch Systems Engineer, EMEA
Mobility Jennifer Rexford COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101

Mobility Jennifer Rexford COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101
Brocade VDX 6746 switch module for Hitachi Cb500

Brocade VDX 6746 switch module for Hitachi Cb500
The Case for Enterprise Ready Virtual Private Clouds Timothy Wood, Alexandre Gerber *, K.K. Ramakrishnan *, Jacobus van der Merwe *, and Prashant Shenoy.

The Case for Enterprise Ready Virtual Private Clouds Timothy Wood, Alexandre Gerber *, K.K. Ramakrishnan *, Jacobus van der Merwe *, and Prashant Shenoy.
PARIS: ProActive Routing In Scalable Data Centers Dushyant Arora, Theophilus Benson, Jennifer Rexford Princeton University.

PARIS: ProActive Routing In Scalable Data Centers Dushyant Arora, Theophilus Benson, Jennifer Rexford Princeton University.
J. K. Kim Portland. Trend of Data Center By J. Nicholas Hoover, InformationWeek June 17, 2008 04:00 AMJ. Nicholas Hoover 200 million Euro Data centers.

J. K. Kim Portland. Trend of Data Center By J. Nicholas Hoover, InformationWeek June 17, :00 AMJ. Nicholas Hoover 200 million Euro Data centers.
PortLand: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric. Presented by: Vinuthna Nalluri Shiva Srivastava.

PortLand: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric. Presented by: Vinuthna Nalluri Shiva Srivastava.
Radhika Niranjan Mysore, Andreas Pamboris, Nathan Farrington, Nelson Huang, Pardis Miri, Sivasankar Radhakrishnan, Vikram Subramanya, and Amin Vahdat Department.

Radhika Niranjan Mysore, Andreas Pamboris, Nathan Farrington, Nelson Huang, Pardis Miri, Sivasankar Radhakrishnan, Vikram Subramanya, and Amin Vahdat Department.
PortLand: A Scalable Fault- Tolerant Layer 2 Data Center Network Fabric B97703099 財金三 婁瀚升 1.

PortLand: A Scalable Fault- Tolerant Layer 2 Data Center Network Fabric B 財金三 婁瀚升 1.
Data Center Fabrics. Forwarding Today Layer 3 approach: – Assign IP addresses to hosts hierarchically based on their directly connected switch. – Use.

Data Center Fabrics. Forwarding Today Layer 3 approach: – Assign IP addresses to hosts hierarchically based on their directly connected switch. – Use.
Applying NOX to the Datacenter Arsalan Tavakoli, Martin Casado, Teemu Koponen, and Scott Shenker 10/22/2009Hot Topics in Networks Workshop 2009.

Applying NOX to the Datacenter Arsalan Tavakoli, Martin Casado, Teemu Koponen, and Scott Shenker 10/22/2009Hot Topics in Networks Workshop 2009.
OpenFlow-Based Server Load Balancing GoneWild

OpenFlow-Based Server Load Balancing GoneWild
Towards Virtual Routers as a Service 6th GI/ITG KuVS Workshop on “Future Internet” November 22, 2010 Hannover Zdravko Bozakov.

Towards Virtual Routers as a Service 6th GI/ITG KuVS Workshop on “Future Internet” November 22, 2010 Hannover Zdravko Bozakov.
Revisiting Ethernet: Plug-and-play made scalable and efficient Changhoon Kim and Jennifer Rexford Princeton University.

Revisiting Ethernet: Plug-and-play made scalable and efficient Changhoon Kim and Jennifer Rexford Princeton University.

Similar presentations

Ads by Google