Synthesis of a Communication Network

Abstract

A communication network is a set of nodes connected by arcs. Every arc has associated with it a nonnegative number called the branch capacity which indicates the maximum amount of flow that can pass through the arc. A communication network must have large enough branch capacities such that all message requirements (which can be regarded as flows of different commodities) can reach their destinations simultaneously. In general, these requirements vary with time. The present paper gives algorithms for min-cost synthesis of a communication network which is able to handle simultaneous flows of all time periods.