Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 2001.06c
- /
- Pages.63-66
- /
- 2001
The design of interconnection network using postorder traversal on Fibonacci tree
피보나치 트리에서 후위순회를 이용한 상호 연결망의 설계
Abstract
In this paper, We propose the new interconnection network which is designed to edge numbering labeling using postorder traversal which can reduce diameter when it has same node number with Hypercube, which can reduce total node numbers considering node degree and diameter on Fibonacci trees and its jump sequence of circulant is Fibonacci numbers. It has a simple (shortest oath)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded to Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube.
Keywords