On some aspects of topological design of computer networks

Abstract

The goal of the topological design of a computer newlinecommunication network is to achieve a specified performance at a minimal newlinecost Unfortunately an exact algorithm to solve this problem is exponential in newlinebehavior So a reasonable approach is to generate a potential network newlinetopology In the heuristic given by Steiglitz Weiner and Kleitman for newlinegenerating a potential network topology the nodes of the network are newlinenumbered at random It has been shown that if the number of nodes in a newlinecomputer communication network does not exceed four any arbitrary newlinenumbering of the nodes will give rise to the same starting network newline newline