Abstract
Despite various hurdles, as copyright issues and security concerns, peer-to-peer (P2P) networks and systems still grow and gain in popularity, and the research community continues to develop interesting applications of P2P technology, together with new platforms for application development. Because the overall performance of these platforms and applications also depends on the performance of the background routing protocol, new systems are mostly based on distributed hash tables (DHT), which are algorithms that provide efficient mechanisms for resource location. However, DHTs assume the system is uniform in available resources and that every node participating in the DHT is within the same transport domain. A number of earlier works has gone on topology-awareness, as a possibility to improve the system’s lookup performance. In this paper, we go on to a configurable context-aware system and propose CAP, a novel scheme, which promises contextual data retrieval, alleviated message latency, and enhanced lookup time.
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
Ferreira, R.A., Grama, A., Jagannathan, S.: Plethora: an efficient wide-area storage system. In: Bougé, L., Prasanna, V.K. (eds.) HiPC 2004. LNCS, vol. 3296, pp. 252–261. Springer, Heidelberg (2004)
Xu, Z., Min, R., Hu, Y.: Hieras: a DHT based hierarchical P2P routing algorithm. In: 32nd International Conference on Parallel Processing, pp. 187–194. IEEE Press, New York (2003)
Kwon, G., Ryu, K.D.: Bypass: topology-aware lookup overlay for DHT-based P2P file locating services. In: 10th International Conference on Parallel and Distributed Systems, pp. 297–304. IEEE Press, New York (2004)
Krawczyk, H., Bellare, M., Canetti, R.: HMAC: keyed-hashing for message authentication. RFC 2104 (1997)
Risson, J., Moors, T.: Survey of research towards robust peer-to-peer networks: search methods. Technical Report (2004)
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. In: SIGCOMM 2001, pp. 149–160. ACM Press, New York (2001)
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)
Emmert, B., Jorns, O.: P22P - Prepaid Peer-to-Peer Services. In: 6th International Conference on P2P Computing, pp. 223–224. IEEE Press, New York (2006)
Harwood, A., Truong, M.: Multi-space distributed hash tables for multiple transport domains. In: 11th IEEE International Conference on Networks, pp. 283–287. IEEE Press, New York (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fayçal, M., Serhrouchni, A. (2007). CAP: A Context-Aware Peer-to-Peer System. In: Meersman, R., Tari, Z., Herrero, P. (eds) On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops. OTM 2007. Lecture Notes in Computer Science, vol 4806. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76890-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-76890-6_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76889-0
Online ISBN: 978-3-540-76890-6
eBook Packages: Computer ScienceComputer Science (R0)