By Topic

Make Highly Clustered Grid a Small World with Shorter Diameter

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
Shaohua Liu ; Beijing University of Posts and Telecommunications, Beijing, China ; Junsheng Yu ; Yuan'an Liu ; Jun Wei
more authors

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.

Published in:

Sixth International Conference on Grid and Cooperative Computing (GCC 2007)

Date of Conference:

16-18 Aug. 2007