Abstract
Building distributed content–based publish/subscribe systems has remained a challenge. Existing solutions typically use a relatively small set of trusted computers as brokers, which may lead to scalability concerns for large Internet–scale workloads. Moreover, since each broker maintains state for a large number of users, it may be difficult to tolerate faults at each broker. In this paper we propose an approach to building content–based publish/subscribe systems on top of distributed hash table (DHT) systems. DHT systems have been effectively used for scalable and fault–tolerant resource lookup in large peer–to–peer networks. Our approach provides predicate–based query semantics and supports constrained range queries. Experimental evaluation shows that our approach is scalable to thousands of brokers, although proper tuning is required.
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
Fabret, F., Jacobsen, H.A., Llirbat, F., Pereira, J., Ross, K.A., Shasha, D.: Filtering algorithms and implementation for very fast publish/subscribe systems. ACM SIGMOD Record 30, 115–126 (2001)
Ashayer, G., Leung, H.K.Y., Jacobsen, H.A.: Predicate matching and subscription matching in publish/subscribe systems. In: Proc. of Workshop on Distributed Event-Based Systems (DEBS), Vienna, Austria, pp. 539–546 (2002)
Petrovic, M., Burcea, I., Jacobsen, H.A.: S-ToPSS: Semantic Toronto publish/ subscribe system. In: Proc. of Conf. on Very Large Data Bases, Berlin, Germany, pp. 1101–1104 (2003)
Liu, H., Jacobsen, H.A.: Modeling uncertainties in publish/subscribe. In: Conf. on Data Engineering (2004) (to appear)
Burcea, I., Muthusamy, V., Petrovic, M., Jacobsen, H.A., de Lara, E.: Disconnected operations in publish/subscribe. In: IEEE Mobile Data Management (2004) (to appear)
Carzaniga, A., Rosenblum, D.S., Wolf, A.L.: Achieving scalability and expressiveness in an Internet-scale event notification service. In: Proc. of ACM Symp. on Principles of Distributed Computing (PODC), Portland, OR, pp. 219–227 (2000)
Triantafillou, P., Economides, A.: Subscription summaries for scalability and efficiency in publish/subscribe. In: Proc. of Workshop on Distributed Event-Based Systems, Vienna, Austria, pp. 619–624 (2002)
Kaashoek, F.: Distributed hash tables: Building large-scale, robust distributed applications. In: Presentation: ACM Symp. on PODC (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content– addressable network. In: Proc. of ACM SIGCOMM, San Diego, CA, pp. 161–172 (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proc. of IFIP/ACM Conf. on Distributed Systems Platforms, Heidelberg, Germany, pp. 329–350 (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. of ACM SIGCOMM, San Diego, CA, pp. 149–160 (2001)
Adya, A., Bolosky, W.J., Castro, M., Cermak, G., Chaiken, R., Douceur, J.R., Howell, J., Lorch, J.R., Theimer, M., Wattenhofer, R.P.: FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. In: Proc. of USENIX Symp. on Operating Systems Design and Implementation (OSDI), Boston, MA, pp. 1–14 (2002)
Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proc. of ACM Symp. on Operating Systems Principles (SOSP), Banff, Canada, pp. 202–215 (2001)
Muthitacharoen, A., Morris, R., Gil, T.M., Chen, B.: Ivy: A read/write peer-topeer file system. In: Proc. of USENIX Symp. on OSDI, Boston, MA, pp. 31–44 (2002)
Rowstron, A., Druschel, P.: Storage management and caching in PAST, a largescale, persistent peer-to-peer storage utility. In: Proc. of ACM SOSP, Banff, Canada, pp. 188–201 (2001)
Castro, M., Druschel, P., Kermarrec, A.M., Rowstron, A.: SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communication 20, 1489–1499 (2002)
Pietzuch, P.R., Bacon, J.: Peer-to-peer overlay broker networks in an event-based middleware. In: Proc. of Workshop on DEBS, San Diego, CA (2003)
Terpstra, W.W., Behnel, S., Fiege, L., Zeidler, A., Buchmann, A.P.: A peer-to-peer approach to content-based publish/subscribe. In: Proc. ofWorkshop on DEBS, San Diego, CA (2003)
Andrzejak, A., Xu, Z.: Scalable, efficient range queries for grid information services. In: Proc. of IEEE Conf. on Peer-to-Peer Computing, Linköping, Sweden, pp. 33–40 (2002)
Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A scalable overlay network with practical locality properties. In: Proc. of USENIX Symp. on Internet Technologies and Systems, Seattle, WA (2003)
Aberer, K., Hauswirth, M., Punceva, M., Schmidt, R.: Improving data access in P2P systems. IEEE Internet Computing 6, 58–67 (2002)
Gupta, A., Agrawal, D., El Abbadi, A.: Approximate range selection queries in peer-to-peer systems. In: Proc. of Conf. on Innovative Data Systems Research, Asilomar, CA (2003)
Sahin, O.D., Gupta, A., Agrawal, D., El Abbadi, A.: Query processing over peer– to–peer data sharing systems. Technical Report UCSB/CSD-2002-28, University of California at Santa Barbara, Department of Computer Science (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tam, D., Azimi, R., Jacobsen, HA. (2004). Building Content-Based Publish/Subscribe Systems with Distributed Hash Tables. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P 2003. Lecture Notes in Computer Science, vol 2944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24629-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-24629-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20968-3
Online ISBN: 978-3-540-24629-9
eBook Packages: Springer Book Archive