Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract)

Yefim Dinitz, Shlomi Dolev, Daniel Khankin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

We study the problem of seamlessly updating several routes in a network, in the context of Software-Defined Networking (SDN). A set of routes pairs (Ci, Ni) is given, where each new Ni should replace the existing Ci. We look for a way of gradual updating, so that routing cycles are never created during the replacement process. In that, we follow the recent paper of Delaet et al., which considered the case of updating a single route. In addition, we require avoiding congestion on links. We provide an example of several routes replacement, where the strategy suggested by Delaet et al. fails: it arrives at a deadlock, while a legal way of replacement exists. We suggest a dependence graph model for solving the problem. The dependence graph nodes are: a) the sub-routes resulting from sub-dividing all Ni and Ci by the routers common to Ni and Ci, and b) the potentially congested links. We define which new sub-routes are legal for replacement. Further, we describe the changes in routing and in the dependence graph resulting from launching a legal new subroute. Summarizing, we reduce the route replacement problem to finding an (optimal) sequence of launchings of currently legal new sub-routes, using the dynamic dependence graph. Moreover, we suggest a novel meta-approach for resolving deadlocks, by utilizing the optical wires that connect the SDN controller to the routers.

Original languageEnglish
Title of host publication2017 IEEE 16th International Symposium on Network Computing and Applications, NCA 2017
EditorsDimiter R. Avresky, Aris Gkoulalas-Divanis, Dimiter R. Avresky, Miguel P. Correia
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-7
Number of pages7
ISBN (Electronic)9781538614655
DOIs
StatePublished - 8 Dec 2017
Event16th IEEE International Symposium on Network Computing and Applications, NCA 2017 - Cambridge, United States
Duration: 30 Oct 20171 Nov 2017

Publication series

Name2017 IEEE 16th International Symposium on Network Computing and Applications, NCA 2017
Volume2017-January

Conference

Conference16th IEEE International Symposium on Network Computing and Applications, NCA 2017
Country/TerritoryUnited States
CityCambridge
Period30/10/171/11/17

Keywords

  • dependence graph
  • multiple routes updates
  • seamless routes updates
  • software-defined networking

Fingerprint

Dive into the research topics of 'Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract)'. Together they form a unique fingerprint.

Cite this