Accession Number:

ADA021439

Title:

Communication Networks: Delay-Capacity Functions and Reliable Topological Structures,

Descriptive Note:

Corporate Author:

CALIFORNIA UNIV LOS ANGELES DEPT OF SYSTEM SCIENCES

Personal Author(s):

• Rubin,Izhak

Report Date:

1975-11-01

Pagination or Media Count:

62.0

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 networks 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.

Descriptors:

• *COMMUNICATIONS NETWORKS
• *NETWORK FLOWS
• MATHEMATICAL MODELS
• TOPOLOGY
• ROUTING
• MESSAGE PROCESSING
• THEOREMS

Subject Categories:

• Non-Radio Communications

Distribution Statement:

APPROVED FOR PUBLIC RELEASE