This paper presents an approach to connectivity analysis of large computer networks and networks interconnection. The essential feature of the approach is the reformulation of a flat network topology intoa balanced-tree hierarchical (BH) topology, distribution of this topology onto a tree of parallel processing elements and usage of parallel algorithms for connectivity analysis of the reformulated topology. It is shown that the performance of the parallel algorithms is much higher than that of the corresponding sequential algorithms. The parallel algorithms are implemented in a parallel logic programming language CS-Prolog running on a multitransputer network. As an example, a parallel program for connectivity analysis of a 3 level BH topology network is described.
connectivity analysis, parallel algorithms, hierarchical topology, computer networks, parallel logic programming, transputers.
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).