Instantaneous recovery of unicast connections in transport networks: Routing versus coding

Babarczi, Péter; Pašić, Alija; Tapolcai, János; Németh, Felicián; Ladóczki, Bence

doi:10.1016/j.comnet.2015.02.010

Cited by 20 publications

(36 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to identify the DAGs (flows) A, B and A ⊕ B we used a stacked MPLS label hierarchy as in [4]: the outer label identifies the DAG, while the other two contain the sequence number of A and B, respectively (or 0 if the flow is not included). Thus, for a successful RFD implementation, the following Network Functions (NFs) are required [5]:…”

Section: Introductionmentioning

confidence: 99%

Robust Network Coding in transport networks

Ladóczki

Fernández

Moya

et al. 2015

2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)

View full text Add to dashboard Cite

Abstract-After several years of ignorance in practice, Network Coding (NC) is gaining more and more attention in wireless networks. On the other hand, performing complex in-network operations requires extra hardware, which is still a real barrier of a widespread deployment of network coding in transport networks. However, recent technological trends, such as Network Function Virtualization, enable the deployment of network coding capable middleboxes at network nodes without complicated hardwareupdate, while Software-defined Networking (SDN) makes it possible to steer traffic to these middleboxes. Furthermore, a practical networking scenario was recently identified -namely the single link failure resilient case when user data can be split into two parts -for which simple coding operation at the edge nodes is sufficient to reach all benefits that network coding can provide. Built on these results, we demonstrate in the GÉANT OpenFlow Facility that network coding can be easily deployed in transport networks and brings real benefits for video streaming and distributed storage use cases.

show abstract

Section: Introductionmentioning

confidence: 99%

Robust Network Coding in transport networks

Ladóczki

Fernández

Moya

et al. 2015

2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)

View full text Add to dashboard Cite

show abstract

“…In order to eliminate signaling from the recovery process, a link failure should be oblivious to the merger node, i.e., the merger has to switch from the failed path autonomously to the operating path. The merger node implementation in [4] solves this issue by tracking of the highest sequence number of the forwarded packets (SEQ F W ). A packet p is only forwarded on the merger's outgoing arc if its sequence number SEQ p is larger than SEQ F W , and it sets SEQ F W = SEQ p upon forwarding.…”

Section: Defining the Delay Of A Routing Dagmentioning

confidence: 99%

“…On one hand, in multi-path routing (or shared path protection approaches [13,6]) we have to wait for the highest delay path to reconstruct user data. On the other hand, the additional redundancy provided by diversity coding ensures that the two lower delay paths determine the delay of the connection (as we can reconstruct user data from arbitrary two of the three routing DAGs with low additional coding complexity owing to the applied simple XOR codes [4]). This may lead to lower overall end-to-end delay for the applications in the failure-less state, and also results lower jitter and differential delay increase caused by protection switching.…”

Section: Defining the Delay Of A Routing Dagmentioning

confidence: 99%

“…1) is crucial to ensure instantaneous recovery [4]. In order to eliminate signaling from the recovery process, a link failure should be oblivious to the merger node, i.e., the merger has to switch from the failed path autonomously to the operating path.…”

Section: Defining the Delay Of A Routing Dagmentioning

confidence: 99%

“…Optimal bandwidth efficiency of dedicated protection approaches with network coding was investigated [4], and it was shown that in order to reach that the user data might be split into arbitrary many parts. Although suitable for a theoretical lower bound, from a practical point of view (e.g., network equipment and management complexity) this can not be implemented.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Pašić

Babarczi

Kő̈rösi

2017

Optical Switching and Networking

Self Cite

View full text Add to dashboard Cite

Survivable routing with instantaneous recovery gained much attention in the last decade, as in optical backbone networks even the shortest disruption of a connection may cause tremendous loss of data. Recently, strict delay requirements emerges with the growing volume of multimedia and video streaming applications, which have to be ensured both before and after a failure. Diversity coding provides a nice trade-off between the simplicity of dedicated protection and bandwidth-efficiency of network coding to ensure instantaneous recovery for the connections. Hence, in this paper we thoroughly investigate the optimal structure of diversity coding-based survivable routing, which has a well-defined acyclic structure of subsequent paths and disjoint path-pairs between the communication end-points. We define the delay of these directed acyclic graphs, and investigate the effect of Qualityof-Service and differential delay bounds on the solution cost. Complexity analysis and integer linear programs are provided to solve these delay aware survivable routing problems. We discuss their approximability and provide some heuristic algorithms, too. Thorough experiments are conducted to demonstrate the benefits of diversity coding on randomly generated and real-world optical topologies.

show abstract

Enhancing Availability for Critical Services

Gomes

Martins

Girão‐Silva

et al. 2020

Computer Communications and Networks

View full text Add to dashboard Cite

This chapter is based on work from COST Action CA15127 ("Resilient communication services protecting end-user applications from disaster-based failures -RECODIS") supported by COST (European Cooperation in Science and Technology). This work is funded by ERDF Funds through the Centre's Regional Operational Program and by National Funds through the FCT -Fundação para a Ciência e a Tecnologia, I.P. under the project CENTRO-01-0145-FEDER-029312. This work was also partially supported by FCT under projects UID/EEA/50008/2019 and UIDB/00308/2020.

show abstract

Instantaneous recovery of unicast connections in transport networks: Routing versus coding

Cited by 20 publications

References 31 publications

Robust Network Coding in transport networks

Robust Network Coding in transport networks

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

Enhancing Availability for Critical Services

Contact Info

Product

Resources

About