TY - GEN
T1 - Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract)
AU - Dinitz, Yefim
AU - Dolev, Shlomi
AU - Khankin, Daniel
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/12/8
Y1 - 2017/12/8
N2 - 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.
AB - 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.
KW - dependence graph
KW - multiple routes updates
KW - seamless routes updates
KW - software-defined networking
UR - http://www.scopus.com/inward/record.url?scp=85046535433&partnerID=8YFLogxK
U2 - 10.1109/NCA.2017.8171386
DO - 10.1109/NCA.2017.8171386
M3 - Conference contribution
AN - SCOPUS:85046535433
T3 - 2017 IEEE 16th International Symposium on Network Computing and Applications, NCA 2017
SP - 1
EP - 7
BT - 2017 IEEE 16th International Symposium on Network Computing and Applications, NCA 2017
A2 - Avresky, Dimiter R.
A2 - Gkoulalas-Divanis, Aris
A2 - Avresky, Dimiter R.
A2 - Correia, Miguel P.
PB - Institute of Electrical and Electronics Engineers
T2 - 16th IEEE International Symposium on Network Computing and Applications, NCA 2017
Y2 - 30 October 2017 through 1 November 2017
ER -