Improvements in Routing for Packet-Switched Networks

Abstract

Adaptive routing algorithms in store-and-forward communication networks are demonstrated to decrease average message delay, to increase message throughput, and to decrease the number of undelivered messages. Comparisons of existing adaptive routing techniques are presented to provide the basis for extension of the theory in two areas: priority assignment for messages reaching an assigned aging threshold, and prevention of messages looping within the network. Optimization of a defined measurement parameter, throughput factor, phi (t,k) is performed in terms of the priority threshold setting k. A closed form solution for phi (t,k) is obtained on a 3-node network assuming infinite buffers and fixed routing. Included are simulations on damaged and undamaged systems for specific inter-connected networks with finite buffers and adaptive routing. Comparisons are made for the predicted phi (t,k) versus the simulated results on an undamaged network.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 18, 1975
Accession Number
ADA006652

Entities

People

  • Caldwell Mccoy Jr.

Organizations

  • United States Naval Research Laboratory

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Buffer Storage
  • Communication Systems
  • Computational Science
  • Computations
  • Computer Communications
  • Computer Networks
  • Computer Programming
  • Computer Science
  • Computer Simulations
  • Computers
  • Markov Chains
  • Mathematical Models
  • Network Science
  • Operations Research
  • Random Variables
  • Stochastic Processes

Fields of Study

  • Computer science

Readers

  • Combustion science or combustion engineering.
  • Computer Networking
  • Structural Health Monitoring of Composite Structures.