OSPF complete implementation
Stability issues in OSPF routing
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
Exploring Expect
A case study of OSPF behavior in a large enterprise network
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Experiences With Monitoring OSPF on a Regional Service Provider Network
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Achieving sub-second IGP convergence in large IP networks
ACM SIGCOMM Computer Communication Review
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
Information Assurance: Dependability and Security in Networked Systems
Information Assurance: Dependability and Security in Networked Systems
Toward Scalable Routing Experiments with Real-Time Network Simulation
Proceedings of the 22nd Workshop on Principles of Advanced and Distributed Simulation
IP Fast ReRoute: Lightweight Not-Via
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
ROFL: routing as the firewall layer
Proceedings of the 2008 workshop on New security paradigms
SafeGuard: safe forwarding during route changes
Proceedings of the 5th international conference on Emerging networking experiments and technologies
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
Always acyclic distributed path computation
IEEE/ACM Transactions on Networking (TON)
Forwarding devices: From measurements to simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
An efficient algorithm to enable path diversity in link state routing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
OFLOPS: an open framework for openflow switch evaluation
PAM'12 Proceedings of the 13th international conference on Passive and Active Measurement
Parallel dynamic spt update algorithm in OSPF
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
OSPF (Open Shortest Path First) is a widely used intra-domain routing protocol in IP networks. Internal processing delays in OSPF implementations impact the speed at which updates propagate in the network, the load on individual routers, and the time needed for both intra-domain and inter-domain routing to reconverge following an internal topology or a configuration change. An OSPF user, such as an Internet Service Provider, typically has no access to the software implementation, and no way to estimate these delays directly. In this paper, we present black-box methods (i.e., measurements that rely only on external observations) for estimating and trending delays for key internal tasks in OSPF: processing Link State Advertisements (LSAs), performing Shortest Path First calculations, updating the Forwarding Information Base, and flooding LSAs. Corresponding measurements are reported for production routers from Cisco Systems. To help validate the methodology, black-box and white-box (i.e., measurements that rely on internal instrumentation) are reported for a open source OSPF implementation, GateD.