非单位步长双环网络G(N;r,s)的L形瓦仿真算法  

Algorithm to Simulate L-Shaped Tile of Double-loop Networks G(N;r,s) with Non-unit Steps

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

机构地区：[1]中国科学技术大学计算机科学技术系

出　　处：《系统仿真学报》2006年第10期2963-2965,共3页Journal of System Simulation

基　　金：国家自然科学基金项目(60473142);国家973计划项目(2003CB314801)。

摘　　要：计算非单位步长双环网络的直径是通过研究其等价的L形瓦来进行的,随着N的增大和r,s的增多,手工绘制L形瓦是不可能的,为此提出非单位步长双环网络G(N;r,s)的L形瓦仿真算法,对任意给定N,而2=<r≠s<=N-1的这样一族非单位步长双环网络的L形瓦及其参数、紧优性和非强连通性都计算出来,找出了该族非单位步长双环网络L形瓦的分布特点;对任意N,有不少r和s使得G(N;r,s)紧优。The diameter of Double-loop Networks with non-unit steps G（N;r,s） is calculated by studying its equivalent L-Shaped Tile, however as N, r and s increase, it is impossible to draw L-Shaped Tile by hand, therefore, an algorithm to simulate the L-Shaped Tile of such Double-loop Networks was proposed. The L-Shaped Tiles and their parameters, tight optimal and non-strong-connection of such family of Double-loop Networks whose N was given random and r ≠ s varied from 2 to N-1 could be simulated respectively. The shape characters of such family of L-Shaped Tile were obtained; For any given N, many r and s make G（N;r,s） tight optimal.

关 键 词：非单位步长双环网络 仿真 紧优 L形瓦 族 

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