Indian Journal of Science and Technology

Open Access Open Access  Restricted Access Subscription Access

Node numbering in a topological structure of interconnection network


Affiliations
1 Dept. of Computer Science & Engg., Sathyabama University, India
2 St. Joseph College of Engineering, Chennai, India
 

The topological design of a computer 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
User

  • Aho AV, Hopcroft JE and Ullman JD (1974) Design and analysis of computer algorithms. Addison – Wesley, Massachusett.

  • Andrew S. Tanenbaum (1987) Computer networks, Prentice Hall, Englewood Cliffs

  • Douglas B. West (2001) Introduction to graph theory. Pearson Education Inc., 2nd Ed

  • Gerla M, Frank H and Eckl J (1974) A cut saturation algorithm for topological design of packet switched communication networks, Proc. NTC., pp. 1074-1085.

  • Henzinger M, Rao S and Gabow H (2000) Computing vertex connectivity, new bounds from old techniques. J. Algorithms. 34 (2), 222-250.

  • Junming Xu (2002) Topological structure and analysis of interconnection networks. Kluwer Academic Publ.

  • Kamalesh VN and Srivatsa SK (2007) Numbering of nodes in computer communication networks: A brief review. Natl. Conf. on Adv. Network Technol. & Security Issues, FISAT, Cochin, Kerala, India, 8th to 10th August. pp: 278-282.

  • Kamalesh VN and Srivatsa SK (2007) On topological design of computer communication network: A graph theoretical approach. GESTS: Techniques, December.

  • Kamalesh VN and Srivatsa SK (2009a) On the design of minimum cost survivable network topologies. 15th Natl. Conf. on Commun., IIT Guwahati, India, 16- 18th Jan. pp: 394-397.

  • Kamalesh VN and Srivatsa SK (2009b) Topological design of minimum cost survivable computer communication networks: Bipartite graph method. The Intl. J. Compu. Sci. Info. Security. 3 (July), 375-378.

  • Latha S and Srivatsa SK (2007) Topological design of a k- connected network. WSEAS Transact. on Commun. 6 (4), 657-662.

  • Lavia A and Manning EG (1975) Pertubation techniques for topological optimization of computer networks. Proc. Fourth Data Commun. Symp. pp: 4.16-4.23.

  • Srivatsa SK and Seshaiah P (1995) On yopological design of a computer networks. Compu. Networks & ISDN Sys. 27, 567-569.

  • Steiglitz K, Weiner P and Kleitman DJ (1969) The design of minimum cost survivable network. IEEE Trans. Circuit Theory. pp:455-460.


Abstract Views: 735

PDF Views: 100




  • Node numbering in a topological structure of interconnection network

Abstract Views: 735  |  PDF Views: 100

Authors

V. N. Kamalesh
Dept. of Computer Science & Engg., Sathyabama University, India
S. K. Srivatsa
St. Joseph College of Engineering, Chennai, India

Abstract


The topological design of a computer 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

References





DOI: https://doi.org/10.17485/ijst%2F2009%2Fv2i11%2F29534