Publish/Subscribe on Top of DHT Using RETE Algorithm

  • Yan Shvartzshnaider
  • Maximilian Ott
  • David Levy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6369)

Abstract

This paper discusses the construction of a Global Semantic Graph (GSG) [1] to support future information- and collaboration-centric applications and services. The GSG is a publish/subscribe (pub/sub) based architecture that supports publication of tuples and subscriptions with standing graph queries. We believe that an implementation of an efficient pattern matching algorithm such as Rete [2] on top of a distributed environment might serve as a possible substrate for GSG’s pub/sub facility. Rete operates on loosely coupled alpha, beta and join nodes and therefore has been chosen by us for implementation in a distributed setting.

In this paper, we propose a way to perform Rete’s pattern matching over a DHT-based Structured P2P network to provide a scalable content-based publish/subscribe service.

Keywords

publish/subscribe system distributed pattern matching global semantic graph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Shvartzshnaider, Y.: Global Semantic Graph as an Alternative Information and Collaboration Infrastructure. In: The 7th Extended Semantic Web Conf. PhD Symposium (2010)Google Scholar
  2. 2.
    Forgy, C.: Rete: A fast algorithm for the many patterns/many objects match problem. Artificial Intelligence 19(1), 17–37 (1982)CrossRefGoogle Scholar
  3. 3.
    Fotiou, N., Polyzos, G.C., Trossen, D.: Illustrating a Publish-Subscribe internet architecture. In: Future Internet Architectures: New Trends in Service Architectures (2nd Euro-NF Workshop) (2009)Google Scholar
  4. 4.
    Demmer, M., Fall, K., Koponen, T., Shenker, S.: Towards a modern communications api. In: Proc. of HotNets-VI (2007)Google Scholar
  5. 5.
    Rosenblum, D.S., Wolf, A.L.: A design framework for internet-scale event observation and notification. ACM SIGSOFT Software Engineering Notes 22(6), 360 (1997)CrossRefGoogle Scholar
  6. 6.
    Felber, P.A., et al.: The many faces of Publish/Subscribe. ACM Computing Surveys 35(2), 114–131 (2003)CrossRefGoogle Scholar
  7. 7.
    Post, E.L.: Formal reductions of the general combinatorial decision problem. American journal of mathematics 65(2), 197–215 (1943)CrossRefMATHGoogle Scholar
  8. 8.
    Davis, R., King, J.: An overview of production systems.plus 0.5em minus 0.4em Stanford Univ Ca Dept Of Computer Science (1975)Google Scholar
  9. 9.
    Stoica, I., et al.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking (TON) 11(1), 32 (2003)Google Scholar
  10. 10.
    Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer information system based on the xor metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 2. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    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, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  12. 12.
    Lua, E.K., et al.: A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys and Tutorials 7(2), 72–93 (2005)CrossRefGoogle Scholar
  13. 13.
    Cai, M., Frank, M., Chen, J., Szekely, P.: MAAN: a multi-attribute addressable network for grid information services. Journal of Grid Computing 2(1), 3–14 (2004)CrossRefMATHGoogle Scholar
  14. 14.
    Cai, M., Frank, M.: RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network. In: Proc. of the 13th Int. Conf. on World Wide Web, p. 657 (2004)Google Scholar
  15. 15.
    Ahull, J.P., Lpez, P.G., Skarmeta, A.F.G.: LightPS: lightweight Content-Based Publish/Subscribe for Peer-to-Peer systems. In: 2008 Int. Conf. on Complex, Intelligent and Software Intensive Systems, Barcelona, Spain, pp. 342–347 (2008)Google Scholar
  16. 16.
    Doorenbos, R.B.: Production matching for large learning systems. Ph.D. dissertation, Citeseer (1995)Google Scholar
  17. 17.
    Sohn, A., Gaudiot, J.: Performance evaluation of the multiple root node approach to the rete pattern matcher for production systems. In: FGCS, pp. 977–984 (1992)Google Scholar
  18. 18.
    Baldoni, R., Marchetti, C., Virgillito, A., Vitenberg, R.: Content-based publish-subscribe over structured overlay networks. In: Int. Conf. On Distributed Computing Systems, vol. 25, p. 437 (2005)Google Scholar
  19. 19.
    Liarou, E., Idreos, S., Koubarakis, M.: Publish/Subscribe with RDF Data over Large Structured Overlay Networks. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, J.-H., Ouksel, A.M. (eds.) DBISP2P 2005 and DBISP2P 2006. LNCS, vol. 4125, p. 135. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  20. 20.
    Pujol-Ahullo, J., Garcia-Lopez, P., Gomez-Skarmeta, A.F.: Towards a lightweight content-based publish/subscribe services for peer-to-peer systems. Int. Journal of Grid and Utility Computing 1(3), 239–251 (2009)CrossRefGoogle Scholar
  21. 21.
    Banares, J.A., et al.: Taking advantages of temporal redundancy in high level petri nets implementations. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol. 691, pp. 32–48. Springer, Heidelberg (1993)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yan Shvartzshnaider
    • 1
  • Maximilian Ott
    • 2
  • David Levy
    • 1
  1. 1.School of Electrical and Information EngineeringThe University of SydneyAustralia
  2. 2.National ICT Australia (NICTA)Australia

Personalised recommendations