Paper Info
Title
Instantaneous recovery of unicast connections in transport networks: Routing versus coding.
Abstract
The importance of reducing recovery time and latency, e.g., by adding redundancy to the connection is increasing in today’s communication networks. Thus, in this paper we investigate dedicated protection approaches which completely avoid control plane signaling and switching matrix reconfiguration when a network failure occurs, i.e., provide quasi instantaneous recovery from failures. As these approaches may require a huge amount of redundancy, we introduce a dynamic routing framework, called General Dedicated Protection (GDP) which provides optimal resilient capacity allocation against multiple link failures, both for routing and network coding. The computational complexity and a theoretical lower bound for GDP will be presented, too. We show the efficiency of the GDP framework through thorough simulations. Finally, we demonstrate that the necessary modules for GDP can be easily adopted in Software Defined Networks (SDNs) with the help of the OpenFlow protocol. In our proof-of-concept implementation we are following the Network Function Virtualization (NFV) approach, which allows the practical deployment of GDP in transport networks.
Year
DOI
Venue
2015
10.1016/j.comnet.2015.02.010
Computer Networks
Keywords
Field
DocType
Instantaneous recovery,Dedicated protection,Resilient capacity allocation,Network coding,Network function virtualization,Software defined networks
Linear network coding,Telecommunications network,Computer science,Computer network,Redundancy (engineering),OpenFlow,Unicast,Software-defined networking,Control reconfiguration,Computational complexity theory,Distributed computing
Journal
Volume
ISSN
Citations 
82
1389-1286
9
PageRank 
References 
Authors
0.64
22
5
Name
Order
Citations
PageRank
Péter Babarczi19213.47
Alija Pasic2174.18
János Tapolcai336441.42
Felician Németh49013.42
Bence Ladóczki5121.04