To improve the efficiency of irregular network routing algorithm, a new routing algorithm-multi-tree routing algorithm is presented. It avoids the original routing algorithm's drawback, and parametric equalization the network utilization of each channel, reducing the average path length of the routing table. At the same time, the algorithm can effective deadlock recovery while a deadlock occurs. It solves some problem such as channel load, channel utilization is low, the problem of the routing table of the average path length is too long. Results of the simulation indicate the multi-tree routing algorithm is more efficient in irregular networks.%为了提高不规则网络拓扑结构的路由效率,提出了一种新型路由算法-多棵树路由算法.考虑了原始路由算法的不足,平均了网络中各个通道的利用率,降低路由表的平均路径长度,同时在死锁发生时能够及时有效的进行死锁恢复,解决了先前路由算法中通道负载集中、通道利用率低、路由表平均路径长度过长的问题.通过模拟真实硬件环境的模拟器软件,表明了在不同规模、不同负载下的不规则网络下多棵树路由算法具有更高的效率.
展开▼
