Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |


D. Biswas, B. Genest. Minimal Observability and Privacy Preserving Compensation for Transactional Services.. Discrete Event Dynamic Systems, December 2013.

Download [help]

Download paper: Adobe portable document (pdf) pdf

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic


{For complex services composed of many (component) services, logging is an integral middleware aspect, especially for providing transactions and monitoring. In the event of a failure, the log allows us to deduce the cause of failure (diagnosis) and recover by compensating the executed services (atomicity). However, for heterogeneous services with parts of the functionality provided by multiple organizations, logging details of all executed services is often impracticable due to privacy/security constraints. Also, logging is expensive in terms of both time and space. Thus, we are interested in determining the minimal number of services that need to be logged, and which is still sufficient to know with certainty the actual sequence of executed services from any given log. Further to privacy issues, the complexity of determining a minimal set of such services to log is actually NP-Complete. To solve {both issues}, we resort to considering each component service as a grey box. Logs are recorded and kept local to each component, and a black-box view of the implementation details of each component is provided. In particular, a service which is reused as a component several times (often observed in real-life services) need not be re-computed each time. We show that this dramatically decreases the complexity up to 2 exponentials. For large monolithic component services that cannot be decomposed simply, we also provide heuristics to compute a small (but not necessarily minimal) number of services to log, and experimentally analyze their accuracy and performance.}


Blaise Genest http://perso.crans.org/~genest/

BibTex Reference

   Author = {Biswas, D. and Genest, B.},
   Title = {{Minimal Observability and Privacy Preserving Compensation for Transactional Services.}},
   Journal = {Discrete Event Dynamic Systems},
   Publisher = {Springer},
   Month = {December},
   Year = {2013}

EndNote Reference [help]

Get EndNote Reference (.ref)