Abstract
In digest-based distributed anti-spam technology, the research concentrates on how to publish and lookup digests efficiently. Based on the deep study of CTPH and DHT, we propose an approach to publish and lookup CTPH digests in Chord: iCTPH, in which the high-dimensional CTPH digests are mapped into one-dimensional Chord identifiers by iDistance method. Simulation experiments demonstrate that iCTPH has good publishing and looking up performance. For random generated digests, iCTPH can publish 500 similar digests to less than 5.6% nodes and recall 85% of the similar digests by querying no more than 4% nodes.
This work was supported by a grant from Tianjin Natural Science Foundation (No. 08JCZDJC22100).
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.
References
Kornblum, J.: Identifying almost identical files using context triggered piecewise hashing. Digital Investigation 3(s1), 91–97 (2006)
Stoica, I., Morris, R., et al.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proc. of ACM SIGCOMM, USA, pp. 149–160 (2001)
Jagadish, H.V., Ooi, B.C., Tan, K.-L., et al.: iDistance: An adaptive B-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems 30(2), 364–397 (2005)
SpamNet: http://razor.sourceforge.net
Mo, G., Zhao, W., et al.: Multi-agent Interaction Based Collaborative P2P System for Fighting Spam. In: Proc. of the IEEE/WIC/ACM international conference on Intelligent Agent Technology, pp. 428–431. IEEE Computer Society, USA (2006)
Zhang, J., Lu, H., Lan, X., et al.: DHTnil: An Approach to Publish and Lookup Nilsimsa Digests in DHT. In: Proc. of the 10th IEEE International Conference on High Performance Computing and Communications, pp. 213–218. IEEE Computer Society, USA (2008)
Aurenhammer, F.: Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Computing Surveys 23(3), 345–405 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jianzhong, Z., Kai, P., Yuntao, Y., Jingdong, X. (2010). iCTPH: An Approach to Publish and Lookup CTPH Digests in Chord. In: Hsu, CH., Yang, L.T., Park, J.H., Yeo, SS. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2010. Lecture Notes in Computer Science, vol 6082. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13136-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-13136-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13135-6
Online ISBN: 978-3-642-13136-3
eBook Packages: Computer ScienceComputer Science (R0)