Date Added: Jul 2011
Fast convergence in Interior Gateway Protocol (IGP) is certainly critical to the widespread deployment of real time applications (such as, VOIP, IPTV, etc.). Many improvements for OSPF (Open Shortest Path First) protocol, such as fast hello and fast flooding, have been proposed to reduce the convergence time of IGP. However, these schemes need to consume a large amount of CPU and memory resources of route processor. In this paper, the authors systemically analyze the limitations of scheduling routing table computation in OSPF by investigating the characterization of link failures collected from real ISP networks.