About the Random Walker Merging Problem

H. Coltzau and H. Unger (Germany)


Distributed Systems, Random Walker, Self Organization, Distributed Simulations


Random walkers are widely used for the structuring of dynamic P2P-communities. To provide the requested functionality, walkers have to meet frequently and exchange information. The efficiency of such algorithms strongly depends on the frequency of such meetings. Unstructured P2P-systems usually do not provide any well defined contact points or fixed routes for the walkers, so that in large systems, the period between the meeting of two walkers often is too long and hence delays the structure-development for the underlying system. This contribution provides an improvement of the merging frequency of random walkers in large unstructured p2p communities.

Important Links:

Go Back