文章基本信息

标题：On Some Aspects of Design of Cheapest Survivable Networks
作者：S.Latah ; S.K.Srivatsa
期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2007
卷号：7
期号：11
页码：210-211
出版社：International Journal of Computer Science and Network Security
摘要：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