Accession Number:

ADA136183

Title:

An Iteration Algorithm for Optimal Network Flows.

Descriptive Note:

Master's thesis,

Corporate Author:

NAVAL POSTGRADUATE SCHOOL MONTEREY CA

Personal Author(s):

Report Date:

1983-09-01

Pagination or Media Count:

85.0

Abstract:

A packet switching network has the desirable feature of rapidly handling short bursty messages of the type often found in computer communication systems. In evaluating packet switching networks, the average time delay per packet is one of the most important measures of performance. The problem of message routing to minimize time delay is analyzed here using two approaches, called successive saturation and max-slack, for various traffic requirement matrices and networks with fixed topology and link capacities. Author

Subject Categories:

  • Electrical and Electronic Equipment
  • Non-Radio Communications

Distribution Statement:

APPROVED FOR PUBLIC RELEASE