Stability issues in OSPF routing

@inproceedings{Basu2001StabilityII,
  title={Stability issues in OSPF routing},
  author={Anindya Basu and Jon G. Riecke},
  booktitle={SIGCOMM '01},
  year={2001}
}
We study the stability of the OSPF protocol under steady state and perturbed conditions. We look at three indicators of stability, namely, (a) network convergence times, (b) routing load on processors, and (c) the number of route flaps. We study these statistics under three different scenarios: (a) on networks that deploy OSPF with TE extensions, (b) on networks that use subsecond HELLO timers, and (c) on networks that use alternative strategies for refreshing link-state information. Our… Expand

Figures from this paper

Achieving sub-second IGP convergence in large IP networks
TLDR
The authors' measurements and simulations indicate that sub-second link-state IGP convergence can be easily met on an ISP network without any compromise on stability. Expand
A Case Study in Understanding OSPF and BGP Interactions Using Efficient Experiment Design
In this paper, we analyze the two dominant inter- and intradomain routing protocols in the Internet: Open Shortest Path Forwarding (OSPFv2) and Border Gateway Protocol (BGP4). Specifically, weExpand
Experiences with monitoring OSPF on a regional service provider network
TLDR
It is found that information from external routing protocols produces significant levels of instability within OSPF, and the need for new network management tools that can incorporate information from routing protocols is highlighted. Expand
OSPF flooding process optimization
  • M. Pitkanen, M. Luoma
  • Computer Science
  • HPSR. 2005 Workshop on High Performance Switching and Routing, 2005.
  • 2005
TLDR
It is studied how configuring the current OSPF implementations can decrease the duration of convergence period and network design guidelines that lead to a stable operation and to a fast routing convergence are received. Expand
E-CER: An Approach to Deviate Packets during Failure in IP Backbones with OSPF
Link state routing protocols, like OSPF, are used in IP backbones to correctly define the routes. During failure situations, the OSPF process needs a due time to react and find new routes. DuringExpand
Improving Convergence Speed and Scalability in OSPF: A Survey
TLDR
This paper presents a comprehensive survey of significant efforts aimed at improving OSPF's convergence speed as well as scalability and extending O SPF to achieve seamless integration of mobile adhoc networks with conventional wired networks. Expand
E-CER: Recovery Paths to Deviate Packets During a Failure in IP Backbones with OSPF
TLDR
This study proposes a proactive approach named E-CER in order to reduce the OSPF packet loss rate during the reaction time, evaluated in representations of synthetic and real backbone topologies, and also in a network simulator to analyze the reduction of packets loss rate. Expand
A case study of OSPF behavior in a large enterprise network
TLDR
A case study on the eharacteristics and dynamics of LSA traffic for a large enterprise network, which consists of several hundred routers, distributed in tens of OSPF areas, and connected by LANs and private lines. Expand
A Route Flap Suppression Mechanism Based on Dynamic Timers in OSPF Network
TLDR
Simulation results show that a localized approach to suppress the routing flap through dynamically tuning the hello interval of OSPF can achieve better performance in eliminating routing flap and at the same time consume much less computation resources than the network-wide method. Expand
Study on a Fast OSPF Route Reconstruction Method under Network Failures
  • H. Doi
  • Computer Science
  • DCNET/ICE-B/OPTICS
  • 2012
TLDR
This report shows how the proposed fast method of designated router detection by enhanced OSPF reduces the route reconstruction time from 45 sec to 10 or less on O SPF networks. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
Open Shortest Path First (OSPF) Routing Protocol Simulation
TLDR
A simulation of the OSPF Election Protocol shows that when the DR and the BDR fail at the same time, the DR-agreement-time is bounded above by twice the HelloInterval, and reducing the value of the RxmtInterval lowers the bootup-convergence-time at high link speeds. Expand
Towards Milli-Second IGP Convergence
TLDR
This paper presents some analyses of ISIS convergence by showing its behavior upon link/router failures and repairs, and its scaling properties to large networks, both in terms of number of nodes and links, and changes needed in the ISIS specification and implementations to reach IGP convergence in milliseconds. Expand
Routing stability in congested networks: experimentation and analysis
TLDR
The findings demonstrate the importance of selective treatment of routing protocol messages from other traffic, by using scheduling and utilizing buffer management policies in the routers, to achieve stable and robust network operation. Expand
Implementation and performance measurements of QoS routing extensions to OSPF
  • G. Apostolopoulos, R. Guérin, S. Kamat
  • Computer Science
  • IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)
  • 1999
TLDR
An implementation of QoS routing extensions to the open shortest path first (OSPF) routing protocol is discussed and its performance over a wide range of operating conditions is evaluated to establish strong empirical evidence that the cost ofQoS routing is well within the limits of modern technology and can be justified by the performance improvements. Expand
Design and implementation of MaRS: a routing testbed
TLDR
This work has used MaRS to evaluate and compare several next-hop routing algorithms and to facilitate the study of the complex dynamics that arises in routing systems (due to delayed feedback). Expand
Evaluating the overheads of source-directed quality-of-service routing
  • A. Shaikh, J. Rexford, K. Shin
  • Computer Science
  • Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256)
  • 1998
TLDR
This work investigates the fundamental trade-off between network overheads and the quality of routing decisions in the context of the source-directed link-state routing protocols proposed for future IP and ATM networks, and reveals the effects of stale link- state information, random fluctuations in traffic load, and variations of the link-cost metric on the routing and signalling overheads. Expand
Quality of service based routing: a performance perspective
TLDR
Extensions to the basic QoS routing are developed that can achieve good routing performance with limited update generation rates and the impact on the results of a number of secondary factors such as topology, high level admission control, and characteristics of network traffic. Expand
The revised ARPANET routing metric
TLDR
The ARPANET routing metric was revised in July 1987, resulting in substantial performance improvements, especially in terms of user delay and effective network capacity, and a move away from the strict delay metric. Expand
Dynamics of distributed shortest-path routing algorithms
The dynamics of shortest-path routing algorithms bss.ed on distance vectors and link states are investigated. Detailed quantitative comparisons of the distributed Belhnen-Ford algorithm used inExpand
Delayed Internet routing convergence
TLDR
This paper presents a two-year study of Internet routing convergence through the experimental instrumentation of key portions of the Internet infrastructure, including both passive data collection and fault-injection machines at Internet exchange points, and describes several unexpected properties of convergence. Expand
...
1
2
3
4
...