Abstract: Most Internet routing protocols have one of two algorithms lurking at their core - either Dijkstra's algorithm in the case of link-state protocols or a distributed Bellman-Ford algorithm in ...

Abstract: This paper presents a new mechanism for improving the convergence properties of path vector routing algorithms, such as BGP. Using a route's path information, we develop two consistency ...

Finding the shortest path between two points is one of the most fundamental problems in computer science and mathematics. Graph theory provides an efficient way to model real-world systems such as ...