寻找紧优有向双环网络的方法  

Methods to Find Optimal Double-loop Networks

作　　者：陈业斌[1] 李颖[2] 李中奎[1] 

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

出　　处：《系统仿真学报》2011年第5期941-943,949,共4页Journal of System Simulation

基　　金：安徽省高校级自然科学研究重点资助项目(KJ2010A343);安徽省高校级自然科学研究资助项目(KJ2010B454)

摘　　要：首先提出一种L-型瓦的改进算法,对于任意给定的双环网络G(N;r,s),无需生成对应的L-型瓦就能快速得出L-型瓦的四个参数,从而计算出双环网络的直径;其次,从单步长双环网络G(N;1,s)的步长s和结点总数N的关系上入手,寻找最优步长s的分布规律。当步长s在某个范围内变化时,双环网络能得到一个较优的直径,并给出了其直径与其下界的差距。最后,对三种算法的仿真结果进行了分析比较。An improved algorithm about L-shaped tile of double-loop networks G（N;r,s） was proposed at first,by which four parameters of L-shaped tile could be quickly obtained without creating its L-shaped tile,and the diameter could be computed easily.Then,the distribution rule of the optimal step was found by researching on the relationship between the step and the amount of nodes.The double-loop networks could obtain an optimal diameter when the range of the steps might be an interval,furthermore the difference between the diameter and its low limit was given.Finally,comparison and analysis were made in terms of simulation results of three algorithm.

关 键 词：双环网络 直径 L-型瓦 步长 撤网法 紧优 

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