Toggle Main Menu Toggle Search

ePrints

Implementing business conversations with consistency guarantees using message-oriented middleware

Lookup NU author(s): Dr Carlos Molina-Jimenez, Emeritus Professor Santosh Shrivastava, Dr Nick Cook

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

The paper considers distributed applications where interactions between constituent services take place via messages in an asynchronous environment with unpredictable communication and processing delays; further, interacting parties are not required to be online at the same time. Message-oriented middleware (MoM) is commonly used for connecting such loosely coupled distributed applications. Despite loose coupling, many service interactions have temporal and message validation constraints. A failure to deliver a valid message within its time constraint could cause mutually conflicting views of an interaction (one party regarding it as timely whilst the other party regarding it as untimely) leading to application level inconsistencies. In a loosely coupled system, such inconsistencies could remain undetected for a long time, requiring costly application level recovery procedures. This paper describes how synchronisation support providing multilateral consistency guarantees can he provided using the underlying MoM to prevent inconsistencies from reaching application level.


Publication metadata

Author(s): Molina-Jimenez C, Shrivastava S, Cook N

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007)

Year of Conference: 2007

Pages: 51-62

ISSN: 1541-7719

Publisher: IEEE Computer Society

URL: http://dx.doi.org/10.1109/EDOC.2007.21

DOI: 10.1109/EDOC.2007.21

Library holdings: Search Newcastle University Library for this item

ISBN: 9780769528915


Actions

    Link to this publication


Share