Routing in General Incomplete Star Interconnection Network
Baoxing Chen, Wen-Jun Xiao · 2008
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.