DocumentCode :
3297982
Title :
Numbering of Nodes in a Communication Network
Author :
Kamalesh, V.N. ; Srivatsa, S.K.
Author_Institution :
Dept. of Comput. Sci. & Eng., Sathyabama Univ., Chennai, India
fYear :
2008
fDate :
22-24 Oct. 2008
Firstpage :
86
Lastpage :
93
Abstract :
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 article aims at resolving the eccentricity tie.
Keywords :
computer networks; graph theory; telecommunication network topology; computer communication network; graph theory; link deficit algorithm; network topology; node numbering; Algorithm design and analysis; Communication networks; Computer networks; Computer science; Costs; Delay effects; Fault tolerance; Hardware; Mathematical model; Network topology; Computer network; Eccentricity; Link deficit algorithm; Minimum spanning tree.; Wireless network;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
World Congress on Engineering and Computer Science 2008, WCECS '08. Advances in Electrical and Electronics Engineering - IAENG Special Edition of the
Conference_Location :
San Francisco, CA
Print_ISBN :
978-1-4244-3545-6
Type :
conf
DOI :
10.1109/WCECS.2008.19
Filename :
5233192
Link To Document :
بازگشت