An Iteration Algorithm for Optimal Network Flows.

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1983
Accession Number
ADA136183

Entities

People

  • C. J. Woong

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Communication Systems
  • Computer Communications
  • Computer Programming
  • Computers
  • Digital Communications
  • Electrical Engineering
  • Engineering
  • Linear Programming
  • Mathematical Analysis
  • Mathematical Models
  • Mathematical Programming
  • Notation
  • Operations Research
  • Packet Switching
  • Switching
  • Topology

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Operations Research