| ¡¡ | Chinese Journal of Computers Full Text |
| Title | £Û+h£Ý-Link Prior Routing Strategy for Double-Loop Network |
| Authors | FANG Mu-Yun1),2) QU Yu-Gui1) ZHAO Bao-Hua1) |
| Address | 1)(Department of Computer Science, University of Science and Technology of China, Heifei 230027) 2)(Department of Computer Science, Anhui University of Technology, Ma¡¯anshan, Anhui 243002) |
| Year | 2008 |
| Issue | No.3(536¡ª542) |
| Abstract & Background | 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. keywords double-loop network; £Û+h£Ý-link prior routing; the shortest £Û+h£Ý-link prior path£» bamboo raft; L-shaped tile background Double loop networks have been widely used in the topological structure of computer interconnection networks and communication systems. Many researches focus on the following two problems: (1) constructing optimal double-loop networks G(N;1,h) and G(N;r,h), and (2) optimal routing algorithms for G(N;1,h) and G(N;r,h). In the past five years, the authors have simulated the L-shaped Tile for G(N;1,h) and G(N;r,h). The authors have proposed £Û+1£Ý£Û+h£Ý routing strategy for directed double loop networks and undirected double loop networks. This paper discusses a £Û+h£Ý-link prior routing strategy, that £Û+h£Ý-link is chosen prior until it is not favourable, then £Û+1£Ý-link is chosen. 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. Chen Zhong-Xue discussed similar work like £Û+1£Ý-link prior routing strategy. Compared to £Û+1£Ý-link prior routing strategy, £Û+h£Ý-link prior routing strategy is well understood and induces a new spatial model called bamboo raft (a new kind of L-shaped Tile). 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. |