A DAG-Based Forwarding Paradigm for Large Scale Software Defined Networks

Abstract

The Software Defined Network (SDN) paradigm represents a major breakthrough in the networking field, due to its unprecedented capabilities in terms of flexibility and programmability. SDNs have been successfully deployed in data centers and small to medium enterprises. However, adopting the SDN paradigm in the context of wide area networks is more challenging, due to a number of factors including the higher probability that node and link failures occur and the unavailability of a dedicated control channel. In this paper, we present a DAG (Directed Acyclic Graph) based forwarding paradigm addressing the challenges that arise when the SDN concept is applied to large scale networks. Specifically, the proposed paradigm aims to limit the number of entries required on the SDN switches, to provide a fast local restoration of single node/link failures without the intervention of the SDN controller and to prevent the possibility of having inconsistent forwarding tables during updates. The proposed paradigm does not require any extension to the OpenFlow protocol and we show how it can be implemented by only using standard features. The DAG-based forwarding paradigm requires to compute a DAG between every pair of ingress-egress switches and to design an index-based hashing scheme to balance the load across the paths in the DAG while avoiding TCP reordering issues. In this paper, we present heuristic algorithms providing a solution to such problems and report the results of a simulation study conducted to assess the performance of the proposed forwarding paradigm.