Abstract
For improving the routing security of traditional DHT, in this paper, a Multidimensional Mapping Mechanism and a secure routing method based on it are proposed against various routing attacks. The proposed mechanism, which maps the resource search and related peers to a smaller space following the same topology with current DHT protocol to simplify the routing operation and decrease the coupling degree between security mechanisms and routing geometry, lays a solid foundation for applying to diversified DHT protocols. The subsequently proposed security measures based on Multidimensional Mapping Mechanism for DHT routing still keeps independent of certain DHT protocol. It pervades throughout the whole routing process, and peers could correct the malicious routing under its security rules. The theoretical analysis and simulation experiment result show that the secure routing method proposed in this paper can improve the average success ratio of lookup through effectively inhibiting malicious behavior.
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
Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowica, J.D.: Tapestry: A Resilient Global-scale Overlay for Service Deployment. J. IEEE Journal on Selected Areas in Communications 22, 41–53 (2004)
Wallach, D.S.: A Survey of Peer-to-Peer Security Issues. In: International Symposium on Software Security, pp. 31–338. Springer, Heidelberg (2003)
Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A Survey and Comparison of Peer-to-Peer Overlay Network Schemes. J. IEEE Communications Survey and Tutorial 7, 72–93 (2005)
Rescorla, E.: Introduction to Distributed Hash Tables. Technical report, IAB Plenary, IETF-65 (2006)
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, pp. 261–269. Springer, Heidelberg (2002)
Klemm, F., Girdzijauskas, S., Le Boudec, J.-Y., Aberer, K.: On Routing in Distributed Hash Tables. In: 7th IEEE International Conference on Peer-to-Peer Computing, pp. 113–122. Springer, Berlin (2007)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Baladrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Annual Conference of the Special Interest Group on Data Communication, pp. 149–160. ACM Press, New York (2001)
Hildrum, K., Kubiatowicz, J.: Asymptotically Efficient Approaches to Fault-tolerance in Peer-to-Peer Networks. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 321–336. Springer, Heidelberg (2003)
Castro M., Druschel P., Ganesh A., Powstron A., Wallach D. S.: Secure Routing for Structured Peer-to-Peer Overlay Networks. In: 5th Symposium on Operating Systems Design and Implementation (2002)
Castro, M., Druschel, P., Charlie Hu, Y., Rowstron, A.: Topology-aware Routing in Structured Peer-to-Peer Overlay Networks. Technical report, Microsoft Research (2002)
Wang, P., Hopper, N., Osipkiv, I., Kim, Y.: Myrmic: Secure and Robust DHT Routing. Technical report, DTC Research Report (2006)
Kamvar, S.D., Schlosser, M.T.: EigenRep: Reputation Management in P2P Networks. In: 12th International World Wide Web Conference, pp. 123–134. ACM Press, New York (2003)
Marti, S., Ganesan, P., Garcia-Molina, H.: DHT Routing Using Social Links. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 100–111. Springer, Heidelberg (2005)
Singh, M.G.: Routing Networks for Distributed Hash Tables. In: 22nd Annual Symposium on Principles of Distributed Computing, pp. 133–142. ACM Press, New York (2003)
Rarnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Annual Conference of the Special Interest Group on Data Communications, pp. 161–172. ACM Press, New York (2001)
Yu, Z.H.: Analysis of Malicious Behaviors in Peer-to-Peer Trust Model. J. Computer Engineering and Applications 43, 18–21 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Sun, Z., Bu, K., Ding, K. (2009). A Multidimensional Mapping Mechanism Based Secure Routing Method for DHT. In: Mueller, P., Cao, JN., Wang, CL. (eds) Scalable Information Systems. INFOSCALE 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 18. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10485-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-10485-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10484-8
Online ISBN: 978-3-642-10485-5
eBook Packages: Computer ScienceComputer Science (R0)