基于二叉树的有向双环网络最优路由算法  

An optimal routing algorithm for directed double-loop network based bintree

作　　者：陈业斌[1] 

机构地区：[1]安徽工业大学计算机学院,安徽马鞍山243002

出　　处：《华中科技大学学报（自然科学版）》2008年第6期43-46,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：安徽省教育厅自然科学基金资助项目(KJ2007B078)

摘　　要：提出了有向双环网络G(N;r,s)路由模型——二叉树模型,给出了一种新的寻径策略——基于二叉树层的寻径策略,以及计算有向双环网络G(N;r,s)直径d(N;r,s)的显式公式,证明了有向双环网络G(N;r,s)的直径等于二叉树模型的树高,研究了二叉树模型中与路由相关的一些性质.与传统的方法相比,本算法提高了系统的寻径效率.A new directed double-loop network G（N; r, s） model, bintree-modal and new routing method based on the layer of bintree were proposed. A simple formula for expressing d（N; r, s） to calculate the diameter of directed double-loop network G（N; r, s） was presented. It was proved that the diameter of directed double-loop network G（N; r, s） equal to the height of bintree-modal. Some characters of bintree-modal about routing were studied. This algorithm is better than traditional ways.

关 键 词：最优路由算法 有向双环网络 二叉树模型 层 紧优 

分 类 号：TP302[自动化与计算机技术—计算机系统结构] O157.9[自动化与计算机技术—计算机科学与技术]