Efficient Realization Techniques for Network Flow Patterns

Recently, R. H. Cardwell1 proposed a switched communications network design algorithm for the future stored program control network. The networks under consideration are nonhierarchical in structure and take advantage of traffic noncoincidence in routing. The basic objective of Cardwell's algorithm is to design a minimum cost trunking network which, by using an appropriate routing strategy, can carry the necessary traffic load and, at the same time, meet the required grade of service. In this paper, we describe an extremely efficient method for producing an appropriate routing strategy. One of our original intentions was to develop a mathematical framework into which dynamic routing problems, such as those described later, could be placed. Indeed, it seems likely that the approach used here may be valuable for examining other classes of such routing problems.