Proactive vs reactive approaches to failure resilient routing

Sanghwan Lee, Yinzhe Yu, Srihari Nelakuditi, Zhi Li Zhang, Chen Nee Chuah

Research output: Contribution to journalConference article

102 Scopus citations

Abstract

Dealing with network failures effectively is a major operational challenge for Internet Service Providers. Commonly deployed link state routing protocols such as OSPF react to link failures through global (i.e., network-wide) link state advertisements and routing table recomputations, causing significant forwarding discontinuity after a failure. The drawback with these protocols is that they need to trade off routing stability and forwarding continuity. To improve failure resiliency without jeopardizing routing stability, we propose a proactive local rerouting based approach called failure insensitive routing (FIR). The proposed approach prepares for failures using interface-specific forwarding, and upon a failure, suppresses the link state advertisement and instead triggers local rerouting using a backwarding table. In this paper, we prove that when no more than one link failure notification is suppressed, FIR always finds a loop-free path to a destination if one such path exists. We also formally analyze routing stability and network availability under both proactive and reactive approaches, and show that FIR provides better stability and availability than OSPF.

Original languageEnglish (US)
Pages (from-to)176-186
Number of pages11
JournalProceedings - IEEE INFOCOM
Volume1
StatePublished - Nov 22 2004
EventIEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies - Hongkong, China
Duration: Mar 7 2004Mar 11 2004

Fingerprint Dive into the research topics of 'Proactive vs reactive approaches to failure resilient routing'. Together they form a unique fingerprint.

  • Cite this

    Lee, S., Yu, Y., Nelakuditi, S., Zhang, Z. L., & Chuah, C. N. (2004). Proactive vs reactive approaches to failure resilient routing. Proceedings - IEEE INFOCOM, 1, 176-186.