摘要
提出一种先走[+h]边、当走[+h]边不利时才走[+1]边的[+h]边优先寻径策略;得出[+h]边优先最短路径和双环网络的"竹筏"(一种新L形瓦)型空间解;"竹筏"中节点之间的[+h]边优先最短路径存在递推关系;由节点的[+h]边优先最短路径推出双环网络的直径公式;利用VB6.0和SQLServer2000仿真了[+h]边优先寻径策略;作者曾提出的[+1][+h]双边寻径策略是固定路径,寻找节点,而[+h]边优先寻径策略是固定节点,寻找路径;传统L形瓦难以构造但易求其等价双环网络的直径,而新L形瓦易构造但难以求其等价双环网络的直径;指出了陈忠学文中的几个错误.
A [＋h]-hi-link prior routing strategy, that [＋h]-link is chosen prior until it is not favourable, then [＋h]-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.
出处
《计算机学报》
EI
CSCD
北大核心
2008年第3期536-542,共7页
Chinese Journal of Computers
基金
国家自然科学基金项目“紧优双环网络及其无限族的研究”(60473142)
安徽省计算与通信软件重点实验室资助项目
安徽省教育厅重大项目(ZD2008005-1)资助
