The revised ARPANET routing metric
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Dynamics of distributed shortest-path routing algorithms
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
The synchronization of periodic routing messages
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Dynamics of internet routing information
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Open shortest path first (OSPF) routing protocol simulation
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Distributed, scalable routing based on link-state vectors
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Routing stability in congested networks: experimentation and analysis
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Experimental Study of Internet Stability and Backbone Failures
FTCS '99 Proceedings of the Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing
Evaluating the Overheads of Source-Directed Quality-of-Service Routing
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Experience in black-box OSPF measurement
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A case study of OSPF behavior in a large enterprise network
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Stability and Scalability Issues in Hop-by-Hop Class-Based Routing
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Experiences With Monitoring OSPF on a Regional Service Provider Network
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Detailed Study of IP/ Reconfigurable Optical Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A Case Study in Understanding OSPF and BGP Interactions Using Efficient Experiment Design
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
On the analysis of overlay failure detection and recovery
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast local rerouting for handling transient link failures
IEEE/ACM Transactions on Networking (TON)
How can multi-topology routing be used for intradomain traffic engineering?
Proceedings of the 2007 SIGCOMM workshop on Internet network management
Efficient distributed bandwidth management for MPLS fast reroute
IEEE/ACM Transactions on Networking (TON)
Toward Scalable Routing Experiments with Real-Time Network Simulation
Proceedings of the 22nd Workshop on Principles of Advanced and Distributed Simulation
Multiple routing configurations for fast IP network recovery
IEEE/ACM Transactions on Networking (TON)
Intra-domain routing convergence with centralized control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Overhead reduction in a distributed path management system
Computer Networks: The International Journal of Computer and Telecommunications Networking
Convergence of intra-domain routing with centralized control
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
Computer Networks: The International Journal of Computer and Telecommunications Networking
Theory and new primitives for safely connecting routing protocol instances
Proceedings of the ACM SIGCOMM 2010 conference
c-Through: part-time optics in data centers
Proceedings of the ACM SIGCOMM 2010 conference
Overlay networks and graph theoretic concepts
Network performance engineering
Efficient distributed solution for MPLS fast reroute
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Intra autonomous system overlay dedicated to communication resilience
CRITIS'07 Proceedings of the Second international conference on Critical Information Infrastructures Security
Parallel dynamic spt update algorithm in OSPF
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
FireCol: a collaborative protection network for the detection of flooding DDoS attacks
IEEE/ACM Transactions on Networking (TON)
Sleep modes effectiveness in backbone networks with limited configurations
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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 results are based on a very detailed simulation of a real ISP network with 292 nodes and 765 links.