三环网络G(N;s_1,s_2,s_3)的直径及其紧优性  

Diameter and tight optimal of triple-loop networks G(N;s_1,s_2,s_3)

作　　者：陈业斌[1] 李颖[2] 邰伟鹏[1] 

机构地区：[1]安徽工业大学计算机学院,安徽马鞍山243002 [2]马鞍山师范高等专科学校理工系,安徽马鞍山243041

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

基　　金：安徽省高校级自然科学研究重点资助项目(KJ2010A343);安徽省高校级自然科学研究资助项目(KJ2010B454);安徽工业大学青年教师科研资助项目(QZ200916)

摘　　要：根据三环网络的拓扑结构,利用等价树的思想构造出三环网络的最小路径图.研究了等价树的相关性质,以及三环网络的信息传输的最小延迟与等价树层之间的关系,并给出了三环网络直径的计算方法.利用计算机搜索,找到了大量的紧优三环网络,并与紧优双环网络进行了对比,给出了紧优三环网络的分布特性.验证了Aguiló-Gost所给出的三环网络直径的下界.According to the topology structure of the triple-loop networks G（N;s1,s2,s3） and the idea of the equivalent tree, a minimum distance diagram of the triple loop networks was introduced. Characteristic of the equivalent tree was studied, and relationship between the layer of the equivalent tree and the minimum transmission delay about message of triple loop networks was found. Thus, the method to compute the diameter of triple loop networks was given. By computer searching, lots of tight optimal triple loop networks were found, by comparison tight optimal between the double loop networks and the triple loop networks, the distribution about the tight optimal triple loop networks was represented. Finally, the limited bound of the diameter of the triple loop networks presented by Aguiló-Gost was verified.

关 键 词：三环网络 直径 最短路径 最小路径图 紧优 等价树 层 

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