论文部分内容阅读
路由问题已经在很多网络中进行了研究,例如移动Ad Hoc网络,Cube-Connected循环网络、无线和无线电网络,全光网络和可重构网格等等。其中一个最优的路由算法在全双工模式下的2-循环图中。文章介绍了一个在全双工六角排列路由网络的最优算法,并给出一个类似方形网络的相似证明算法,还介绍了六边形网络的两个近似算法。
Routing problems have been studied in many networks, such as Mobile Ad Hoc Networks, Cube-Connected Circular Networks, Wireless and Radio Networks, All-Optical Networks and Reconfigurable Grids. One of the best routing algorithms is in a 2-cyclic graph in full-duplex mode. This paper presents an optimal algorithm for routing networks in full duplex hexagons and gives a similar proof algorithm for square networks, and also introduces two approximation algorithms for hexagonal networks.