To search, Click below search items.


All Published Papers Search Service


On Some Aspects of Design of Cheapest Survivable Networks


S.Latah, S.K.Srivatsa


Vol. 7  No. 11  pp. 210-211


The goal of topological design of a computer communication network is to achieve a specified performance at a minimal cost. Unfortunately, the problem is completely intractable. A reasonable approach is to generate a potential network topology. One such heuristic for generating a potential network topology is due to Steiglitz, Weiner and Kleitman and is called the link deficit algorithm. This paper presents an unusually cute method for designing a K-connected computer communication network when all the nodes of the network are equispaced and lie on a circle.


Topological design, Computer Networks, link deficit algorithm, K-connected network, starting network, survivable network