Monitoring for Hierarchical Web Services Compositions

  • Debmalya Biswas
  • Krishnamurthy Vidyasankar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3811)


The most promising feature of the Web services platform is its ability to form new services by combining the capabilities of already existing services, i.e., its composability. The existing services may themselves be composed of other services, leading to a hierarchical composition. In this work, we focus on the monitoring aspect for hierarchical Web services compositions. We are primarily interested in capturing the state of a hierarchical composition at any given point of time (snapshot). We discuss in detail how some of the snapshot algorithms proposed in literature can be extended in a Web services context. Snapshots usually reflect a state of the system which “might have occurred”. Towards this end, we show how we can acquire a state that “actually occurred” from such snapshots. Finally, we discuss the different types of execution related queries and how we can answer them using the captured snapshots.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [B04]
    Borkowski, J.: Hierarchical Detection of Strongly Consistent Global States. In: Proceedings of the 3rd International Symposium on Parallel and Distributed Computing, pp. 256–261 (2004)Google Scholar
  2. [CL85]
    Chandy, K.M., Lamport, L.: Distributed Snapshots: Determining Global States of Distributed Systems. ACM Transactions on Computer Systems 3(1), 63–75 (1985)CrossRefGoogle Scholar
  3. [CM91]
    Cooper, R., Marzullo, K.: Consistent detection of global predicates. In: Proceedings of the ACM/ONR Workshop on Parallel Distributed Debugging, pp. 163–173 (1991)Google Scholar
  4. [GW96]
    Garg, V.K., Waldecker, B.: Detection of Strong Unstable Predicates in Distributed Programs. IEEE Trans. Parallel and Distributed Systems, 1323–1333 (December 1996)Google Scholar
  5. [L78]
    Lamport, L.: Time, Clocks and Ordering of Events in Distributed Systems. Comm. ACM 21(7), 558–565 (1978)zbMATHCrossRefGoogle Scholar
  6. [LAP03]
    Lazovik, A., Aiello, M., Papazoglou, M.: Planning and Monitoring the Execution of Web Service Requests. In: Orlowska, M.E., et al. (eds.) ICSOC 2003. LNCS, vol. 2910, pp. 335–350. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. [M89]
    Mattern, F.: Virtual time and global states of distributed systems. In: Parallel and Distributed Algorithms, pp. 215–226. Elsevier Science Publishers, North-Holland (1989)Google Scholar
  8. [M91]
    Mills, D.L.: Internet time synchronization: the Network Time Protocol. IEEE Trans. Communications 39(10), 1482–1493 (1991)CrossRefGoogle Scholar
  9. [MC88]
    Miller, B.P., Choi, J.D.: Breakpoints and Halting in Distributed Programs. In: Proceedings of the 8th International Conference on Distributed Computing Systems, pp. 316–323. CS Press (1988)Google Scholar
  10. [PBBST04]
    Pistore, M., Bertoli, P., Barbon, F., Shaparau, D., Traverso, P.: Planning and Monitoring Web Service Composition. In: Proceedings of the Workshop on Planning and Scheduling for Web and Grid Services (2004)Google Scholar
  11. [SM92]
    Schwartz, R., Mattem, F.: Detecting causal relationships in distributed computations. search of the holy grail. Tech. Rep. SFB124- 15/92, Univ. of Kaiserslautern, Germany (1992)Google Scholar
  12. [V89]
    Venkatesan, S.: Message-optimal incremental snapshots. In: Proceedings of the 9th International Conference on Distributed Computing Systems, pp. 53–60 (1989)Google Scholar
  13. [WSA]
  14. [WSDM]
    Specification: Web Services Distributed Management (WSDM),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Debmalya Biswas
    • 1
  • Krishnamurthy Vidyasankar
    • 1
  1. 1.Dept. of Computer ScienceMemorial University of NewfoundlandSt. John’sCanada

Personalised recommendations