Survivable routing meets diversity coding

Alija Pašić, J. Tapolcai, Péter Babarczi, Erika R. Bérczi-Kovács, Zoltán Király, L. Rónyai

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

6 Citations (Scopus)

Abstract

Survivable routing methods have been thoroughly investigated in the past decades in transport networks. However, the proposed approaches suffered either from slow recovery time, poor bandwidth utilization, high computational or operational complexity, and could not really provide an alternative to the widely deployed single edge failure resilient dedicated 1 + 1 protection approach. Diversity coding is a candidate to overcome these difficulties with a relatively simple technique: dividing the connection data into two parts, and adding some redundancy at the source node. However, a missing link to make diversity coding a real alternative to 1+1 in transport networks is finding its minimum cost survivable routing, even in sparse topologies, where previous approaches may fail. In this paper we propose a polynomial-time algorithm with O(|V||E| log |V|) complexity for this routing problem. On the other hand, we show that the same routing problem turns to be NP-hard as soon as we limit the forwarding capabilities of some nodes and the capacities of some links of the network.

Original languageEnglish
Title of host publicationProceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Print)9783901882685
DOIs
Publication statusPublished - Jun 30 2015
Event2015 14th IFIP Networking Conference, IFIP Networking 2015 - Toulouse, France
Duration: May 20 2015May 22 2015

Other

Other2015 14th IFIP Networking Conference, IFIP Networking 2015
CountryFrance
CityToulouse
Period5/20/155/22/15

Fingerprint

Redundancy
Topology
Polynomials
Bandwidth
Recovery
Costs

Keywords

  • diversity coding
  • fast recovery
  • survivable routing
  • transport networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Pašić, A., Tapolcai, J., Babarczi, P., Bérczi-Kovács, E. R., Király, Z., & Rónyai, L. (2015). Survivable routing meets diversity coding. In Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015 [7145330] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IFIPNetworking.2015.7145330

Survivable routing meets diversity coding. / Pašić, Alija; Tapolcai, J.; Babarczi, Péter; Bérczi-Kovács, Erika R.; Király, Zoltán; Rónyai, L.

Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015. Institute of Electrical and Electronics Engineers Inc., 2015. 7145330.

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

Pašić, A, Tapolcai, J, Babarczi, P, Bérczi-Kovács, ER, Király, Z & Rónyai, L 2015, Survivable routing meets diversity coding. in Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015., 7145330, Institute of Electrical and Electronics Engineers Inc., 2015 14th IFIP Networking Conference, IFIP Networking 2015, Toulouse, France, 5/20/15. https://doi.org/10.1109/IFIPNetworking.2015.7145330
Pašić A, Tapolcai J, Babarczi P, Bérczi-Kovács ER, Király Z, Rónyai L. Survivable routing meets diversity coding. In Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015. Institute of Electrical and Electronics Engineers Inc. 2015. 7145330 https://doi.org/10.1109/IFIPNetworking.2015.7145330
Pašić, Alija ; Tapolcai, J. ; Babarczi, Péter ; Bérczi-Kovács, Erika R. ; Király, Zoltán ; Rónyai, L. / Survivable routing meets diversity coding. Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015. Institute of Electrical and Electronics Engineers Inc., 2015.
@inproceedings{51c17a71ee484fa3988d60434e5a5de6,
title = "Survivable routing meets diversity coding",
abstract = "Survivable routing methods have been thoroughly investigated in the past decades in transport networks. However, the proposed approaches suffered either from slow recovery time, poor bandwidth utilization, high computational or operational complexity, and could not really provide an alternative to the widely deployed single edge failure resilient dedicated 1 + 1 protection approach. Diversity coding is a candidate to overcome these difficulties with a relatively simple technique: dividing the connection data into two parts, and adding some redundancy at the source node. However, a missing link to make diversity coding a real alternative to 1+1 in transport networks is finding its minimum cost survivable routing, even in sparse topologies, where previous approaches may fail. In this paper we propose a polynomial-time algorithm with O(|V||E| log |V|) complexity for this routing problem. On the other hand, we show that the same routing problem turns to be NP-hard as soon as we limit the forwarding capabilities of some nodes and the capacities of some links of the network.",
keywords = "diversity coding, fast recovery, survivable routing, transport networks",
author = "Alija Pašić and J. Tapolcai and P{\'e}ter Babarczi and B{\'e}rczi-Kov{\'a}cs, {Erika R.} and Zolt{\'a}n Kir{\'a}ly and L. R{\'o}nyai",
year = "2015",
month = "6",
day = "30",
doi = "10.1109/IFIPNetworking.2015.7145330",
language = "English",
isbn = "9783901882685",
booktitle = "Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Survivable routing meets diversity coding

AU - Pašić, Alija

AU - Tapolcai, J.

AU - Babarczi, Péter

AU - Bérczi-Kovács, Erika R.

AU - Király, Zoltán

AU - Rónyai, L.

PY - 2015/6/30

Y1 - 2015/6/30

N2 - Survivable routing methods have been thoroughly investigated in the past decades in transport networks. However, the proposed approaches suffered either from slow recovery time, poor bandwidth utilization, high computational or operational complexity, and could not really provide an alternative to the widely deployed single edge failure resilient dedicated 1 + 1 protection approach. Diversity coding is a candidate to overcome these difficulties with a relatively simple technique: dividing the connection data into two parts, and adding some redundancy at the source node. However, a missing link to make diversity coding a real alternative to 1+1 in transport networks is finding its minimum cost survivable routing, even in sparse topologies, where previous approaches may fail. In this paper we propose a polynomial-time algorithm with O(|V||E| log |V|) complexity for this routing problem. On the other hand, we show that the same routing problem turns to be NP-hard as soon as we limit the forwarding capabilities of some nodes and the capacities of some links of the network.

AB - Survivable routing methods have been thoroughly investigated in the past decades in transport networks. However, the proposed approaches suffered either from slow recovery time, poor bandwidth utilization, high computational or operational complexity, and could not really provide an alternative to the widely deployed single edge failure resilient dedicated 1 + 1 protection approach. Diversity coding is a candidate to overcome these difficulties with a relatively simple technique: dividing the connection data into two parts, and adding some redundancy at the source node. However, a missing link to make diversity coding a real alternative to 1+1 in transport networks is finding its minimum cost survivable routing, even in sparse topologies, where previous approaches may fail. In this paper we propose a polynomial-time algorithm with O(|V||E| log |V|) complexity for this routing problem. On the other hand, we show that the same routing problem turns to be NP-hard as soon as we limit the forwarding capabilities of some nodes and the capacities of some links of the network.

KW - diversity coding

KW - fast recovery

KW - survivable routing

KW - transport networks

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

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

U2 - 10.1109/IFIPNetworking.2015.7145330

DO - 10.1109/IFIPNetworking.2015.7145330

M3 - Conference contribution

AN - SCOPUS:84942673419

SN - 9783901882685

BT - Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -