Routing in General Incomplete Star Interconnection Network

Authors :: Bao-Xing Chen
Wen-Jun Xiao
Source :: SNPD
Publication Year :: 2008
Publisher :: IEEE, 2008.
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.

Subjects :: Interconnection
Computer science
business.industry
Bounded function
Network routing
Routing algorithm
Graph theory
Destination-Sequenced Distance Vector routing
Star (graph theory)
Routing (electronic design automation)
business
Topology
Computer network

Database :: OpenAIRE
Journal :: 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Accession number :: edsair.doi...........472ef0ce0a0b5ca723c8a9db89a06e86
Full Text :: https://doi.org/10.1109/snpd.2008.89