Communication networks: Delaycapacity functions and reliable topological structures
Abstract
A storeandforward communication network is considered. The network is represented as a linear graph with line capacity weights and Poisson terminal message streams. A maximal messagedelay measure is chosen as the network's delay criterion. Considering the capacity assignment problem, the product of a prescribed network maximal messagedelay and the associated minimal overall network capacity (bandwidth) is shown to be separated into the sum of two terms. The first term involves the overall internal traffic flow. The second one, called the DelayCapacity product number, depends only on the routing discipline and the topological structure of the network, and yields the delaycapacity product for a reduced capacityassignment problem.
 Publication:

NASA STI/Recon Technical Report N
 Pub Date:
 November 1975
 Bibcode:
 1975STIN...7629479R
 Keywords:

 Communication Theory;
 Network Synthesis;
 Topology;
 Linear Systems;
 Mathematical Models;
 Messages;
 Time Lag;
 Communications and Radar