2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing Routing in General Incomplete Star Interconnection Network August 06-August 08 ISBN: 978-0-7695-3263-9
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SNPD.2008.89
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.??We also prove that the diameter of GISN is more than or equals to $ \lfloor \frac{3(n-2)}{2}\rfloor+1$.
Index Terms:
interconnection network, incomplete star graph, routing
Citation:
Bao-Xing Chen, Wen-Jun Xiao, "Routing in General Incomplete Star Interconnection Network," snpd, pp.237-240, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||