Indian Journal of Science and Technology
DOI: 10.17485/ijst/2009/v2i11.14
Year: 2009, Volume: 2, Issue: 11, Pages: 37-40
Original Article
V.N. Kamalesh1 and S. K. Srivatsa2
1Dept. of Computer Science & Engg., Sathyabama University;
2St. Joseph College of Engineering, Chennai, India
*Author for the correspondence:
K. Srivatsa
St. Joseph College of Engineering,
Chennai, India
E-mail: [email protected]
The topological design of a computer Abstract communication network assigns the links and link capacities for connecting network nodes within several constraints, with a goal to achieve a specified performance at a minimal cost. A reasonable approach is to generate a potential network topology. This paper presents a spanning tree based method for systematic numbering of nodes in any communication network. When the nodes are numbered in a systematic manner the potential network topology generated will have lesser amount of perturbation before an acceptable network is found.
Keywords: Topological design, Computer, Link deficit algorithm, Wireless network, Minimum spanning tree.
Subscribe now for latest articles and news.