ANALYSIS AND DESIGN OF COMMUNICATION NETWORKS WITH MEMORY

Abstract

A mathematical formulation of the communication networks with memory is presented assuming that the sources of traffic are deterministic but not necessarily time invariant. The formulation leads to a linear programming problem. Some generalizations and justifications of the choice of the model are discussed. The same basic formulation can be used as a tool for analysis as well as least-cost design or improvement of an existing network. Design of th memory systems and its relation with messages with priorities is considered. Similar concepts are used to arrive at an approximate linear programming formulation of street traffic.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1967
Accession Number
AD0806373

Entities

People

  • S. L. Hakimi

Organizations

  • Northwestern University

Tags

Communities of Interest

  • Advanced Electronics
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Communication Networks
  • Computer Programming
  • Contracts
  • Digital Computers
  • Electrical Engineering
  • Electronics
  • Engineering
  • Flow Network
  • Information Processing
  • Linear Programming
  • Military Research
  • Scientific Research
  • Security
  • Statistical Analysis
  • Universities

Readers

  • Computer Networking
  • Operations Research