检索
E-mail
RSS
作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (6): 272-273.doi: 10.3969/j.issn.1000-3428.2011.06.094

• 开发研究与设计技术 • 上一篇    下一篇

无向双环网络G(N;±r,±s)的图形仿真算法

刘 辉 1，许发信 2，方木云 1，杭婷婷 1   

  1. (1. 安徽工业大学计算机学院，安徽 马鞍山 243002；2. 马钢股份有限公司重型机械设备制造公司，安徽 马鞍山 243000)
  • 出版日期:2011-03-20 发布日期:2011-03-29
  • 作者简介:刘 辉(1979－)，男，硕士，主研方向：网络拓扑，计算机仿真；许发信，工程师；方木云，教授、博士；杭婷婷，硕士研究生
  • 基金项目:
    安徽省教育厅基金资助重大项目(ZD2008005-1)

Graph Simulation Algorithm for Bidirectional Double-loop Networks G(N;±r,±s)

LIU Hui 1, XU Fa-xin 2, FANG Mu-yun 1, HANG Ting-ting 1   

  1. (1. School of Computer, Anhui University of Technology, Maanshan 243002, China; 2. Heavy Machinery Company of Magang Cooperation, Maanshan 243000, China)
  • Online:2011-03-20 Published:2011-03-29

PDF

941

被引次数

15

摘要： 传统的L形瓦仿真方法无法直接用于研究无向双环网络。针对上述问题，将直角坐标系引入无向双环网络中，提出一种新的图形仿真算法。利用该算法可以快速仿真出无向双环网络G(N;±r,±s)的图形，同时标注其直径、平均距离及节点的具体分布。通过研究仿真图形，得出单位步长无向双环网络G(N;±r,±s)直径、平均距离的分布规律。

关键词: 无向双环网络G(N, ±r, ±s), 直角坐标系, 图形仿真算法, 直径, 平均距离

Abstract: Traditional L-shaped tile simulation method is usually used to researching unidirectional double-loop networks, and can not be used in the bidirectional double-loop networks directly. In order to solve the problem, this paper presents a fast simulation algorithm based on cartesian coordinates, which is used in the research of the bidirectional double-loop networks. By using the algorithm, the graph of the bidirectional double-loop networks G(N;±r,±s) for any given N, s can be simulated, and the diameter, the average distance, including each node are signed on the graph. Simulation result indicates that the characteristic of distribution of diameter and the average distance is clear.

Key words: bidirectional double-loop networks G(N;±r,±s), cartesian coordinates, graph simulation algorithm, diameter, average distance

中图分类号: