一类层次双环网络的构造及其路由算法  

Hierarchical network HDRN and its routing algorithms

作　　者：杜艳[1] 刘方爱[1] 邢长明[1] 

机构地区：[1]山东师范大学信息科学与工程学院,济南250014

出　　处：《计算机工程与应用》2010年第34期74-76,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60373063;No.90612003);山东省自然科学基金(No.Y2007G11)~~

摘　　要：高效互联网络的拓扑结构一直是人们关注的热点问题。提出了一类层次双环互联网络HDRN(k),给出了HDRN(k)网络的构造方法,研究了它的性质,并且通过与相关网络的比较,证实了HDRN(k)具有好的连接性、短的直径以及简单的拓扑结构,是一种实用的互联网络。另外,讨论了HDRN(k)网络的路由性质,设计了点点路由和Broadcast路由算法,证明了这两种路由算法的通信效率与层次环网络上对应算法的通信效率相比均有明显的提高。综上所述,HDRN(k)是一种具有良好拓扑性质的新型互联网络。The topology of efficient interconnection network is always a hot issue for people.In this paper,a new kind of hierarchical double ring networks,HDRN（k）, is proposed, on the basis of hierarchical interconneetion networks.The construction and properties of HDRN（k） are investigated.Compared with the topological properties of other networks,it shows that HDRN（k） is practical with good connectivity, short diameter and simple topology.Then,the routing strategies of HDRN（k） are discussed and two routing algorithms, point-to-point and broadcast, are designed.It proves that the communication efficiency of these two routing algorithms is improved obviously than the algorithms on the HRN network.Therefore,HDRN（k） is a new kind of network,with good topological properties.

关 键 词：互联网络 拓扑结构 层次双环网络 路由算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]