Fast Proactive Recovery from Concurrent Failures

Hansen, Audun Fosselie; Lysne, Olav; Cicic, T.; Gjessing, Stein

doi:10.1109/icc.2007.28

Cited by 27 publications

(27 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, we embed the flow table compression mechanism to reduce the memory consumption. It cut the table size into about half on 200 nodes network compared to the existing method [4]- [8]. The memory consumption generally increases as the number of backup routes increases, and the number of primary Copyright c 2013 The Institute of Electronics, Information and Communication Engineers routes and backup routes are proportional to the number of flows.…”

Section: Introductionmentioning

confidence: 99%

“…In existing study [4]- [8], backup topology and backup routing table match one-to-one as shown in Fig. 5 (a) and (b).…”

Section: Shared Backup Forwarding Table Creation Algorithmmentioning

confidence: 99%

“…Many algorithms for backup topology design have been proposed [4]- [8]; these involve minimizing the number of backup topologies [5], load-balancing of backup routes [6], [7], and considering multiple failures [8]. In addition, a framework, which constructs multiple routing tables, is standardized by IETF [9].…”

Section: Related Work and Problem Statementmentioning

confidence: 99%

“…Key idea of IP fast rerouting is to precompute backup routes and to perform autonomous local rerouting based on the current IP protocol [1]. IP fast rerouting technologies have widely been studied [4]- [8]. They prepare multiple routing tables, and select a proper routing table in accordance with the network state.…”

Section: Introductionmentioning

confidence: 99%

“…While there are many algorithms for backup topology design [4]- [8], implementation of fast rerouting is not very common; it requires adaptation of commercial hardware to the forwarding function. A framework to accommodate multiple routing tables was standardized by IETF [9], and some vendors implemented it [10].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Autonomous IP Fast Rerouting with Compressed Backup Flow Entries Using OpenFlow

Kamamura

Shimazaki

Hiramatsu

et al. 2013

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYThis paper proposes an IP fast rerouting method which can be implemented in OpenFlow framework. While the current IP is robust, its reactive and global rerouting processes require the long recovery time against failure. On the other hand, IP fast rerouting provides a milliseconds-order recovery time by proactive and local restoration mechanism. Implementation of IP fast rerouting is not common in real systems, however; it requires the coordination of additional forwarding functions to a commercial hardware. We propose an IP fast rerouting mechanism using OpenFlow that separates control function from hardware implementation. Our mechanism does not require any extension of current forwarding hardware. On the contrary, increase of backup routes becomes main overhead of our proposal. We also embed the compression mechanism to our IP fast rerouting mechanism. We show the effectiveness of our IP fast rerouting in terms of the fast restoration and the backup routes compression effect through computer simulations.

show abstract

Section: Introductionmentioning

confidence: 99%

“…In existing study [4]- [8], backup topology and backup routing table match one-to-one as shown in Fig. 5 (a) and (b).…”

Section: Shared Backup Forwarding Table Creation Algorithmmentioning

confidence: 99%