Communication Networks: Delay-Capacity Functions and Reliable Topological Structures,
Abstract
A store-and-forward communication network is considered. The network is represented as a linear graph with line capacity weights and Poisson terminal message streams. A maximal message-delay measure is chosen as the network's delay criterion. Considering the capacity assignment problem, the product of a prescribed network maximal message-delay 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 Delay-Capacity product number, depends only on the routing discipline and the topological structure of the network, and yields the delay-capacity product for a reduced capacity-assignment problem.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1975
- Accession Number
- ADA021439
Entities
People
- Izhak Rubin
Organizations
- University of California, Los Angeles