The emergence of order in random walk resource discovery protocols

Authors:
Ricky Robinson;Jadwiga Indulska
Affiliations:
School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Queensland, Australia;School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Queensland, Australia
Venue:
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
Year:
2005

Citing 3
Cited 1

A brief history of stigmergy

Artificial Life
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
A Complex Systems Approach to Service Discovery

DEXA '04 Proceedings of the Database and Expert Systems Applications, 15th International Workshop

Gossiping for resource discovering: An analysis based on complex network theory

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

While others have attempted to determine, by way of mathematical formulae, optimal resource duplication strategies for random walk protocols, this paper is concerned with studying the emergent effects of dynamic resource propagation and replication. In particular, we show, via modelling and experimentation, that under any given decay (purge) rate the number of nodes that have knowledge of particular resource converges to a fixed point or a limit cycle. We also show that even for high rates of decay – that is, when few nodes have knowledge of a particular resource – the number of hops required to find that resource is small.