Abstract
There is an emerging trend of using P2P systems for computational and data intensive tasks, such as online collaborations, distributed database applications and message passing interface (MPI) algorithms. For better resource utilization in these and similar applications, it is necessary to discover the resource capabilities of the collaborating peers. Another requirement of these applications is to locate the optimal resource based on a search criteria, e.g., to seek a resource with earliest execution time. We define this kind of routing as expression based routing. However, in the absence of the centralized controlling node, tracking the capabilities of the participating peers is very difficult. Moreover peers join and leave the system dynamically and, thus, makes the discovery of a desired resource even more complex. In this paper we investigate a novel algorithm for expression based routing in a P2P system. It evaluates peer u such that l u (the value of u) is minimum where e.g. l u is load of the peer u. Our contribution includes a detailed algorithm to search for the least loaded peer in the system. We analyze the accuracy and cost of our proposed algorithm through detailed simulations.
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
Pouwelse, J.A., Garbacki, P., Epema, D.H.J., Sips, H.J.: The Bittorrent P2P File-sharing System: Measurements and Analysis. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, Springer, Heidelberg (2005)
Clip2: The Gnutella Protocol Specification (2001), http://www.clip2.com
Napster (1999), http://www.napster.com
Milojicic, D.S., Kalogeraki, V., et al.: Peer-to-Peer Computing. HP Lab (2002)
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 46–66. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In: SIGCOMM 2001, pp. 149–160 (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM 2001, CA, United States, pp. 161–172 (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, Springer, Heidelberg (2001)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Tech Report: UCB/CSD-01-1141 (April 2001)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
Berman, K.A., Paul, J.: Fundamentals of Sequential and Parallel Algorithms. PWS Publishing Co. (1996)
Tsoumakos, D., Roussopoulos, N.: A Comparison of Peer-to-Peer Search Methods. In: Processdings of WebDB (2003)
Kalogeraki, V., Gunopulos, D., Zeinalipour-Yazti, D.: A local search mechanism for peer-to-peer networks. In: Proceedings of the 11th International Conference on Information and Knowledge Management, pp. 300–307 (2002)
Menasce, D., Kanchanapalli, L.: Probabilistic Scalable P2P Resource Location Services. ACM Sigmetrics Performance Evaluation Review 30(2) (2002)
Lv, C., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks, Reprint (2001)
Andrzejak, A., Xu, Z.: Scalable, Efficient Range Queries for Grid Information Services. In: Proceedings of P2P, vol. 00, IEEE Computer Society, Los Alamitos (2002)
Schmidt, C., Parashar, M.: Flexible Information Discovery in Decentralized Distributed Systems. In: Proceedings of the 12th IEEE International Symposium on HPDC (2003)
Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: supporting scalable multi-attribute range queries. In: SIGCOMM 2004, pp. 353–366 (2004)
Spence, D., Crowcroft, J., Hand, S., Harris, T.: Location based placement of whole distributed systems. In: Proceedings of the ACM conference on Emerging network experiment and technology, pp. 124–134 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rao, I., Harwood, A., Karunasekera, S. (2007). Adaptive Expression Based Routing Protocol for P2P Systems. 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_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-76890-6_20
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)