IEEE International Conference on Communications, 2003. ICC '03.
DOI: 10.1109/icc.2003.1204188
|View full text |Cite
|
Sign up to set email alerts
|

Achieving faster failure detection in OSPF networks

Abstract: Abstract-With the current default settings of the OSPF parameters, the network takes several tens of seconds before recovering from a failure. The main component in this delay is the time required to detect the failure using Hello protocol. Failure detection time can be speeded up by reducing the value of HelloInterval. However, too small a value of HelloInterval will result in an increased chance of network congestion causing loss of several consecutive Hellos, thus leading to false breakdown of adjacency bet… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
81
0
2

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 88 publications
(83 citation statements)
references
References 9 publications
0
81
0
2
Order By: Relevance
“…Goyal et al [65] investigate the impact of topologies and network congestion on optimal HelloInterval for OSPF network through simulation. Basu et al [66] perform experimental study of the stability of OSPF in terms of convergence time, routing load and number of routing flaps.…”
Section: Other Overlay Network Challengesmentioning
confidence: 99%
“…Goyal et al [65] investigate the impact of topologies and network congestion on optimal HelloInterval for OSPF network through simulation. Basu et al [66] perform experimental study of the stability of OSPF in terms of convergence time, routing load and number of routing flaps.…”
Section: Other Overlay Network Challengesmentioning
confidence: 99%
“…In [2], analysis shows that the duration of forwarding disruptions must incorporate the times taken to detect the failure, react to it, propagate the failure notification, re-compute forwarding tables, and the time taken to actually install the changes into the Forwarding Information Base (FIB). IPFRR eliminates the time required by all of these except for the failure detection time, which can be shortened by adjusting protocol parameters [3]. This significantly reduces disruption time, as it allows packets to be re-routed via pre-computed backup paths as soon as the failure is detected.…”
Section: Introductionmentioning
confidence: 99%
“…Since node 6 and 8 are uncovered, link (5,6) and (5,8) are prior to (5,1) . Alternatively to iteration 1, we apply the largest numbered node first rule and select link (5,8) .…”
Section: Heuristic Depth First Searching (Hdfs)mentioning
confidence: 99%
“…Iteration 2: start from node 5 and there are 3 "uncovered" links: (5,8) and (5,6) (5,1), . Since node 6 and 8 are uncovered, link (5,6) and (5,8) are prior to (5,1) .…”
Section: Heuristic Depth First Searching (Hdfs)mentioning
confidence: 99%
See 1 more Smart Citation