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.