OSPF routers flood link-state packets to distribute the network topology. When a link fails, the attached routers flood an updated link-state packet. These packets trigger updates to the forwarding tables of potentially all routers inside the network. This process can take from a few hundreds of milliseconds to a few seconds in large networks. The convergence affects the forwarding of data packets as transient micro-loops and black holes can happen while routers update their forwarding tables asynchronously. We leverage ns-3, DCE and the BIRD open-source implementa- tion of OSPF to develop a ns-3 model of an OSPF router. We propose techniques to detect micro-loops and black holes. We report our experience in simulating the convergence of OSPF. We also evaluate the scalability of our model and discuss further work.