Fast Failover for Control Traffic in Software-defined Networks Globecom 2012 Neda B. & Ying Z. Presented by: Szu-Ping Wang.

Slides:

Advertisements

Similar presentations

IP Fast Reroute Using Tunnel-AT draft-xu-ipfrr-tunnelat-00 Mingwei Xu, Lingtao Pan, Qing Li Tsinghua University, China 75 th IETF Meeting, Stockholm July.

Advertisements

Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.

A Unified View to Greedy Routing Algorithms in Ad-Hoc Networks

1 Efficient and Robust Streaming Provisioning in VPNs Z. Morley Mao David Johnson Oliver Spatscheck Kobus van der Merwe Jia Wang.

CS Dept, City Univ.1 Low Latency Broadcast in Multi-Rate Wireless Mesh Networks LUO Hongbo.

1 Multicast Routing with Minimum Energy Cost in Ad hoc Wireless Networks Xiaohua Jia, Deying Li and Frankie Hung Dept of Computer Science, City Univ of.

Branch and Bound Similar to backtracking in generating a search tree and looking for one or more solutions Different in that the “objective” is constrained.

1 Internet Networking Spring 2006 Tutorial 6 Network Cost of Minimum Spanning Tree.

Improving BGP Convergence Through Consistency Assertions Dan Pei, Lan Wang, Lixia Zhang UCLA Xiaoliang Zhao, Daniel Massey, Allison Mankin, USC/ISI S.

A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.

Multicast Routing in ATM Networks with Multiple Classes of QoS Ren-Hung Hwang, Min-Xiou Chen, and Youn-Chen Sun Department of Computer Science & Information.

1 Internet Networking Spring 2004 Tutorial 6 Network Cost of Minimum Spanning Tree.

Wireless Sensor Network for Tracking the Traffic in INTERNET Network Routers Part 2 Supervisor:Mark Shifrin Students:Yuri Kipnis Nir Bar-Or Date:30 September.

Path Protection in MPLS Networks Using Segment Based Approach.

1 Internet Networking Spring 2002 Tutorial 6 Network Cost of Minimum Spanning Tree.

A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.

UCSC 1 Aman ShaikhICNP 2003 An Efficient Algorithm for OSPF Subnet Aggregation ICNP 2003 Aman Shaikh Dongmei Wang, Guangzhi Li, Jennifer Yates, Charles.

Routing and Network Design: Algorithmic Issues Kamesh Munagala Duke University.

1 Meeyoung Cha, Sue Moon, Chong-Dae Park Aman Shaikh Placing Relay Nodes for Intra-Domain Path Diversity To appear in IEEE INFOCOM 2006.

Review: routing algorithms. –Choose the appropriate paths. –Routing algorithms Flooding Shortest path routing (example). –Dijkstra algorithm. –Bellman-Ford.

Network Aware Resource Allocation in Distributed Clouds.

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

17 th International Teletraffic Congress Topological design of telecommunication networks Michał Pióro a,b, Alpar Jüttner c, Janos Harmatos c, Áron Szentesi.

COSC 2007 Data Structures II Chapter 14 Graphs III.

Parallel #2 Paper – Phylogeny and Branch and Bound Algorithms George McGinn

Budapest University of Technology and Economics Department of Telecommunications and Media Informatics Optimized QoS Protection of Ethernet Trees Tibor.

Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.

Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.

TCP Traffic and Congestion Control in ATM Networks

Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.

Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.

Efficient Route Computation on Road Networks Based on Hierarchical Communities Qing Song, Xiaofan Wang Department of Automation, Shanghai Jiao Tong University,

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

Cut Saturation for p-cycle Design Khalid Al-Snaie Electronics Dept., College of Technology Riyadh, Saudi Arabia Dale R. Thompson* Department of Computer.

Networking and internetworking devices. Repeater.

Optical Network Security Daniel Stewart. Preliminary work Dijkstra's Algorithm Dijkstra's algorithm, is a graph search algorithm that solves the single-

Minimizing Recovery State In Geographic Ad-Hoc Routing Noa Arad School of Electrical Engineering Tel Aviv University Yuval Shavitt School of Electrical.

CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.

COSC 5341 High-Performance Computer Networks Presentation for By Linghai Zhang ID:

Heuristic Methods for Topological Design of Telecommunication Networks Andrzej Mysłek, Piotr Karaś Institute of Telecommunications Warsaw University of.

Graphs. Introduction Graphs are a collection of vertices and edges Graphs are a collection of vertices and edges The solid circles are the vertices A,

Scaling Properties of the Internet Graph Aditya Akella, CMU With Shuchi Chawla, Arvind Kannan and Srinivasan Seshan PODC 2003.

11/02/2001 Workshop on Optical Networking 1 Design Method of Logical Topologies in WDM Network with Quality of Protection Junichi Katou Dept. of Informatics.

Decision Maths 1 Shortest path algorithm Dijkstra’s Algorithm A V Ali :

1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),

Introduction to Multiple-multicast Routing Chu-Fu Wang.

Placing Relay Nodes for Intra-Domain Path Diversity Meeyoung Cha Sue Moon Chong-Dae Park Aman Shaikh Proc. of IEEE INFOCOM 2006 Speaker 游鎮鴻.

Construction of Optimal Data Aggregation Trees for Wireless Sensor Networks Deying Li, Jiannong Cao, Ming Liu, and Yuan Zheng Computer Communications and.

Scaling Properties of the Internet Graph Aditya Akella With Shuchi Chawla, Arvind Kannan and Srinivasan Seshan PODC 2003.

The Network Aware IoT Service at Edge Guoxi Wang.

Xin Li, Chen Qian University of Kentucky

ROURING ALGORITHM: LINK STATE

Binary search tree. Removing a node

A Study of Group-Tree Matching in Large Scale Group Communications

Author: Daniel Guija Alcaraz

ElasticTree Michael Fruchtman.

Tonga Institute of Higher Education

Disjoint Path Routing Algorithms

Spanning Tree Algorithms

EEC – 289Q Project Presentation

Shortest path problem and its application to optical network

Maximum Flow Neil Tang 4/8/2008

COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.

Prim’s algorithm for minimum spanning trees

Lecture 10 Graph Algorithms

Achieving Resilient Routing in the Internet

CSCI 465 Data Communications and Networks Lecture 16

Deployment Optimization of IoT Devices through Attack Graph Analysis

Presentation transcript:

Fast Failover for Control Traffic in Software-defined Networks Globecom 2012 Neda B. & Ying Z. Presented by: Szu-Ping Wang

Introduction Control Plane Data Plane Traditional Switch SDN Control Plane Data Plane Control Traffic 2 / 11 ( 1 / 2 ) Controller Network Device

Data Plane Control Plane Control Traffic How to implement? -Adding new links? Cost increasing… -Choose one node in original topology to be controller? Introduction ( 2 / 2 ) 3 / 11

? -Fast Failover Backup Link Protected Switch Choose the best placement with minimum number of unprotected switch. How to choose the best placement on the original topology? Controller Placement ( 1 / 2 ) 4 / 11

Define the Protected Switch: 1.Check the other nodes that is not in the same sub-tree. Special case: controller’s immediate children check the all other nodes except controller in step 1. Protected! Controller Placement ( 2 / 2 ) 5 / 11 2.Does there exist a link between target switch and the set of green circle? Unprotected!

Two algorithms for choosing the best location for the network controller. One algorithm for improving the resiliency of shortest path routing tree. The ideas are all about protected switches numbers. Algorithm overview ( 1 / 1 ) 6 / 11

Algorithm 1 Opt. algo. ( 1 / 1 ) 7 / 11 Unprotected! Minimized the descendants number of unprotected switches. Search through all switch and choose the one that minimized the descendants number of unprotected switches.

It’s non-practical if the size of the network is large! Heuristic Algorithm. Check only the neighbors of controller and choose the one that maximized the number of protected switches. Special case: controller’s immediate children check the all other nodes except controller in step 1. Protected! No need to find the routing tree first! Algorithm 2 GREEDY algo. ( 1 / 1 ) 8 / 11

Start from Shortest Path Tree. Try to modify the tree by replacing the edge to the tree edge. Switch ID Descendants number of unprotected switches Initial2 a0 b2 c0 abc Algorithm 3 routing. algo. ( 1 / 1 ) 9 /

10 real network topologies. Calculating the descendants number of unprotected switches. SIMULATION ( 1 / 1 ) 10 / 11

Thanks !! Presented by: Szu-Ping Wang

There is no analysis for Algorithm 2. The algorithm 1 and 3 are straightforward. It’s practical for implement SDN on original topology. conclusion ( 1 / 1 ) 12 / 11