On the Assignment of Node Number in a Computer Communication Network
暂无分享,去创建一个
The link deficit algorithm proposed by Steigletiz, Weiner and Kletman is a heuristic to generate a potential network topology. This heuristic begins by numbering the nodes at random. If the nodes are numbered in a systematic manner, the link deficit algorithm yields a starting network which needs relatively lesser amount of perturbation before an acceptable network is found. Few methods for systematic numbering of nodes in a computer communication network have been proposed in the literature. Earlier we have proposed two graph theory based method for systematic numbering of nodes in a computer communication network. The nodes are numbered based on the eccentricity values. However the nodes having the same eccentricity values will end up in a tie. This paper aims to resolve the eccentricity tie.
[1] Junming Xu. Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.
[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[3] S. K. Srivatsa,et al. On the Topological Design of a Computer Network , 1995, Comput. Networks ISDN Syst..
[4] D. West. Introduction to Graph Theory , 1995 .
[5] K. Steiglitz,et al. The Design of Minimum-Cost Survivable Networks , 1969 .