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.
The work reported in this paper has been funded in part by the Co-operative Research Centre for Enterprise Distributed Systems Technology (DSTC) through the Australian Federal Government’s CRC Programme (Department of Education, Science and Training)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Deneubourg, J.L., Pasteels, J.M., Verhaeghe, J.C.: Probabilistic behaviour in ants: A strategy of errors? Journal of Theoretical Biology 105, 259–271 (1983)
Iamnitchi, A., Foster, I., Nurmi, D.C.: A Peer-to-Peer Approach to Resource Discovery in Grid Environments. Technical Report TR-2002-06, Department of Computer Science, University of Chicago and Mathematics and Computer Science Division, Argonne National Laboratory (March 2002)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: 16th ACM International Conference on Supercomputing (ICS 2002), June 2002, pp. 84–95. ACM Press, New York (2002)
Robinson, R.: A Resource Discovery Protocol for Modern Computing Environments. PhD thesis, School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia (March 2005), http://www.itee.uq.edu.au/~ricky/thesis.pdf
Robinson, R., Indulska, J.: Superstring: A scalable service discovery protocol for the wide-area pervasive environment. In: 11th IEEE International Conference on Networks, Sydney, Australia, September 2003, pp. 699–704 (2003)
Robinson, R., Indulska, J.: A complex systems approach to service discovery. In: Database and Expert Systems Applications, 15th International Workshop on (DEXA 2004), Zaragoza, Spain, August 2004, pp. 657–661. IEEE Computer Society, Los Alamitos (2004) ISBN 0-7695-2195-9
Sumpter, D.J.T., Beekman, M.: From nonlinearity to optimality: pheromone trail foraging by ants. Animal Behaviour 66, 273–280 (2003)
Theraulaz, G., Bonabeau, E.: A brief history of stigmergy. Artificial Life 5(2), 97–116 (1999) ISSN 1064-5462
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Robinson, R., Indulska, J. (2005). The Emergence of Order in Random Walk Resource Discovery Protocols. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553939_117
Download citation
DOI: https://doi.org/10.1007/11553939_117
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28896-1
Online ISBN: 978-3-540-31990-0
eBook Packages: Computer ScienceComputer Science (R0)