Abstract
A fundamental problem in Peer-to-Peer (P2P) overlay networks is how to efficiently find a node that shares a requested object. The Chord protocol is a distributed lookup protocol addressing this problem using hash keys to identify the nodes in the network and also the shared objects. However, when a node joins or leaves the Chord ring, object references have to be rearranged in order to maintain the hash key mapping rules. This leads to a heavy traffic load, especially when nodes stay in the Chord ring only for a short time. In mobile scenarios storage capacity, transmission data rate and battery power are limited resources, so the heavy traffic load generated by the shifting of object references can lead to severe problems when using Chord in a mobile scenario. In this paper, we present the Hybrid Chord Protocol (HCP). HCP solves the problem of frequent joins and leaves of nodes. As a further improvement of an efficient search, HCP supports the grouping of shared objects in interest groups. Our concept of using information profiles to describe shared objects allows defining special interest groups (context spaces) and a shared object to be available in multiple context spaces.
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
Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: presented at ACM SIG-COMM Conference (2001)
Tarlano, A., Kellerer, W.: Context Spaces Architectural Framework. In: presented at SAINT 2004 Workshop on Ubiquitous Services (2004)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Presented at ACM SIGCOMM Conference (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A Resilient Global-Scape Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications 22 (2004)
Zhuang, L., Zhou, F.: Understanding Chord Performance Technical Report CS268 (2003)
Goel, S., Robson, M., Polte, M., Sirer, E.G.: Herbivore: A Scalable and Efficient Protocol for Anonymous Communication Cornell University Computing and Information Science Technical Report, TR2003-1890 (2003)
Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex queries in DHT-based peer-to-peer networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 242. Springer, Heidelberg (2002)
Tang, C., Altekar, G., Dwakadas, S.: Calot: A Constant-Diameter Low-Traffic Distributed Hash Table. Under submission (2003)
Sen, S., Wang, J.: Analyzing Peer-to-Peer Traffic Across Large Networks presented. In: ACM SIGCOMM Internet Measurement Workshop (2002)
Schollmeier, R., Dumanois, A.: Peer-to-Peer Traffic Characteristics. In: Presented at EUNICE 2003 (2003)
Mesaros, V.A., Carton, B., Roy, P.V.: S-Chord: Using Symmetry to Improve Lookup Efficiency in Chord. In: Presented at 2003 International Conference on Parallel and Dis-tributed Processing Techniques and Applications, PDPTA 2003 (2003)
Lakshminarayanan, K., Rao, A.R., Surana, S.: Hyperchord: A Peer-to-Peer data Location Architecture. UC Berkley Technical Report CS-021208 (2001)
Liu, L., Ryu, K.D.: Supporting Efficient Keyword-Based File Search in Peer-to-Peer File Sharing Systems IBM Research IBM Research Report. RC23145, W0403-068 (2004)
Kaashoek, M.F., Karger, D.R.: Koorde: A Simple Degree-Optimal Distributed Hash Table. In: Presented at Fifteenth annual ACM-SIAM symposium on Discrete Algorithms (2004)
Karger, D.R., Ruhl, M.: Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 131–140. Springer, Heidelberg (2005) (presented)
Bruijn, N.D.: A Combinatorial Problem. Koninklijke Nderlandse Akademie van Wetenschapen 49 (1946)
Karger, D.R., Ruhl, M.: Diminished chord: A protocol for heterogeneous subgroup formation in peer-to-peer networks. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 288–297. Springer, Heidelberg (2005)
Maymounkov, P., Mazières, D.: Kademlia: A peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 53. Springer, Heidelberg (2002)
Friese, T., Freisleben, B., Rusitschka, S., Southall, A.: A Framework for Resource Management in Peer-to-Peer Networks. Presented at NetObjectdays 2002 (2002)
ns-2, The Network Simulator ns-2 Homepage, http://www.isi.edu/nsnam/ns/
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
Zöls, S., Schollmeier, R., Kellerer, W., Tarlano, A. (2005). The Hybrid Chord Protocol: A Peer-to-Peer Lookup Service for Context-Aware Mobile Applications. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_88
Download citation
DOI: https://doi.org/10.1007/978-3-540-31957-3_88
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25338-9
Online ISBN: 978-3-540-31957-3
eBook Packages: Computer ScienceComputer Science (R0)