![]() TOPTRACKER TRACKING INTERVAL UPDATEThe key contribution of DIV, besides its ability to operate with any routing algorithm, is an update mechanism using simple message exchanges between neighboring nodes that guarantees loop-freedom at all times. We present a new algorithm, Distributed Path Computation with Intermediate Variables (DIV), which can be combined with any distributed routing algorithm to guarantee that the directed graph induced by the routing decisions remains acyclic at all times. Keywords- Routing, OSPF, black-box measurements, SPF calculation I.ĭistributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. 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. Corresponding measurements are reported for production routers from Cisco Systems. In this paper, we present blackbox 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. 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. 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 intradomain and inter-domain routing to reconverge following an internal topology or a configuration change. ![]() OSPF (Open Shortest Path First) is a widely used intra-domain routing protocol in IP networks. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |