三种网络拓扑结构模型图的比较研究

广东工业大学学报 ›› 2008, Vol. 25 ›› Issue (1): 28-32.

三种网络拓扑结构模型图的比较研究

广东工业大学应用数学学院；广东工业大学应用数学学院广东广州510006；广东广州510006；

出版日期:2008-01-01 发布日期:2008-01-01

Comparison Research on Three Kinds of Network Topology Structure Models

(Faculty of Applied Mathematics,Guangdong University of Technology,Guangzhou 510006 China)

Online:2008-01-01 Published:2008-01-01

摘要/Abstract

摘要： 通过对3种网络拓扑结构模型图的定义、图形和性质作比较,找出其共性和不同点,进而对其直径、升位、对称性、无错路由规则等作进一步的比较和探索.特别是对3种网络拓扑图形的无错路由规则的研究,为更好地研究网络的容错路由问题提供了良好的工具.

关键词: 超立方体图；星形图；组合星图；路由规则；

Abstract: The article makes a comparison between the definition,the graph,and the property of three kinds of network topology structure models and finds out their general characters and different aspects.Then it makes a further comparison research on the diameter,the rose,the symmetry and the no wrong routing rules and so on,specially the research to the no wrong routing rules.A good tool is provided to better research on network’s permitting wrong routing.

Key words: hypercube graph； star graph； combination graph； routing rules；

宁嫒嫒；郭大昌； . 三种网络拓扑结构模型图的比较研究[J]. 广东工业大学学报, 2008, 25(1): 28-32.

Ning Ai-ai,Guo Da-chang . Comparison Research on Three Kinds of Network Topology Structure Models[J]. Journal of Guangdong University of Technology, 2008, 25(1): 28-32.

参考文献

[1] 李静力,向永红,陈蔓莉,周永恒. 组合星图的最优生成树[J]. 微电子学与计算机. 2006(09)

[2] 石凤仙. 对两类Cayley图的研究和比较[J]. 上海电力学院学报. 2003(02)

[3] 石凤仙,熊鹏荣,周玉林,朱洪. 星形图上无死锁的路径算法[J]. 计算机学报. 1998(10)

[4] 林毓材,顾震宇,陈玉华. 组合星图的拓扑结构研究[J]. 云南师范大学学报(自然科学版). 1998(02)

[5] 周建强,谢立,孙钟秀. 超立方体上路径算法的无死锁性[J]. 计算机学报. 1995(06)

[1] Akers S B,,Horel D,Krisnamurthy B.The Star graph:An At-tractive Alternative to thencube. Proceedings of the Inter-national Conference on Paralle Processing . 1987

[2] Chiang W K,Chen R J.The(n,k)-star graph:A general-ized star graph. Information Processing Letters . 1995

[3] Chiang W K,Chen R J.Topological properties of the(n,k)-star graph. International Journal of Foundations ofComputer Science . 1998

[4] Chang Jung-Hwan,Jinsoo Kim.Ring embedding in faulty(n,k)-star graphs. ICPADS’O1:Proceedings of the EighthInternational Conference on Parallel and Distributed Sys-tems,99-106,2001 . 2001

[5] Chen Yuh-Shyan,Tai Keng-Sheng.A near-optimal Broad-casting in(n,k)-Star Graphs. SNPD’O0:ACIS Intq Conf onSoft-ware Engineering Applied to Networking and Parallel/Distributed Computing . 2000

[6] Xiang Yong-hong,Zhang De-hai,Xiang Zhang-hong,et al.On lower bound of feedback vertex set of(n,k)-star graph. Journal of Yunnan University . 2006

[7] Yen Sheng-I,Yang Chang-Biau,Chen Hon-Chan.Fault-Tol-erant Routing on the Star Graph with Safety Vectors. IS-PAN’02:Proceedings of the International Symposium onParallel Architecture,Algorithms and Networks May 22-24,2002 . 2002

[8] Latifi S.On the fault -diameter of the star graph. Information Processing Letters . 1993

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed