Course Project for CS05112. Objective Simulate the FatTree datacenter network using Mininet and MinEdit. With controller: spamming tree, link failures.

Slides:



Advertisements
Similar presentations
High-Fidelity Switch Models for SDN Emulation
Advertisements

Interconnection Networks: Flow Control and Microarchitecture.
Module 13: Performance Tuning. Overview Performance tuning methodologies Instance level Database level Application level Overview of tools and techniques.
Communication Networks Recitation 3 Bridges & Spanning trees.
Evaluation of a Scalable P2P Lookup Protocol for Internet Applications
Dr. Kalpakis CMSC 621, Advanced Operating Systems. Fall 2003 URL: Distributed System Architectures.
OpenFlow-Based Server Load Balancing GoneWild
P449. p450 Figure 15-1 p451 Figure 15-2 p453 Figure 15-2a p453.
A Study of Multiple IP Link Failure Fang Yu
Page: 1 Director 1.0 TECHNION Department of Computer Science The Computer Communication Lab (236340) Summer 2002 Submitted by: David Schwartz Idan Zak.
ProActive Routing In Scalable Data Centers with PARIS Joint work with Dushyant Arora + and Jennifer Rexford* + Arista Networks *Princeton University Theophilus.
Course Project for CS Objective Simulate the FatTree network using ndnSIM. Simulate a multicast session with l oadbalancing Add more producers to.
Networking and Internetworking Devices Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009.
A Scalable, Commodity Data Center Network Architecture Mohammad Al-Fares, Alexander Loukissas, Amin Vahdat Presented by Gregory Peaker and Tyler Maclean.
A Scalable, Commodity Data Center Network Architecture.
OpenFlow Switch Limitations. Background: Current Applications Traffic Engineering application (performance) – Fine grained rules and short time scales.
FAR: A Fault-avoidance Routing Method for Data Center Networks with Regular Topology Bin Liu, ZTE.
Introduction to IT and Communications Technology Justin Champion C208 – 3292 Ethernet Switching CE
OpenFlow-Based Server Load Balancing GoneWild Author : Richard Wang, Dana Butnariu, Jennifer Rexford Publisher : Hot-ICE'11 Proceedings of the 11th USENIX.
PA3: Router Junxian (Jim) Huang EECS 489 W11 /
Technical Refresher Session 3. Overview Difference between communication between devices on a single logical network and communication between different.
DARD: Distributed Adaptive Routing for Datacenter Networks Xin Wu, Xiaowei Yang.
SDN Dev Group, Week 3 Aaron GemberAditya Akella University of Wisconsin-Madison 1 Floodlight Controller; Application Wishlist.
Chapter 17 Frame Relay Frame Relay Layers Frame Relay Operation Implementation WCB/McGraw-Hill  The McGraw-Hill Companies, Inc., 1998.
Datacenter Network Simulation using ns3
Configuring Cisco Switches Chapter 13 powered by DJ 1.
Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.
The Reasoning Process and Inductive Reasoning By Ryanne Gorsuch By Ryanne Gorsuch.
OSI Reference Model. Open Systems Interconnection (OSI) Model International standard organization (ISO) established a committee in 1977 to develop an.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 7 Spanning Tree Protocol.
Mininet and Openflow Labs. Install Mininet (do not do this in class) Download VirtualBox Download Xming for windows (X11) Download Mininet VM for linux-ubuntu.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Static Routing Routing and Switching Essentials.
+ Routing Concepts 1 st semester Objectives  Describe the primary functions and features of a router.  Explain how routers use information.
5: DataLink Layer 5a-1 Bridges and spanning tree protocol Reference: Mainly Peterson-Davie.
Switches – Continued. Switches If a switch has N ports with multiple computers per port, then how many simultaneous transmissions can you have? Explain.
Coping with Link Failures in Centralized Control Plane Architecture Maulik Desai, Thyagarajan Nandagopal.
Routing Semester 2, Chapter 11. Routing Routing Basics Distance Vector Routing Link-State Routing Comparisons of Routing Protocols.
Class Notes CS403- Internet Technology Prepared by: Gulrez Alam Khan.
Network LAB 3 Prepared by: Eng. Mennatallah Hesham Uder Supervision of: Dr. Nermeen Hamza Dr. Iman Fahmy.
Course Project for CS Objective Simulate a datacenter network using Mininet.
Configuration for routing example
SDN controllers App Network elements has two components: OpenFlow client, forwarding hardware with flow tables. The SDN controller must implement the network.
Mininet and Openflow Labs
SDN challenges Deployment challenges
Multi Node Label Routing – A layer 2.5 routing protocol
Building Bridges CS 3700 Project 2.
The DPIaaS Controller Prototype
Programming Assignment
Static and Default Routing
ECE 544: Traffic engineering (supplement)
NOX: Towards an Operating System for Networks
Building Bridges CS 3700 Project 2.
Programming Assignment #3
Lecture 13 review Explain how distance vector algorithm works.
Connecting LANs, Backbone Networks,
SoftRing: Taming the Reactive Model for Software Defined Networks
Routing Without Flow Control Hot-Potato Routing Simulation
Group 6-SDN Based Prioritized Information Dissemination
Planning a Network Upgrade
GENI Summer Camp Project Resilient Networks with DAG
CS4470 Computer Networking Protocols
Jellyfish: Networking Data Centers Randomly
Implement Inter-VLAN Routing
Connecting to the Network
2019/5/2 Using Path Label Routing in Wide Area Software-Defined Networks with OpenFlow ICNP = International Conference on Network Protocols Presenter:Hung-Yen.
COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.
Unit 7 EIGRP Chapter 13 Using EIGRP in Enterprise Networks
© 2006 ITT Educational Services Inc.
In-network computation
Presentation transcript:

Course Project for CS05112

Objective Simulate the FatTree datacenter network using Mininet and MinEdit. With controller: spamming tree, link failures Without controller: implement FatTree’s routing rules with switch flow rules

FatTree topology

Experiment 1 (with controller) The physical topology has loops, you need to first build a logical spamming tree (hint: use the existing) Figure out and draw the logical spamming tree topology Make OpenFlow switches to behave like address learning switches Using pingall to testify, examine the flow tables on switches Introduce link failure events with at least three simultaneously failed links However, the physical network shouldn’t be partitioned. Reconstruct the spamming tree and re-populate the flow tables with pingall Topology, pingall result, flows table on switches

Experiment 2 (without controller) Do not use any controller In simulation script, insert appropriate flow table entries in OpenFlow switches to make the network behaves like FatTree. Test the routing rules with pingall Prove that the traffic is evenly distributed on FatTree with flow table entry statistics.

Submit your project Your simulation source code and readme file if necessary. Your project report document Explain your code and report the experiment results on experiment 1 and 2.