Resilient flow decomposition of unicast connections with network coding

Peter Babarczi, Janos Tapolcai, Lajos Ronyai, Muriel Medard

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages116-120
Number of pages5
ISBN (Print)9781479951864
DOIs
Publication statusPublished - 2014
Event2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States
Duration: Jun 29 2014Jul 4 2014

Other

Other2014 IEEE International Symposium on Information Theory, ISIT 2014
CountryUnited States
CityHonolulu, HI
Period6/29/147/4/14

Fingerprint

Network coding
Network Coding
Coding
Switches
Topology
Decomposition
Decompose
Network Flow
Decomposition Method
Backbone
Linear Time
Switch
Receiver
Sufficient
Generalise
Resources
Graph in graph theory
Vertex of a graph

Keywords

  • instantaneous recovery
  • network coding
  • resilient flow decomposition
  • unicast connections

ASJC Scopus subject areas

  • Applied Mathematics
  • Modelling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Babarczi, P., Tapolcai, J., Ronyai, L., & Medard, M. (2014). Resilient flow decomposition of unicast connections with network coding. In IEEE International Symposium on Information Theory - Proceedings (pp. 116-120). [6874806] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2014.6874806

Resilient flow decomposition of unicast connections with network coding. / Babarczi, Peter; Tapolcai, Janos; Ronyai, Lajos; Medard, Muriel.

IEEE International Symposium on Information Theory - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2014. p. 116-120 6874806.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Babarczi, P, Tapolcai, J, Ronyai, L & Medard, M 2014, Resilient flow decomposition of unicast connections with network coding. in IEEE International Symposium on Information Theory - Proceedings., 6874806, Institute of Electrical and Electronics Engineers Inc., pp. 116-120, 2014 IEEE International Symposium on Information Theory, ISIT 2014, Honolulu, HI, United States, 6/29/14. https://doi.org/10.1109/ISIT.2014.6874806
Babarczi P, Tapolcai J, Ronyai L, Medard M. Resilient flow decomposition of unicast connections with network coding. In IEEE International Symposium on Information Theory - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2014. p. 116-120. 6874806 https://doi.org/10.1109/ISIT.2014.6874806
Babarczi, Peter ; Tapolcai, Janos ; Ronyai, Lajos ; Medard, Muriel. / Resilient flow decomposition of unicast connections with network coding. IEEE International Symposium on Information Theory - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 116-120
@inproceedings{be517d0f8d25489aba090070cfce6353,
title = "Resilient flow decomposition of unicast connections with network coding",
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.",
keywords = "instantaneous recovery, network coding, resilient flow decomposition, unicast connections",
author = "Peter Babarczi and Janos Tapolcai and Lajos Ronyai and Muriel Medard",
year = "2014",
doi = "10.1109/ISIT.2014.6874806",
language = "English",
isbn = "9781479951864",
pages = "116--120",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Resilient flow decomposition of unicast connections with network coding

AU - Babarczi, Peter

AU - Tapolcai, Janos

AU - Ronyai, Lajos

AU - Medard, Muriel

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - instantaneous recovery

KW - network coding

KW - resilient flow decomposition

KW - unicast connections

UR - http://www.scopus.com/inward/record.url?scp=84906569595&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906569595&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2014.6874806

DO - 10.1109/ISIT.2014.6874806

M3 - Conference contribution

AN - SCOPUS:84906569595

SN - 9781479951864

SP - 116

EP - 120

BT - IEEE International Symposium on Information Theory - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -