摘要： 通过建立一个ｎ×ｎ二维总线网络上的消息传递模型，分析了基于总线网络的确定寻径算法性能，得出了任何基于ｎ×ｎ二维总线网络的确定寻径算法都至少需要１．５ｎ步的结论。并由此推广到多维总线网络，得出结点总数为Ｎ的δ维总线网络上的确定寻径算法需要步。

关键词: 总线网络, 寻径算法, 消息传递模型

Abstract: In this article, oblivious routing algorithms on the mesh of buses is discussed by building a model of message-delivering on n×n two -dimensional mesh of buses. And the conclusion of any oblivious routing on mesh of buses needs 1.Sn steps is proved. Similarly to it, on δ- dimensional mesh of buses it needs ~ steps.

中图分类号: 

• TP393.03