An Efficient Management of Correlation Sets with Broadcast

  • Jacopo Mauro
  • Maurizio Gabbrielli
  • Claudio Guidi
  • Fabrizio Montesi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6721)


A fundamental aspect which affects the efficiency and the performance of Service-Oriented Architectures is the mechanism which allows to manage sessions and, in particular, to assign incoming messages to the correct sessions (also known as service instances). A relevant mechanism for solving this problem, first introduced by BPEL and then used in other languages (e.g. Jolie) is that one based on correlation sets. The BPEL and Jolie languages are currently allowing the use of messages whose target is only one session. However there are a lot of scenarios where being able to send a broadcast message to more than one session could be useful. Supporting such a broadcast primitive means to allow correlation sets which can contain unspecified variables and this can be very inefficient, since usual implementations in terms of hash tables cannot be used in this case.

In this paper we propose a data structure, based on radix trees and an algorithm for managing a correlation mechanism that supports the broadcast primitive, without degrading the performances.


Virtual Machine Range Query Correlation Variable Broadcast Message Incoming Message 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Web Services Business Process Execution Language Version 2.0,
  2. 2.
    Barros, A.P., Decker, G., Dumas, M., Weber, F.: Correlation patterns in service-oriented architectures. In: Dwyer, M.B., Lopes, A. (eds.) FASE 2007. LNCS, vol. 4422, pp. 245–259. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Carzaniga, A., Wolf, A.L.: Forwarding in a content-based network. In: SIGCOMM, pp. 163–174 (2003)Google Scholar
  4. 4.
    Fabret, F., Jacobsen, H.-A., Llirbat, F., Pereira, J., Ross, K.A., Shasha, D.: Filtering algorithms and implementation for very fast publish/subscribe. In: SIGMOD Conference, pp. 115–126 (2001)Google Scholar
  5. 5.
    Guidi, C., Lucchi, R., Gorrieri, R., Busi, N., Zavattaro, G.: SOCK: A calculus for service oriented computing. In: Dan, A., Lamersdorf, W. (eds.) ICSOC 2006. LNCS, vol. 4294, pp. 327–338. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Lapadula, A., Pugliese, R., Tiezzi, F.: A calculus for orchestration of web services. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 33–47. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Mauro, J., Gabbrielli, M., Guidi, C., Montesi, F.: An efficient management of correlation sets with broadcast. Technical report (2011),
  8. 8.
    Montesi, F., Guidi, C., Lucchi, R., Zavattaro, G.: JOLIE: a java orchestration language interpreter engine. Electr. Notes Theor. Comput. Sci. 181, 19–33 (2007)CrossRefGoogle Scholar
  9. 9.
    Montesi, F., Guidi, C., Zavattaro, G.: Composing services with jolie. In: ECOWS, pp. 13–22 (2007)Google Scholar
  10. 10.
    Morrison, D.R.: PATRICIA - practical algorithm to retrieve information coded in alphanumeric. J. ACM 15(4), 514–534 (1968)CrossRefGoogle Scholar
  11. 11.
    Mühl, G.: Generic constraints for content-based publish/Subscribe. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 211–225. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2011

Authors and Affiliations

  • Jacopo Mauro
    • 1
    • 2
  • Maurizio Gabbrielli
    • 1
    • 2
  • Claudio Guidi
    • 4
  • Fabrizio Montesi
    • 3
  1. 1.Department of Computer ScienceUniversity of BolognaItaly
  2. 2.Lab. FocusINRIABolognaItaly
  3. 3.IT University of CopenhagenDenmark
  4. 4.italianaSoftware srlImolaItaly

Personalised recommendations