원문정보
초록
영어
Hex-Cell network is one of modern interconnection networks in which the nodes are connected with each other in hexagonal topology. This topology gives its network an attractive characteristic represented by expandability due toits recursive structure. In this paper a new routing algorithm for Hex-Cell network is developed depending on new addressing mode.According to this mode, each node in the Hex-Cell is identified by its level and the node number in that level.Consequently, there is no need to readdress the nodes when extra level or levels are added to the topology.Several experiments were conducted to evaluate the proposed algorithm and compare it with other routing algorithms. The results showed the superiority of the new routing algorithm over the other routing algorithms for Hex-Cell in terms of execution time.
목차
1. Introduction
2. Definition of Hex-Cell network
3. Related Works
4. Proposed Routing Algorithm for Hex-Cell Network
4.1. Proposed Addressing Mode
4.2. Proposed Routing Algorithm
5. Discussion via Examples
6. Experimental Results
6.1. Results Discussion
7. Conclusion and Future Work
References
