ON THE TOPOLOGICAL DESIGN OF A COMPUTER-NETWORK

The goal of the topological design of a Computer Communication Network is to achieve a specified performance at a minimal cost. Unfortunatel y, the problem is completely intractable. A reasonable approach is to generate a potential network topology. One heuristic for generating a potential network topology is due to Steiglitz, Weiner and Kleitman. T his heuristic begins by numbering the nodes at random. This paper pres ents a systematic method for numbering the nodes. When the nodes are n umbered in a systematic manner, the potential network topology generat ed will need lesser amount of perturbation before an acceptable networ k is found.