Routing algorithm of several kinds of special double-loop networks with unit step
Bian Qiong-fang · Jisuanji gongcheng yu sheji · 2012
The diameter of the solution is the most critical issue of the double loop networks,in order to get the better solution for the double loop network diameter,select a step size of 1 to unit step double loop networks,in allusion to another step h of the value for the minimum value of 2,the middle valueN/2,(N/2+1,(N is even) or the middle value(N+1)/2(N is odd) and maximum value N-1,these three circs constitute the class of double loop networks,routing algorithm are proposed,and analyzes the characteristics of these different kinds of algorithms and comparison,and the temporal and spatial characteristics of these types of algorithms are compared and analyzed.Time complexity degrees and storage complexity degrees are both result in Ω(N/2).