Approximate distributed Bellman-Ford algorithms (computer network routing)
Baruch Awerbuch, Amotz Bar-Noy, M. Gopal · 1991
Routing algorithms based on the distributed Bellman-Ford algorithm (DBF) suffer from exponential message complexity in some scenarios. Two modifications to the algorithm are proposed which result in polynomial message complexity without adversely affecting the response time of the algorithm. However, the new algorithms may not compute the shortest path. Instead, the paths computed can be worse than the shortest path by at most a constant factor (>