REAL

Resilient Flow Decomposition of Unicast Connections with Network Coding

Babarczi, Péter and Tapolcai, János and Rónyai, Lajos and Médard, Muriel (2014) Resilient Flow Decomposition of Unicast Connections with Network Coding. In: IEEE International Symposium on Information Theory, June 29 - July 4, 2014, Honolulu, HI, USA.

[img] Text
[C14] ISIT 2014.pdf - Accepted Version
Restricted to Registered users only

Download (131kB) | Request a copy

Abstract

In this paper we close the gap between end-to-end diversity coding and intra-session network coding for unicast connections resilient against single link failures. In particular, we show that coding operations are sufficient to perform at the source and receiver if the user data can be split into at most two parts over the filed GF(2). Our proof is purely combinatorial and based on standard graph and network flow techniques. It is a linear time construction that defines the route of subflows A, B and A+B between the source and destination nodes. The proposed resilient flow decomposition method generalizes the 1+1 protection and the end-to-end diversity coding approaches while keeping both of their benefits. It provides a simple yet resource efficient protection method feasible in 2-connected backbone topologies. Since the core switches do not need to be modified, this result can bring benefits to current transport networks.

Item Type: Conference or Workshop Item (Paper)
Subjects: T Technology / alkalmazott, műszaki tudományok > T2 Technology (General) / műszaki tudományok általában
Depositing User: Dr Péter Babarczi
Date Deposited: 19 Sep 2014 14:20
Last Modified: 19 Sep 2014 14:20
URI: http://real.mtak.hu/id/eprint/15577

Actions (login required)

Edit Item Edit Item