• Publications
  • Influence
Queueing Systems, Volume II: Computer Applications - Leonard Kleinrock
  • W. Chou
  • Computer Science
    IEEE Transactions on Communications
  • 1977
Survivable communication networks and the terminal capacity matrix
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
Connectivity considerations in the design of survivable networks
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]
Topological optimization of computer networks
TLDR
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.
A unified algorithm for designing multidrop teleprocessing networks
TLDR
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.
Topological considerations in the design of the ARPA computer network
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
Optimal design of centralized computer networks
TLDR
An algorithm to select globally optimum link capacities for specified tree structures and a heuristic method for finding low cost tree structures is described.
A Unified Algorithm for Designing Multidrop Teleprocessing Networks
TLDR
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.
The Need for Adaptive Routing in the Chaotic and Unbalanced Traffic Environment
TLDR
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.
Network properties of the ARPA computer network
TLDR
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.
...
1
2
3
4
...