Skip to main content
SpringerLink
Log in

A dynamic and fast event matching algorithm for a content-based publish/subscribe information dissemination system in Sensor-Grid

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In this paper, we discuss one of the most important issues in Sensor-Grid, i.e., to develop a fast and flexible content-based publish/subscribe information dissemination (CBPSID) system for automatic fusion, interpretation, sharing and delivery of huge sensor data to consumers as the entire Sensor-Grid environment is very dynamic. Existing works to develop the CBPSID system in Sensor-Grid mostly focus on reducing the effort to define and maintain subscriptions and to handle the difficulty of dynamic changes of publishers and consumers data. However, the performance of a CBPSID system in Sensor-Grid is bounded by the expensive matching/evaluation cost of events. Existing event-matching algorithms are not very efficient, especially for interval range predicates or overlapping predicates in subscriptions which are practical in Sensor-Grid as well as other application areas. So in this paper we discuss the above challenge and propose a dynamic and fast event-matching algorithm called CGIM for the CBPSID system in Sensor-Grid. The algorithm supports range predicates or overlapping predicates very well and provides single and composite event matching. It uses two approaches, called SGIM and DGIM, to group the subscriptions by the predicates and dynamically identifies appropriate number of groups considering different statistical distributions of subscriptions at run time. Also, we present an experimental evaluation of the proposed algorithm in a Sensor-Grid based u-Healthcare scenario using synthetic workloads and compare its performance with existing algorithms. The experimental results show that our algorithm significantly reduces the evaluation cost (on average using SGIM by 79% and DGIM by 88%) comparing with others and guarantees the scalability with respect to the number of subscriptions as well as the number of predicates and events. In addition, further experiments were conducted by applying the CGIM algorithm in other application areas, e.g. in the publish/subscribe system for online job sites, to show its diverse utilization and scalability.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gaynor M, Moulton SL, Welsh M et al (2004) Integrating wireless sensor networks with the grid. IEEE Internet Comput 8(4):32–39

    Article  Google Scholar 

  2. Lim HB, Ling KV, Wang W et al (2007) The national weather Sensor-Grid. In: Proceedings of the 5th international conference on embedded networked sensor systems, Sydney, Australia, vol 1. ACM Press, New York, pp 369–370

    Chapter  Google Scholar 

  3. Ma Y, Richards M, Ghanem M, Guo Y, Hassard J (2008) Air pollution monitoring and mining based on Sensor Grid in London. J Sens 8:3601–3623

    Article  Google Scholar 

  4. Oh S-J, Lee C-W (2008) U-Healthcare Sensor-Grid gateway for connecting wireless sensor network and grid network. In: Proceedings of 10th IEEE international conference on advanced communication technology, Phoenix Park, South Korea, 2008, pp 827–831

  5. McMullen DF, Devadithya T, Chiu K (2005) Integrating instruments and sensors into the grid with CIMA Web services. In: Proceedings of third APAC conference on advanced computing, grid applications and e-research, Gold Coast, Australia, 2005

  6. Lim HB, Teo YM, Mukherjee P et al (2005) Sensor Grid: integration of wireless sensor networks and the grid. In: Proceedings of the 30th IEEE conference on local computer networks, 2005, vol 1, pp 91–99

  7. Baig ZA, Baqer M, Khan AI (2006) SGSIA-in-network data preprocessing for secure grid-sensor integration. In: Proceedings of the second IEEE international conference on e-science and grid computing, 2006, vol 1, pp 160–168

  8. Rao I, Imran N, Huh E-N et al (2007) Adaptive and reconfigurable resource management for wireless sensors using grid technology. In: Proceedings of 2nd IEEE international conference on communication systems, software and middleware (COMSWARE), India, 2007, vol 1, pp 1–5

  9. Ye Z, Chen H, Wu Z (2005) Dart-Dataflow: towards communicating data semantics in sensor grid. In: Proceedings of grid and cooperative computing (GCC). LNCS, vol 3795. Springer, Berlin, pp 617–522

    Google Scholar 

  10. Davey S, Dialani V, Fehling R et al (2007) Information dissemination in the grid environment base specifications. https://forge.gridforum.org/sf/docman/do/listDocuments/projects.infod-wg/docman.root.current_drafts

  11. Stanoi I, Mihaila G, Padmanabhan S (2003) A framework for the selective dissemination of XML documents based on inferred user profiles. In: Proceedings of the 19th international conference on data engineering (ICDE), 2003, pp 531–542

  12. Mühl G, Ulbrich A, Herrman K (2004) Disseminating information to mobile clients using publish–subscribe. IEEE Internet Comput 8(3):46–53

    Article  Google Scholar 

  13. Pallickara S, Fox G (2003) NaradaBrokering: a distributed middleware framework and architecture for enabling durable peer-to-peer grids. In: Proc of ACM/IFIP/USENIX intl conf on middleware, 2003, pp 41–61

  14. Riabov A, Liu Z, Wolf J, Yu P, Zhang L (2003) New algorithms for content-based publication-subscription systems. In: Proceedings of 23rd international conference on distributed computing systems (ICDCS), 2003, pp 678–686

  15. Casalicchio E, Morabito F (2007) Distributed subscriptions clustering with limited knowledge sharing for content-based publish/subscribe systems. In: Proceedings of sixth IEEE international symposium on network computing and applications (NCA), 2007, pp 105–112

  16. Casalicchio E, Morabito F, Cortese G, Davide F (2006) A novel approach to adaptive content-based subscription management in DHT-based overlay networks. J Grid Comput 4:343–353

    Article  MATH  Google Scholar 

  17. Shah R, Jain R, Anjum F (2004) Efficient dissemination of personalized information using content-based multicast. IEEE Trans Mobile Comput 3(4):394–408

    Article  Google Scholar 

  18. Jerzak Z, Fetzer C (2008) Bloom filter based routing for content-based publish/subscribe. In: Proc of the second intl conf on distributed event based systems (DEBS), 2008, vol 332, pp 71–81

  19. Aekaterinidis I, Triantafillou P (2007) Publish-subscribe information delivery with substring predicates. IEEE Internet Comput 11(4):16–23

    Article  Google Scholar 

  20. Triantafillou P, Economides A (2002) Subscription summaries for scalability and efficiency in publish/subscribe systems. In: Proc of the 22nd intl conf on distributed computing systems workshop (ICDCSW), 2002, pp 619–624

  21. Triantafillou P, Economides A (2004) Subscription summarization: a new paradigm for efficient publish/subscribe systems. In: Proc of the 24th intl conf on distributed computing systems workshop (ICDCSW), 2004, pp 562–571

  22. Zhu Y, Shen H (2008) An efficient and scalable framework for content-based publish/subscribe systems. J Peer-to-Peer Netw Appl 1:3–17

    Article  MATH  Google Scholar 

  23. Lo S-C, Chiu Y-T (2008) Design of content-based publish/subscribe systems over structured overlay networks. IEICE Trans Inf Syst E91-D(5):1504–1511

    Article  Google Scholar 

  24. Carzaniga A, Wolf AL (2003) Forwarding in a content-based network. In: Proceedings of ACM SIGCOMM, Karlsruhe, Germany, 2003, pp 163–174

  25. Carzaniga A, Rosenblum DS, Wolf AL (2001) Design and evaluation of a wide-area event notification service. ACM Trans Comput Syst 19(3):332–383

    Article  Google Scholar 

  26. Wu K, Chen S, Yu PS (2004) VCR indexing for fast event matching for highly-overlapping range predicates. In: Proc of the ACM symposium on applied computing, Nicosia, Cyprus, 2004, pp 740–747

  27. Cao F, Singh JP (2004) Efficient event routing in content-based publish-subscribe service networks. In: Proceedings of IEEE INFOCOM, 2004, vol 2, pp 7–11

  28. Liu Z, Parthasarthy S, Ranganathan A, Yang H (2007) Scalable event matching for overlapping subscriptions in pub/sub systems. In: Proceedings of distributed event base systems (DEBS), Toronto, Canada, vol 233. ACM Press, New York, pp 250–261

    Google Scholar 

  29. Banavar G, Chandra T, Mukherjee B, Nagarajarao J, Strom RE, Sturman DC (1999) An efficient multicast protocol for content-based publish-subscribe systems. In: Proceedings of the 19th IEEE international conference on distributed computing systems (ICDCS), Austin, TX, 1999, pp 262–272

  30. Aguilera M, Strom R, Sturman D, Astley M, Chandra T (1999) Matching events in a content-based subscription system. In: Proc of the 18th annual ACM symposium on principles of distributed computing, Atlanta, USA, 1999, pp 53–61

  31. Guo X, Wei J, Han D (2008) Efficient event matching in publish/subscribe: based on routing destination and matching history. In: Proc of the intl conf on networking, architecture and storage (NAS), 2008, pp 129–136

  32. Machanavajjhala A, Vee E, Garofalakis M, Shanmugasundaram J (2008) Scalable ranked publish/subscribe. In: Proceedings of VLDB endowment, 2008, vol 1, pp 451–462

  33. Tarkoma S (2007) Chained forests for fast subscription matching. In: Proceedings of the inaugural international conference on distributed event-based systems (DEBS). ACM Press, New York, pp 97–102

    Chapter  Google Scholar 

  34. (2009) www.ogsadai.org

  35. Cao F, Pal Singh J (2005) Medym: match-early with dynamic multicast for content-based publish-subscribe networks. In: Proc of the ACM/IFIP/USENIX intl conf on middleware, 2005, pp 292–313

  36. Jerzak Z, Fetzer C (2007) Prefix forwarding for publish/subscribe. In DEBS ’07: Proceedings of the inaugural international conference on distributed event-based systems (DEBS), 2007, pp 238–249

  37. Shen Z, Tirthapura S (2006) Faster event forwarding in a content-based publish-subscribe system through lookup reuse event. In: Proc of the fifth IEEE international symposium on network computing and applications, 2006, pp 77–84

  38. Rao I, Huh E-N, Lee S et al (2006) Distributed, scalable and reconfigurable inter-grid resource sharing framework. In: Proceedings of international conference on computational science and its applications (ICCSA). LNCS, vol 3981. Springer, Berlin, pp 390–399

    Google Scholar 

  39. Rao I, Huh E-N (2008) A probabilistic and adaptive scheduling algorithm using system-generated predictions for inter-grid resource sharing. J Supercomput 45:185–204

    Article  Google Scholar 

  40. Eugster PT, Felber PA, Guerraoui R, Kernmarrec A-M (2003) The many faces of publish/subscribe. ACM Comput Surv 35(2):114–131

    Article  Google Scholar 

  41. Nagahara Y (2004) A method of simulating multivariate non-normal distributions by the Pearson distribution system and estimation. J Comput Stat Data Anal 47:1–29

    Article  MATH  MathSciNet  Google Scholar 

  42. (2009) http://www.mathworks.com/access/helpdesk/help/toolbox/stats/index.html?/access/helpdesk/help/toolbox/stats/pearsrnd.html, http://www.google.com/search?hl=en&q=matlab+pearsrnd

  43. Singh J, Bacon J (2008) Event-based data control in healthcare. In: Proceedings of ACM middleware conference companion, Leuven, Belgium, 2008, pp 84–86

Download references

Author information

Authors and Affiliations

  1. Internet Computing and Network Security Lab, Department of Computer Engineering, Kyung Hee University, 1 Seocheon-dong, Giheung-gu, Yongin-si, Gyeonggi-do, 446-701, South Korea

    Mohammad Mehedi Hassan, Biao Song & Eui-Nam Huh

Authors
  1. Mohammad Mehedi Hassan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Biao Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eui-Nam Huh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eui-Nam Huh.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hassan, M.M., Song, B. & Huh, EN. A dynamic and fast event matching algorithm for a content-based publish/subscribe information dissemination system in Sensor-Grid. J Supercomput 54, 330–365 (2010). https://doi.org/10.1007/s11227-009-0327-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-009-0327-0

Keywords

Search

Navigation