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

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1983
Accession Number
ADA139147

Entities

People

  • R. R. Logan

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Communication Channels
  • Communication Systems
  • Communications Protocols
  • Computer Communications
  • Computer Simulations
  • Computers
  • Digital Communications
  • Electrical Engineering
  • Network Architecture
  • Network Protocols
  • Network Science
  • Network Topology
  • Packet Switching
  • Routing Protocols
  • Simulations
  • Statistical Analysis

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Systems Analysis and Design