An Efficient Management of Correlation Sets with Broadcast

International audience 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 mechan...

Full description

Bibliographic Details
Main Authors: Mauro, Jacopo, Gabbrielli, Maurizio, Guidi, Claudio, Montesi, Fabrizio
Other Authors: Alma Mater Studiorum Università di Bologna = University of Bologna (UNIBO), Foundations of Component-based Ubiquitous Systems (FOCUS), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), italianaSoftware srl., IT University of Copenhagen (ITU), Wolfgang Meuter, Gruia-Catalin Roman, TC 6, WG 6.1
Format: Conference Object
Language:English
Published: HAL CCSD 2011
Subjects:
[INFO]Computer Science [cs]
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
Iceland
Online Access:https://inria.hal.science/hal-01582988
https://inria.hal.science/hal-01582988/document
https://inria.hal.science/hal-01582988/file/978-3-642-21464-6_6_Chapter.pdf
https://doi.org/10.1007/978-3-642-21464-6_6
Description
Summary:International audience 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.

Similar Items