Design and Analysis for Area Routing in Large Networks.

Abstract

This report presents the design and analysis of an area routing algorithm for the Defense Data Network. The design is based upon differentiating the network into multiple connected areas. Within a single area, current flat (SPF) routing would be used. For inter area routes, variations on the SPF scheme would be used (as described in the report.) The analysis measures the degree to which non-optimal paths would be developed as a consequence of area routines, restrictions, finding delay increases on the order of 5 - 10% in small (31 mode) network models. The report also examines the utility of guided, adaptive routing for the DDN, by comparative simulations. These show that guided adaptive routing is competitive with flat routing in most network configurations. Keywords include: Computer networks; Routing algorithms; Area routing; and Adaptive routing.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 22, 1986
Accession Number
ADA167619

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Computational Complexity
  • Computer Communications
  • Computer Networks
  • Control Systems
  • Databases
  • Electronic Mail
  • Frequency
  • Network Architecture
  • Network Protocols
  • Network Topology
  • Packet Switching
  • Remote Areas
  • Security
  • Simulations
  • Traffic

Readers

  • Computer Networking
  • Systems Analysis and Design