Deakin University
Browse

Congestion-aware local reroute for fast failure recovery in software-defined networks

Version 2 2024-06-05, 12:27
Version 1 2017-11-01, 00:00
journal contribution
posted on 2024-06-05, 12:27 authored by Z Cheng, X Zhang, Y Li, S Yu, R Lin, L He
Although a restoration approach derives a reroute path when failure occurs and greatly reduces forwarding rules in switches compared with a protection approach, software-defined networks (SDNs) induce a long failure recovery process because of frequent flow operations between the SDN controller and switches. Accordingly, it is indispensable to design a new resilience approach to balance failure recovery time and forwarding rule occupation. To this end, we leverage flexible flow aggregation in fast reroute to solve this problem. In the proposed approach, each disrupted traffic flow is reassigned to a local reroute path for the purpose of congestion avoidance. Thus, all traffic flows assigned to the same local reroute path are aggregated into a new 'big' flow, and the number of reconfigured forwarding rules in the restoration process is greatly reduced. We first formulate this problem as an integer linear programming model, then design an efficient heuristic named the 'congestion-aware local fast reroute' (CALFR). Extensive emulation results show that CALFR enables fast recovery while avoiding link congestion in the post-recovery network.

History

Related Materials

Location

Washington, D.C.

Language

eng

Publication classification

C Journal article, C1 Refereed article in a scholarly journal

Copyright notice

2017, Optical Society of America

Journal

Journal of optical communications and networking

Volume

9

Pagination

934-944

ISSN

1943-0620

Issue

11

Publisher

Optical Society of America Publishing