基于图论模型的三环网络G(N;1,s,s+1)直径分布算法

Algorithm of Diameter Distribution of Triple-loop Networks G(N;1,s,s+1) Based on Graph Theory Model

针对三环网络,提出一种基于图论模型的直径求解算法。从图论模型出发,以仿真方法得到对于任意给定的N,2sN-2这样一族三环网络的直径,并得出对于任意的N,有一些s使得G(N;1,s,s+1)紧优。利用C++编程计算出三环网络的直径分布图,并分析其直径分布特点。

A diameter solution algorithm based on graph theory model was proposed. With graph theory model and simulation method, the diameters of such family of triple-loop networks, whose N is given random and s varied from 2 to N-2 were calculated. For any given N, some s values make G（N; 1 ,a,a＋1） tight optimal. With C＋＋ diameter distribution sketches of triple-loop network were simulated, and characteristics of them were analyzed.