无向双环网络等价生成树及仿真研究  

Equivalen Span-tree of Undirected Double-loop Networks and Its Simulation Research

作　　者：秦飞[1] 刘明[2] 方木云[3] 

机构地区：[1]安徽工业大学管理科学与工程学院,马鞍山243002 [2]安徽工业大学网络中心,马鞍山243002 [3]安徽工业大学计算机学院,马鞍山243002

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

基　　金：安徽省计算与通信软件重点实验室资助项目;安徽省教育厅重大项目(ZD2008005-1)

摘　　要：提出一种新的研究双环网络G(N;±1,±s)的直径求解模型--等价生成树模型,研究了基于该模型的双环网络G(N;±1,±s)寻径策略,给出了等价生成树模型的仿真算法,并研究了等价生成树模型中与路由相关的一些性质。利用C#作为编程语言对等价生成树的结构模型进行了仿真实现.仿真结果表明,利用该模型不仅可在有限时间内求出G(N;±1,±s)的所有直径,而且可方便地得到源结点到所有其他结点的最短路径。A novel rooting model-equivalent span-tree was proposed which was used in the study of undirected double-loop networks.An algorithm to simulate the model of equivalent span-tree was given.Some related characteristics of the routing based on the equivalent span-tree were investigated.The model of equivalent span-tree was simulated using C# successfully.The result shows that all diameters of undirected double-loop networks can be obtained by the model in limited time and the shortest path from the source node to others nodes can be obtained easily.

关 键 词：无向双环网络 等价生成树 仿真 紧优 

分 类 号：O157.9[理学—数学] TP302[理学—基础数学]