Make Highly Clustered Grid a Small World with Shorter Diameter
Grid is becoming an interesting and challenging environment supporting both old and new services for cooperative applications, which promote individual enterprises engaged in a collaborative community.This cooperation pressure results in an increased focus on the interconnection of member enterprises within virtual organization that necessitates the new highly scalable networking technology. Accordingly,this paper proposes the small world community for collaborative enterprises through randomly exchanging neighbors in an initially fixed regular graph. We discuss the community maintenance algorithm such as member joining and leaving, and give related complexity analysis. We also show this small world community network is high clustering,short diameter and highly scalable. Finally, we empirically evaluate the algorithm by some simulation experiments.
Shaohua Liu Junsheng Yu Yuanan Liu Jun Wei Peng Gao Wei Li Jiani Ma
School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing Institute of Software, Chinese Academy of Sciences, Beijing, China China Mobile Group Design Institute Co., Ltd, Beijing, China China Telecommunication Technology Labs, Beijing, China School of Political Science & International Studies, Beijing Normal University, Beijing, China
国际会议
第六届网格与协同计算国际会议(The Sixth International Conference on Grid and Cooperative Computing GCC 2007)
乌鲁木齐
英文
109-116
2007-08-16（万方平台首次上网日期，不代表论文的发表时间）