双环网络G(N;1,s)的L形瓦仿真算法  

An Algorithm to Simulate the L-Shaped Tile of Double-loop Networks G(N;1,s)

作　　者：方木云[1,2] 赵保华[1] 屈玉贵[1] 

机构地区：[1]中国科学技术大学 [2]安徽工业大学计算机学院,安徽马鞍山243002

出　　处：《系统仿真学报》2005年第4期914-916,共3页Journal of System Simulation

基　　金：国家自然科学基金项目(60473142)

摘　　要：提出双环网络G(N;1,S)的L形瓦仿真算法,利用VB6.0作为编程语言、SQL Server2000作为数据库来实现这一算法,对任意给定N,而2=<S<=N-1的这样一族双环网络的L形瓦和参数都可以得出来。找出了该族双环网络L形瓦分布特点(由矩形逐渐变成典型的L形瓦)和直径的分布特点(具有最大值、最小值和中间对称性);对任意N,有不少s使得G(N;1,s)紧优。An Algorithm to simulate the L-Shaped Tile of Double-loop Networks G(N;1,s) is presented, and is executed with VB6.0 serving as programming language and SQL Server2000 serving as Database. The L-Shaped Tile and parameter of such family of Double-loop Networks whose N is given random and s varied from 2 to N-1 can be simulated and calculated respectively. The L-Shaped Tile of such family of Double-loop Networks has such characters (from rectangle to L-Shaped Tile) and the diameter of such family of Double-loop Networks has such characters (maximum values, minimum values, and symmetry). For any given N, many s make G(N;1,s) tight optimal.

关 键 词：双环网络 仿真 紧优 L形瓦 族 

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