The problem of constructing networks that are "survivable" with respect to branch damage is considered. A square redundancy matrix R = [r_{i,j}] is specified. Algorithms are given to construct a… Expand

The problem of constructing networks that are "survivable" with respect to branch damage is considered. The networks are modeled by linear graphs and a square symmetric "redundancy" matrix R'=[r'_ij]… Expand

A number of approaches to the topological design problem are presented; areas where further research is needed are indicated; possible approaches to several unsolved problems are suggested.Expand

It is pointed out that all of these algorithms fall into the class of minimum spanning tree problems, constrained by traffic or response time requirements, and most of the algorithms can be unified into a modified Kruskal'sminimum spanning tree algorithm.Expand

The ARPA Network will provide store-and-forward communication paths between a set of computer centers distributed across the continental United States. The message handling tasks at each node in the… Expand

An algorithm to select globally optimum link capacities for specified tree structures and a heuristic method for finding low cost tree structures is described.Expand

This paper points out that all of these heuristic algorithms fall into the class of minimum spanning tree (MST) problems, constrained by traffic or response time requirements, and most of the algorithms can be unified into a modified Kruskal's MST algorithm.Expand

This study concludes that a well-chosen deterministic strategy is better forbalanced traffic; both deterministic and adaptive procedures are appropriate for balanced traffic with surge; and a well -chosen adaptive strategy is preferred for the unbalanced and chaotic conditions.Expand

A number of important properties of the network are discussed, including ARPANET growth, performance sensitivity to traffic variations, incremental costs for adding capacity and new sites, peak throughput costs, and network reliability.Expand