Optimisation of Distributed Communities Using Cooperative Strategies

The complex structure of the Web requires decentralised, adaptive mechanisms efficiently providing access to local and global capacities. To facilitate the development of such mechanisms, it seems reasonable to build clusters of machines with similar structures and interests. In such a manner, communities of machines can be built. In a community, every machine contributes to the overall success through a division of management work and a respective collaboration. This article presents and analyses experimental results for algorithms optimising service response times in a community. It extends previously published results on the <i>Wanderer</i> optimisation algorithm; we describe variations of the <i>Wanderer</i> and present simulation results of these variations.