Accession Number:

ADA059849

Title:

Optimal Routing Within Large Scale Distributed Computer-Communications Networks.

Descriptive Note:

Doctoral thesis,

Corporate Author:

AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OHIO

Personal Author(s):

Report Date:

1978-05-01

Pagination or Media Count:

223.0

Abstract:

This research investigates algorithms which function relatively independent of storage and bandwidth and are therefore adaptable to any size network. The primary tool for demonstrating efficient algorithms lies with simulation. The importance of mathematical techniques, however, cannot be overlooked. Therefore, the initial phase of the research involves the investigation and development of abstract analytical concepts which provide an impetus to the design of the simulator. The approach employs a heuristic searching mechanism which requires that a network be described as a graph using the root-node-leaf notation. The level of the tree is equivalent to the known delay about a network at any particular node. The algorith searches the tree down each leg, evaluating the path from each leaf to the destination node using heuristic information to determine the optimum path. This approach is combined with the classical decomposition-synthesis network evaluation technique to derive a formula for delay. Several heuristic measures applicable to this formula are evaluated by the simulator.

Subject Categories:

  • Computer Programming and Software
  • Computer Hardware
  • Computer Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE