A heuristic teleprocessing network design technique

Authors:
Harold E. Livings;Udo W. Pooch
Affiliations:
-;-
Venue:
ANSS '76 Proceedings of the 4th symposium on Simulation of computer systems
Year:
1976

Citing 3
Cited 1

A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Programming Languages: Boolean matrix methods for the detection of simple precedence grammars

Communications of the ACM
Systems Analysis for Data Transmission

Systems Analysis for Data Transmission

Clustering algorithm for the topological design of hierarchical, multidrop data networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A technique is presented for designing teleprocessing networks on the basis of weighted heuristic partitions of the network nodes. The partitions group the nodes on the basis of common internodal design characteristics related to traffic flow, geographical location, delay and reliability requirements. Weights incorporated into the partition selection process permit adaptive adjustment of the design system based on actual experience gained in designing networks.