+h]-Link Prior Routing Strategy for Double-Loop Network

Abstract

A [+h]-link prior routing strategy,that [+h]-link is chosen prior until it is not favourable,then [+1]-link is chosen,is proposed.The shortest [+h]-link prior path and the bamboo raft(a new kind of L-shaped Tile)for a double-loop network are obtained.There is inferring relationships among nodes in the bamboo raft.The diameter of a double-loop network can be derived from the shortest [+h]-link prior path.VB6.0 and SQL Server2000 are selected to simulate the [+h]-link prior routing strategy.The [+1][+h] routing strategy proposed by the authors is fixing path then seeking nodes,while the [+h]-link prior routing strategy is fixing nodes then seeking path.The traditional L-shaped Tile is difficult to be constructed but is easy to calculate the diameter of its equivalent double-loop network,while the new L-shaped Tile is easy to be constructed but is difficult to calculate the diameter of its equivalent double-loop network.Some mistakes in the paper published by Chen in 2001 are pointed out.