Abstract
The interest-based clustering is one of promising approaches to achieve low-cost search in peer-to-peer file sharing. It organizes the logical overlay network where peers having similar interests are closely located. In this paper, we propose an interest-based peer clustering algorithm using ant paradigm. Our algorithm is inspired by the ant-based clustering algorithm, which is one of heuristic methods to categorize many data items. We also evaluate this algorithm by simulations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Napster website, http://www.napster.com/
Bollobás, B.: Random Graphs. Academic Press, London (1985)
Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence. From Natural to Artificial Systems. Oxford University Press, Oxford (1999)
Deneubourg, J.-L., Goss, S., Franks, N., Sendova-Franks, A., Detrain, C., Chretien, L.: The dynamics of collective sorting: Robot-like ant and ant-like robot. In: Proc. of 1st Conference on Simulation of Adaptive Behavior: From Animals to Animats, pp. 356–365 (1991)
Handl, J., Knowles, J., Dorigo, M.: Artificial Life (2005) (To appear)
Lumer, E., Faieta, B.: Diversity and adaptation in populations of clustering ants. In: Proc. of 3rd International Conference on Simulation of Adaptive Behavior: From Animalsto Animats 3, pp. 499–508 (1994)
Lv, Q., Cao, P., Cohen, E., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. of International Conference on Supercomputing (ICS), pp. 84–95 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Izumi, T., Masuzawa, T. (2006). An Interest-Based Peer Clustering Algorithm Using Ant Paradigm. In: Ijspeert, A.J., Masuzawa, T., Kusumoto, S. (eds) Biologically Inspired Approaches to Advanced Information Technology. BioADIT 2006. Lecture Notes in Computer Science, vol 3853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11613022_33
Download citation
DOI: https://doi.org/10.1007/11613022_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31253-6
Online ISBN: 978-3-540-32438-6
eBook Packages: Computer ScienceComputer Science (R0)