The Community for Technology Leaders
RSS Icon
Issue No.03 - March (2011 vol.23)
pp: 463-478
Lakshmish Ramaswamy , University of Georgia, athens
The current peer-to-peer (P2P) content distribution systems are constricted by their simple on-demand content discovery mechanism. The utility of these systems can be greatly enhanced by incorporating two capabilities, namely a mechanism through which peers can register their long term interests with the network so that they can be continuously notified of new data items, and a means for the peers to advertise their contents. Although researchers have proposed a few unstructured overlay-based publish-subscribe systems that provide the above capabilities, most of these systems require intricate indexing and routing schemes, which not only make them highly complex but also render the overlay network less flexible toward transient peers. This paper argues that for many P2P applications, implementing full-fledged publish-subscribe systems is an overkill. For these applications, we study the alternate continuous query paradigm, which is a best-effort service providing the above two capabilities. We present a scalable and effective middleware, called CoQUOS, for supporting continuous queries in unstructured overlay networks. Besides being independent of the overlay topology, CoQUOS preserves the simplicity and flexibility of the unstructured P2P network. Our design of the CoQUOS system is characterized by two novel techniques, namely cluster-resilient random walk algorithm for propagating the queries to various regions of the network and dynamic probability-based query registration scheme to ensure that the registrations are well distributed in the overlay. Further, we also develop effective and efficient schemes for providing resilience to the churn of the P2P network and for ensuring a fair distribution of the notification load among the peers. This paper studies the properties of our algorithms through theoretical analysis. We also report series of experiments evaluating the effectiveness and the costs of the proposed schemes.
Peer-to-peer networks, continuous queries, publish-subscribe systems, random walk.
Lakshmish Ramaswamy, "The CoQUOS Approach to Continuous Queries in Unstructured Overlays", IEEE Transactions on Knowledge & Data Engineering, vol.23, no. 3, pp. 463-478, March 2011, doi:10.1109/TKDE.2010.133
[1] Gnutella P2P Network., 2009.
[2] Kazaa P2P Network., 2010.
[3] TIB/Rendezvous. White paper, 1999.
[4] S. Androutsellis-Theotokis and D. Spinellis, "A Survey of Peer-to-Peer Content Distribution Technologies," ACM Computing Surveys, vol. 36, pp. 335-371, 2004.
[5] B. Arai, G. Das, D. Gunopulos, and V. Kalogeraki, "Approximating Aggregation Queries in Peer-to-Peer Networks," Proc. 22nd Int'l Conf. Data Eng. (ICDE), 2006.
[6] R. Baldoni, C. Marchetti, A. Virgillito, and R. Vitenberg, "Content-Based Publish-Subscribe over Structured Overlay Networks," Proc. 25th IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2005.
[7] G. Banavar, T. Chandra, B. Mukherjee, J. Nagarajarao, R.E. Strom, and D.C. Sturman, "An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems," Proc. 19th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '99), 1999.
[8] T. Bu and D.F. Towsley, "On Distinguishing between Internet Power Law Topology Generators," Proc. IEEE INFOCOM, 2002.
[9] A. Carzaniga, D.S. Rosenblum, and A.L. Wolf, "Design and Evaluation of a Wide-Area Event Notification Service," ACM Trans. Computer Systems, vol. 19, no. 3, pp. 332-383, 2001.
[10] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making Gnutella-Like P2P Systems Scalable," Proc. ACM SIGCOMM '03, 2003.
[11] J. Chen, L. Ramaswamy, and A. Meka, "Message Diffusion in Unstructured Overlay Networks," Proc. Sixth IEEE Int'l Symp. Network Computing and Applications (NCA), 2007.
[12] P.A. Chirita, S. Idreos, M. Koubarakis, and W. Nejdl, "Publish/Subscribe for RDF-Based P2P Networks," Proc. First European Semantic Web Symp., May 2004.
[13] P.A. Chirita, S. Idreos, M. Koubarakis, and W. Nejdl, "Designing Semantic Publish/Subscribe Networks Using Super-Peers," Semantic Web and Peer-to-Peer, Springer Verlag, 2005.
[14] P.T. Eugster, R. Guerraoui, and C.H. Damm, "On Objects and Events," Proc. 16th ACM SIGPLAN Conf. Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2001.
[15] P.T. Eugster, P. Felber, R. Guerraoui, and A.-M. Kermarrec, "The Many Faces of Publish/Subscribe," ACM Computing Surveys, vol. 35, no. 2, pp. 114-131, 2003.
[16] P. Ganesan, M. Bawa, and H. Garcia-Molina, "Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems," Proc. 30th Int'l Conf. Very Large Data Bases (VLDB), 2004.
[17] B. Gedik and L. Liu, "A Scalable Peer-to-Peer Architecture for Distributed Information Monitoring Applications," IEEE Trans. Computers, vol. 54, no. 6, pp. 767-782, June 2005.
[18] C. Gkantsidis, M. Mihail, and A. Saberi, "Random Walks in Peer-to-Peer Networks," Proc. IEEE INFOCOM '04, 2004.
[19] C. Gkantsidis, M. Mihail, and A. Saberi, "Hybrid Search Schemes for Unstructured Peer-to-Peer Networks," Proc. IEEE INFOCOM, 2005.
[20] A. Gupta, O.D. Sahin, D. Agrawal, and A.E. Abbadi, "Meghdoot: Content-Based Publish/Subscribe over P2P Networks," Proc. ACM/IFIP/USENIX Int'l Middleware Conf. '04, 2004.
[21] V. Kalogeraki, D. Gunopoulos, and D. Zeinalipour-Yazti, "A Local Search Mechanism for Peer-to-Peer Networks," Proc. 11th Int'l Conf. Information and Knowledge Management (CIKM), 2002.
[22] J. Kannan, B. Yang, S. Shenker, P. Sharma, S. Banerjee, S. Basu, and S.-J. Lee, "SmartSeer: Using a DHT to Process Continuous Queries over Peer-to-Peer Networks," Proc. IEEE INFOCOM, 2006.
[23] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and Replication in Unstructured Peer-to-Peer Networks," Proc. 16th Ann. ACM Int'l Conf. Supercomputing, 2002.
[24] W.S. Ng, B.C. Ooi, K.-L. Tan, and A. Zhou, "PeerDB: A P2P-Based System for Distributed Data Sharing," Proc. 19th Int'l Conf. Data Eng. (ICDE), 2003.
[25] L. Ramaswamy, J. Chen, and P. Parate, "CoQUOS: Lightweight Support for Continuous Queries in Unstructured Overlays," Proc. IEEE Int'l Parallel and Distributed Processing Symp., 2007.
[26] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, "A Scalable Content-Addressable Network," Proc. ACM SIGCOMM '01, Aug. 2001.
[27] P. Reynolds and A. Vahdat, "Efficient Peer-to-Peer Keyword Searching," Proc. ACM/IFIP/USENIX Int'l Middleware Conf. '03, 2003.
[28] B. Segall, D. Arnold, J. Boot, M. Henderson, and T. Phelps, "Content Based Routing with Elvin4," Proc. Australian Unix System User Group Conf., 2000.
[29] K. Sripanidkulchai, "The Popularity of Gnutella Queries and Its Implications on Scalability," O'Reilly' website. Feb. 2001.
[30] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," Proc. ACM SIGCOMM '01, Aug. 2001.
[31] P. Triantafillou and I. Aekaterinidis, "Content-Based Publish/Subscribe over Structured P2P Networks," Proc. Third Int'l Workshop Distributed Event-Based Systems (DEBS), 2004.
[32] S. Voulgaris, E. Riviere, A.-M. Kermarrec, and M. van Steen, "Sub-2-Sub: Self-Organizing Content-Based Publish Subscribe for Dynamic Large Scale Collaborative Networks," Proc. Fifth Int'l Workshop Peer-to-Peer Systems, Feb. 2006.
[33] D.J. Watts and S.H. Strogatz, "Collective Dynamics of 'Small-World' Networks," Nature, vol. 393, no. 6684, pp. 440-442, 1998.
[34] B. Yang and H. Garcia-Molina, "Improving Search in Peer-to-Peer Networks," Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS '02), 2002.
[35] X. Yang, Y. Zhu, and Y. Hu, "Scalable Content-Based Publish/Subscribe Services over Structured Peer-to-Peer Networks," Proc. 15th Euromicro Int'l Conf. Parallel, Distributed and Network-Based Processing (PDP), 2007.
[36] M. Zhong and K. Shen, "Popularity-Biased Random Walks for Peer-to-Peer Search under the Square-Root Principle," Proc. Fifth Int'l Workshop Peer-to-Peer Systems (IPTPS), 2006.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool