Delay aware survivable routing with network coding in Software Defined Networks

Abstract

Abstract-It was demonstrated in transport networks that network (diversity) coding can provide sufficient redundancy to ensure instantaneous single link failure recovery, while nearoptimal bandwidth efficiency can be reached. However, in the resulting multi-path routing problem the end-to-end delays were not considered. On the other hand, even in a European-scale network the delay difference of the paths has severe effect on the Quality-of-Service of application scenarios, such as video streaming. Thus, in this paper we thoroughly investigate survivable routing in Software Defined Networks (SDNs) with several additional delay bounds to the bandwidth cost minimization problem. We build on the fact that, if the user data is split into at most two parts, then the minimum cost coding solution has a well-defined acyclic structure of subsequent paths and disjoint path-pairs between the communication end-points. Complexity analysis and integer linear programs are provided to solve these delay aware survivable routing problems in SDNs.

Diversity coding-based survivable routing with QoS and differential delay bounds

“…In the Delay Aware Routing with Coding (DARC) problem [11] the network is represented by a directed graph G = (V, E, k, c, d) with node set V , arc set E, and three additional attributes for each arc e ∈ E:…”

“…Here, we present an ILP formulation for DARC-QoS based on [7,11] for finding three minimum cost link-disjoint paths in G * = (V, E * , c * , d min , ∆) with additional delay bounds required for QoS routing. The connection request is C = (s, t, b = 2, D).…”

“…Here, we present an ILP for DARC-DD based on the mathematical formulation of [13] and correcting the one in [11] for finding three minimum cost link-disjoint paths in G * with additional delay bounds required for DDaware routing on DAGs. The connection request is C = (s, t, b = 2, D).…”

“…Constraint (10) says that only an arc with a non-zero flow value can have non-zero voltage. The main idea of the voltage constraint, i.e., eliminate cycles is formulated in Constraint (11). It says that for each node in the flow the sum of the voltages on the outgoing arcs has to be higher than on the incoming arcs.…”

“…This high resilience of SRDC was demonstrated in [10] through a video streaming application scenario, but it was also noted that the end-to-end delay and the delay difference should be considered in the routing problem [11]. Although several works are dealing with Qualityof-Service (QoS) routing [12] and differential delay (DD) aware [13] survivable routing in optical networks, all of the methods are designed for disjoint paths only.…”