计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (28): 99-101.DOI: 10.3778/j.issn.1002-8331.2009.28.029

• 网络、通信、安全 • 上一篇    下一篇

小世界网络的Cayley图模型

魏长明1,刘 浩2,张连明1,2   

  1. 1.湖南师范大学 物理与信息科学学院,长沙 410081
    2.华南理工大学 计算机科学与工程学院,广州 510641
  • 收稿日期:2009-03-26 修回日期:2009-05-22 出版日期:2009-10-01 发布日期:2009-10-01
  • 通讯作者: 魏长明

Small world network model based on Cayley graph

WEI Chang-ming1,LIU Hao2,ZHANG Lian-ming1,2   

  1. 1.College of Physics and Information Science,Hunan Normal University,Changsha 410081,China
    2.School of Computer Science & Engineering,South China University of Technology,Guangzhou 510641,China
  • Received:2009-03-26 Revised:2009-05-22 Online:2009-10-01 Published:2009-10-01
  • Contact: WEI Chang-ming

摘要: Internet网络中小世界特征的发现激起了学术界对Internet小世界网络的研究热潮。提出了一种基于Cayley图的小世界网络模型(CSWN),该模型具有高聚集性和小网络直径;在分析了该网络模型的一些主要性质后给出了其路由算法;最后通过仿真实验证明了该模型符合小世界网络的特性。

关键词: 小世界网络, Cayley图, 聚集系数, 特征路径长度

Abstract: The property of small-world is discovered in Internet network,which has activized the research upsurge of Internet small-world network in the academia.A model of small-world network based on Cayley graph is proposed,which shows local clustering and low network diameter.Then some main properties of it are analyzed and a routing algorithm is developed.At last,validity of this model is verified by experiment.

Key words: small-world network, Cayley graph, clustering coefficient, characteristic path length

中图分类号: