InfiniBand架構是一個作為伺服器輸入輸出或是伺服器間通訊用的相互連接網路標準，它定義了一個能支援任意拓樸並且以交換機和點對點連結為基礎的網路。InfiniBand網路中的路由是根據在每個交換機中的轉送表來完成的，轉送表只考慮一個封包的目的地位址來決定此封包將被轉送到的輸出埠。但是很多非規則路由演算法需要同時考慮封包的目的地位址和輸入埠，造成這些非規則路由演算法因為不符合InfiniBand轉送表的格式而不能使用在InfiniBand網路上。InfiniBand轉送表有兩種格式：線性轉送表(Linear forwarding table)以及隨機轉送表(Random forwarding table)。在這篇論文中，我們提出一個分成兩階段且部分重新命名的方法，根據需要同時考慮封包的目的地位址和輸入埠的非規則路由演算法去建造符合InfiniBand格式的無死結隨機轉送表。這個方法更有效率、造成較少的轉送表負擔、並且不會更改到原本的路由演算法所計算出的路徑，以保持路由演算法的特性。
為了評估我們所提出的方法，我們在模擬器上比較了我們的方法和原有的重新命名方法。我們量測兩種方法在不同的網路尺寸以及不同的交換機設定時，所造成的轉送表負擔以及計算時間。模擬的結果顯示在所有的測試個案中，我們的方法只需使用較少的計算時間及較少轉送表負擔就可以完成InfiniBand上隨機轉送表的建置。

The InfiniBand architecture (IBA) is an interconnect network standard designed for server I/O and inter-server communication. The IBA defines a switch-based network with point-to-point links to support arbitrary topology. Routing in an IBA network is based on the forwarding table stored in each switch. The forwarding table forwards packets to output ports by only considering the destination addresses of packets. However, the forwarding tables computed by many irregular routing algorithms consider both the input port and the destination address of the packet. Therefore, these irregular routing algorithms can not be used in IBA network because they do not conform to the IBA forwarding table format. There are two types of IBA forwarding table: Linear forwarding table (LFT) and Random forwarding table (RFT). In this thesis, we propose a two-phase method, partial renaming method, to construct the deadlock-free RFT according to the paths computed by any irregular deadlock-free routing algorithm which considers both the input port and the destination address. The partial renaming is an efficient and low overhead forwarding table construction method for IBA. The forwarding tables constructed by the partial renaming method do not modify the original paths computed by the routing algorithm before. This reserves the characteristic of the original routing algorithm. To evaluate the proposed method, we compare our method with the renaming scheme on a simulator. We evaluate the forwarding table overhead and the computation time of both methods in different network size and different switch settings. The simulation results show that the computation time and the size of forwarding table introduced by our method are much less than those introduced by the renaming scheme in all test cases

[1] L. Cherkasova, V. Kotov, and T. Rokicki, “Fibre channel fabrics: Evaluation and design,” in Proc. of 29th Int. Conf. on System Sciences, Feb. 1995.
[2] J. Duato, “A new theory of deadlock-free adaptive routing in wormhole networks,” IEEE Trans. on Parallel and Distributed Systems, vol. 4, no. 12, pp. 1320-1331, Dec. 1993.
[3] J. Duato, “An Efficient Methodology for the Implementation of Up*/Down* Routing on InfiniBandTM Networks,” Tech. Report, DISCA, UPV, Jan. 2001.
[4] W. J. Dally and C. L. Seitz, “Deadlock-free message routing in multiprocessors interconnection networks,” in IEEE Trans. on Computers, vol C-36, no. 5, pp. 547-553, May 1987.
[5] C. J. Glass and L. M. Ni, “The Turn Model for Adaptive Routing,’ J. ACM, Vol. 41, No. 5, pp. 874-902, Sept. 1994.
[6] InfiniBandTM Trade Association, InfiniBandTM Architecture. Specification Volume 1. Release 1.0. Available at http://www. infinibandta. com.
[7] A. Jouraku, A. Funahashi, H. Amano, and M. Koibuchi, “L-turn routing: An Adaptive Routing in Irregular Networks,” the International Conference on Parallel Processing, pp. 374-383, Sep. 2001.
[8] P. L´opez, J. Flich, and J. Duato, “Deadlock-free Routing in InfiniBandTM through Destination Renaming” in Proceedings of the International Conference on Parallel Processing, 2001
[9] M. D. Schroeder, A. D. Birrell, M. Burrows, H. Murray, R. M. Needham, T. L. Rodeheffer, “Autonet: A high-speed, self-configuring local area network using point-to-point links,” Tech. Report SRC research report 59, DEC, April 1990.
[10] Y. M. Sun, C. H. Yang, Y. C. Chung, and T. Y. Huang, “An Efficient Deadlock-Free Tree-Based Routing Algorithm for Irregular Wormhole-Routed Networks Based on the Turn Model,” IEEE Proceedings of International Conference on Parallel Processing (ICPP 2004), Canada, August 2004, pp. 343-352.