A loop-free extended Bellman-Ford routing protocol without bouncing effect

  • Authors:
  • C. Cheng;R. Riley;S. P. R. Kumar;J. J. Garcia-Luna-Aceves

  • Affiliations:
  • Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL;Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL;Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL;Network Infomuxion Systems Center, SRI International, 333 Ravenswood Avenue, Menlo Park, CA

  • Venue:
  • SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

Distributed algorithms for shortest-path problems are important in the context of routing in computer communication networks. We present a protocol that maintains the shortest-path routes in a dynamic topology, that is, in an environment where links and nodes can fail and recover at arbitrary times. The novelty of this protocol is that it avoids the bouncing effect and the looping problem that occur in the previous approaches of the distributed implementation of Bellman-Ford algorithm. The bouncing effect refers to the very long duration for convergence when failures happen or weights increase, and the nonterminating exchanges of messages, or counting-to-infinity behavior, in disconnected components of the network resulting from failures. The looping problems cause data packets to circulate and, thus, waste bandwidth. These undesirable effects are avoided without any increase in the overall message complexity of previous approaches required in the connected part of the network. The time complexity is better than the distributed Bellman-Ford algorithm encountering failures. The key idea in the implementation is to maintain only loop-free paths, and search for the shortest path only from this set.