The Design of Store-and Forward (S/F) Networks for Computer Communications,

Abstract

The emphasis of this research is on the development of mathematical programming tools for the design of S/F communication networks. An analytical model for the system is first presented and discussed. The design variables (routing of messages, channel capacities, topology, etc.) are then defined and proper design criteria (delay, cost, thruput, etc.) are established and expressed in terms of the variables. Next, various design problems are defined and investigated; the most significant of them here follow: (1) Find the minimum cost channel capacity assignment, given the routing of the messages and the maximum admissible delay T; (2) Find the routing which minimizes the delay, given the channel capacities (and therefore the cost); (3) Find the routing and capacities assignment which minimizes the cost, given the maximum admissible delay T. (4) Find the topology, routing and capacities assignment which minimizes the cost, given the maximum admissible delay T. (Author Modified Abstract)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1973
Accession Number
AD0758704

Entities

People

  • Mario Gerla

Organizations

  • University of California, Los Angeles

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Channel Capacity
  • Communication Networks
  • Computer Communications
  • Computer Programming
  • Computers
  • Design Criteria
  • Mathematical Programming
  • Networks
  • Topology

Readers

  • Graph Algorithms and Convex Optimization.
  • Radio communications and signal processing.
  • Software Engineering