Abstract
Publish/Subscribe systems have become a prevalent model for delivering data from producers (publishers) to consumers (subscribers) distributed across wide-area networks while decoupling the publishers and the subscribers from each other. In this paper we present Meghdoot, which adapts content-based publish/subscribe systems to Distributed Hash Table based P2P networks in order to provide scalable content delivery mechanisms while maintaining the decoupling between the publishers and the subscribers. Meghdoot is designed to adapt to highly skewed data sets, which is typical of real applications. The experimental results demonstrate that Meghdoot balances the load among the peers and the design scales well with increasing number of peers, subscriptions and events.
This research was supported in parts by NSF grants EIA00-80134, IIS-0220152, and IIS-0223022.
Chapter PDF
References
Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in P2P systems. Communications of the ACM 46(2), 43–48 (2003)
Banavar, G., Chandra, T., Mukherjee, B., Nagarajarao, J., Strom, R.E., Sturman, D.C.: An efficient multicast protocol for content-based publish-subscribe systems. In: Proceedings of the 19th ICDCS, pp. 262–272 (1999)
Birman, K.P.: The process group approach to reliable distributed computing. Communications of the ACM 36(12), 36–53 (1993)
Carzaniga, A., Rosenblum, D.S., Wolf, A.L.: Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems 19(3), 332–383 (2001)
Castro, M., Druschel, P., Kermarrec, A., Rowstron, A.: SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications 20(8), 100–110 (2002)
Chen, J., DeWitt, D.J., Tian, F., Wang, Y.: NiagaraCQ: A scalable continuous query system for internet databases. In: Proceedings of the 2000 ACM SIGMOD, pp. 379–390 (2000)
Fabret, F., Jacobsen, H.A., Llirbat, F., Pereira, J., Ross, K.A., Shasha, D.: Filtering algorithms and implementation for very fast publish/subscribe systems. SIGMOD Record 30(2), 115–126 (2001)
Galanis, L., Wang, Y., Jeffery, S.R., DeWitt, D.J.: Locating data sources in large distributed systems. In: Proceedings of the 29th VLDB, pp. 874–885 (2003)
Gnutella, http://gnutella.wego.com/
Gupta, A., Agrawal, D., El Abbadi, A.: Approximate range selection queries in peer-to-peer systems. In: Proceedings of the 1st CIDR, pp. 141–151 (2003)
Hanson, E.N., Carnes, C., Huang, L., Konyala, M., Noronha, L., Parthasarathy, S., Park, J.B., Vernon, A.: Scalable trigger processing. In: Proceedings of the 15th ICDE, pp. 266–275 (1999)
Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex queries in DHT-based peer-to-peer networks. In: Proceedings of the first International Workshop on Peer-to-Peer Systems, pp. 242–250 (2002)
IBM News, http://www.ibm.com/ibm/history/history/year_2000.html
KaZaA, http://www.kazaa.com/
Napster, http://www.napster.com/
Oki, B., Pfluegl, M., Siegel, A., Skeen, D.: The information bus: an architecture for extensible distributed systems. In: Proceedings of the fourteenth ACM SOSP, pp. 58–68 (1993)
Pietzuch, P.R., Bacon, J.: Peer-to-peer overlay broker networks in an eventbased middleware. In: Proceedings of the 2nd DEBS, pp. 1–8 (2003)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proceedings of the 2001 ACM SIGCOMM, pp. 161–172 (2001)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Application-level multicast using content-addressable networks. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol. 2233, pp. 14–29. Springer, Heidelberg (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)
Sahin, O.D., Gupta, A., Agrawal, D., El Abbadi, A.: A peer-to-peer framework for caching range queries. In: Proceedings of the 20th ICDE, pp. 165–176 (2004)
Segall, B., Arnold, D.: Elvin has left the building: A publish/subscribe notification service with quenching. In: Proceedings of AUUG (1997)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM, pp. 149–160 (2001)
Tam, D., Azimi, R., Jacobsen, H.-A.: Building content-based publish/subscribe systems with distributed hash tables. In: Proceedings of International Workshop on Databases, Information Systems and Peer-to-Peer Computing (2003)
Terpstra, W.W., Behnel, S., Fiege, L., Zeidler, A., Buchmann, A.P.: A peer-to-peer approach to content-based publish/subscribe. In: Proceeding of the Second DEBS (2003)
Tibco, http://www.tibco.com/
Triantafillou, P., Pitoura, T.: Towards a unifying framework for complex query processing over structured peer-to-peer data networks. In: Fist International workshop DBISP2P 2003, pp. 169–183 (2003)
Vitria, http://www.vitria.com/
Yahoo! Finance, http://finance.yahoo.com/
Zhao, Y.B., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, University of California at Berkeley (2001)
Zhuang, S.Q., Zhao, B.Y., Joseph, A.D., Katz, R.H., Kubiatowicz, J.D.: Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination. In: Proceedings of the 11th ACM NOSSDAV, pp. 11–20 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Gupta, A., Sahin, O.D., Agrawal, D., El Abbadi, A. (2004). Meghdoot: Content-Based Publish/Subscribe over P2P Networks. In: Jacobsen, HA. (eds) Middleware 2004. Middleware 2004. Lecture Notes in Computer Science, vol 3231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30229-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-30229-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23428-9
Online ISBN: 978-3-540-30229-2
eBook Packages: Springer Book Archive