Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Composite Routing Protocols Anish Arora, Mohamed Gouda and Ted Herman
 

Summary: Composite Routing Protocols
Anish Arora, Mohamed Gouda and Ted Herman
Department of Computer Sciences
University of Texas at Austin
Austin, Texas 78712{1188
May 1990
Abstract
A novel routing protocol for computer networks is designed by com-
bining two routing protocols that adapt to changes in the network
topology. The rst 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 applicabil-
ity that does not depend on the frequency of changes in the network
topology.
Keywords: adaptive routing, multi-phase protocols, self-stabilization,
shortest-paths, spanning trees.

  

Source: Arora, Anish - Department of Computer Science and Engineering, Ohio State University

 

Collections: Computer Technologies and Information Sciences