Abstract
We propose a scheme which excludes malicious routing peers from the normal routing process of structured P2P systems such as Chord. This scheme prevents continuous routing overheads from malicious peers. Simulation results show that the proposed scheme reduces the average routing length compared with the routing algorithm only using the alternate lookup path.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking (February 2003)
Ratnasamy, S., Francis, P., Handley, M., Karp, R.: A scalable content addressable network. In: Proceedings of ACM SIGCOMM 2001 Techinical Conference (August 2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (November 2001)
Sit, E., Morris, R.: Security considerations for peer-to-peer distributed hash tables. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, Springer, Heidelberg (2002)
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Secure routing for structured peer-to-peer overlay networks. In: Proceedings of the 5th Usenix Symposium on Operating Systems Design and Implementation (OSDI) (December 2002)
Srivatsa, M., Liu, L.: Vulnerabilities and security threats in structured overlay networks: A quantitative analysis. In: Proceedings of the 20th Annual Computer Security Applications Conference (ACSAC) (December 2004)
Maymounkov, Kademlia: A peer to peer inforamtion system based on the xor metric. In: Proceeding of 1st International Workshop on Peer-to-Peer Systems (March 2002)
Ratnasamy, Fancis: A scalable content addressable network. In: Proceeding of the ACM 2001 SIGCOMM Conference (August 2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roh, BS., Kwon, OH., Hong, S.J., Kim, J. (2008). The Exclusion of Malicious Routing Peers in Structured P2P Systems. In: Joseph, S., Despotovic, Z., Moro, G., Bergamaschi, S. (eds) Agents and Peer-to-Peer Computing. AP2PC 2006. Lecture Notes in Computer Science(), vol 4461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79705-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-79705-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79704-3
Online ISBN: 978-3-540-79705-0
eBook Packages: Computer ScienceComputer Science (R0)