Survivable routing meets diversity coding

Pašić, A and Tapolcai, J and Babarczi, P and Bérczi-Kovács, ER and Király, Zoltán and Rónyai, Lajos (2015) Survivable routing meets diversity coding. In: 14th IFIP Networking Conference. Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015 . Institute of Electrical and Electronics Engineers (IEEE), New York, p. 7145330. ISBN 978-390188268-5 10.1109/IFIPNetworking.2015.7145330

[img] Text
Restricted to Registered users only

Download (374kB) | Request a copy


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. © 2015 IFIP.

Item Type: Book Section
Uncontrolled Keywords: Network routing; Routing problems; Polynomial-time algorithms; Operational complexity; Band-width utilization; Polynomial approximation; Computer system recovery; COMPLEX NETWORKS; Codes (symbols); Algorithms; Transport networks; Survivable routing; fast recovery; diversity coding
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 31 Jan 2016 08:44
Last Modified: 31 Jan 2016 08:44

Update Item Update Item