1 / 12

Fast Failover for Control Traffic in Software-defined Networks

Fast Failover for Control Traffic in Software-defined Networks. Globecom 2012 Neda B. & Ying Z. Presented by: Szu -Ping Wang. Introduction. ( 1 / 2 ). Controller. Control Plane. Control Plane. Control Traffic. Data Plane. Data Plane. Network Device. Traditional Switch. SDN.

lana
Télécharger la présentation

Fast Failover for Control Traffic in Software-defined Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Fast FailoverforControl TrafficinSoftware-defined Networks Globecom 2012 Neda B. & Ying Z. Presented by: Szu-Ping Wang

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

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

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

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

  6. Algorithm overview ( 1 / 1 ) • 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. 6/ 11

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

  8. Algorithm 2 GREEDY algo. ( 1 / 1 ) • 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. • No need to find the routing tree first! Protected! Protected! Special case: controller’s immediate children check the all other nodes except controller in step 1. 8/ 11

  9. Algorithm 3 routing. algo. ( 1 / 1 ) • Start from Shortest Path Tree. • Try to modify the tree by replacing the edge to the tree edge. 2 2 0 a b c 9/ 11

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

  11. Thanks !! Presented by: Szu-Ping Wang

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

More Related