论文部分内容阅读
本文针对Ｐｅｒｔｅｌ关于可适应寻径提出的批评［２］进行了深入的探讨，指出其结果的局限性，并进行了相应的改进．我们讨论了具有实际意义的缓冲器有限的情况，并把Ｐｅｒｔｅｌ的模型推广到对称性的Ｔｏｒｕｓ网络上，得出了低维ｋ－ａｒｙｎ－ｃｕｂｅ结构上更全面的结果．本文的工作不是要讨论ＡＲ或ＤＲ孰优孰劣，而着重于在实用的拓扑结构上，对更接近实际的问题进行定量的分析．文中给出了各种前提下相应的模拟结果，以供今后的工程实践参考．
In this paper, Pertel’s critique on adaptive routing [2] is discussed in depth, pointing out the limitations of the results and making corresponding improvements. We discuss the practical case of a finite buffer and extend Pertel’s model to the symmetric Torus network, resulting in more comprehensive results for low-dimensional k-aryn-cube structures. The purpose of this paper is not to discuss which one is better for AR or DR, but to focus on a practical topological structure for quantitative analysis of more realistic problems. The article gives the corresponding simulation results under various preconditions for future reference of engineering practice.