DocumentCode
2743797
Title
Routing in General Incomplete Star Interconnection Network
Author
Chen, Bao-Xing ; Xiao, Wen-jun
Author_Institution
Dept. of Comput. Sci., Zhangzhou Teacher´´s Coll., Zhangzhou
fYear
2008
fDate
6-8 Aug. 2008
Firstpage
237
Lastpage
240
Abstract
In this paper, we propose a new routing algorithm for the general incomplete star interconnection network (GISN). The diameter of GISN is shown to be bounded by 3.5n-5. This improves on a 4n-7 routing algorithm described earlier in Shi Yutao, et al., (2002). We also prove that the diameter of GISN is more than or equals to lfloor3(n-2)/2rfloor+1.
Keywords
graph theory; hypercube networks; network routing; general incomplete star interconnection network; network routing; Artificial intelligence; Computer science; Distributed computing; Educational institutions; Labeling; Multiprocessor interconnection networks; Routing; Software algorithms; Software engineering; Tin; incomplete star graph; interconnection network; routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008. SNPD '08. Ninth ACIS International Conference on
Conference_Location
Phuket
Print_ISBN
978-0-7695-3263-9
Type
conf
DOI
10.1109/SNPD.2008.89
Filename
4617377
Link To Document