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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Robinson, R., & Indulska, J. (2005). The emergence of order in random walk resource discovery protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3683 LNAI, pp. 827–833). Springer Verlag. https://doi.org/10.1007/11553939_117
Mendeley helps you to discover research relevant for your work.