计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (35): 62-65.DOI: 10.3778/j.issn.1002-8331.2008.35.019

• 理论研究 • 上一篇    下一篇

关于最优双环网的构造

周建钦1,2,汪文娟2   

  1. 1.杭州电子科技大学 通信工程学院,杭州 310018
    2.安徽工业大学 计算机学院,安徽 马鞍山 243002
  • 收稿日期:2008-05-30 修回日期:2008-09-22 出版日期:2008-12-11 发布日期:2008-12-11
  • 通讯作者: 周建钦

Conformation of optimal double-loop networks

ZHOU Jian-qin1,2,WANG Wen-juan2   

  1. 1.College of Telecommunication Engineering,Hangzhou Dianzi University,Hangzhou 310018,China
    2.School of Computer Science,Anhui University of Technology,Ma’anshan,Anhui 243002,China
  • Received:2008-05-30 Revised:2008-09-22 Online:2008-12-11 Published:2008-12-11
  • Contact: ZHOU Jian-qin

摘要: 在刘焕平等人工作的基础上,给出一个改进的hh≥0)紧优双环网络的构造算法。利用VC++6.0编程来实现这一算法,对任意给定N,找出s(1<s<N)使得双环网络GN;1,shh≥0)紧优。首次给出了N在一亿之内,所有h(0≤h≤7)紧优双环网的个数及对应h的最小N值。并根据实验所得数据,指出Augilo和Fiol的求紧优双环网络算法的不足与错误。

关键词: 双环网络, 直径, 紧优, 算法

Abstract: Double-loop networks have been widely studied as architecture for local area networks.Based on the works of Liu et al.a new algorithm to find h-tight(h≥0) optimal double-loop networks is presented,and is executed with VC++6.0.For any given Ns(1<s<N) can be found,so that GN;1,s) is h-tight(h≥0)optimal.For any N≤108,it’s calculated that the number of h(0≤h≤7)tight optimal double-loop networks and its first N with h(0≤h≤7)tight optimal.According to the results of the experiments,some errors of an efficient algorithm are shown to find optimal double loop networks proposed by Augilo and Fiol.

Key words: double-loop networks, diameter, tight optimal, algorithm