Accession Number : ADA139147

Title :   Application of a Distributed Routing Algorithm to a Packet-Switched Communications Network.

Descriptive Note : Master's thesis,


Personal Author(s) : Logan,R R

PDF Url : ADA139147

Report Date : Dec 1983

Pagination or Media Count : 336

Abstract : Two distributed routing procedures based upon the Yen shortest path algorithm are developed for application in a packet-switched communications network. The algorithm uses a unique method in calculating shortest paths based upon the time of arrival of update messages. The first routing procedures uses a proposed 'combination' link weight function having parameters involving both current link queue size and recent history of link utilization. Performance of this procedure is analyzed under a variety of network conditions using computer simulation. A comparison study is done with both a least hop routing protocol and a multiple path static routing protocol. The second routing procedure has a hierarchical structure which offers substantial reductions in routing traffic and memory requirements over the first version when implemented in large networks. The major conclusion is that these routing procedures exhibit robust operating characteristics which are almost optimal in simple situations. (Author)

Descriptors :   *Paths, *Routing, *Packaging, *Communications networks, *Switching circuits, *Computerized simulation, Algorithms, Structural properties, Memory devices, Fortran, Arrival, Distribution, Computer programs, Requirements, Time, Networks, Theses

Subject Categories : Electrical and Electronic Equipment
      Computer Programming and Software
      Computer Hardware
      Computer Systems
      Non-radio Communications

Distribution Statement : APPROVED FOR PUBLIC RELEASE