Composite routing protocols

  • Authors:

  • Arora; Gouda; Herman

  • Affiliations:

  • Dept. of Comput. Sci., Texas Univ., Austin, TX, USA;Dept. of Comput. Sci., Texas Univ., Austin, TX, USA;Dept. of Comput. Sci., Texas Univ., Austin, TX, USA

  • Venue:
  • SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

A novel routing protocol for computer networks is designed by combining two routing protocols that adapt to changes in the network topology. The first routing protocol is expensive to operate but yields shortest-paths in the networks; therefore, it is best used when changes in the network topology are rare. The second routing protocol is not as costly to operate, but may yield longer paths; hence, it is best used when changes in the network topology are frequent. By combining these two protocols, the resulting protocol has a wide domain of applicability that does not depend on the frequency of changes in the network topology.