Abstract
The emerging Web services are building blocks for creating highly distributed e-Business applications, allowing any services to be integrated as long as they are Web-enabled. This interoperability allows businesses to dynamically discover and aggregate a range of component services to more easily create value-added composite services. One of the problems underlying the deployment of such composite services on the Web is service co-allocation that arises when a composite service needs to ensure all the required component services to be available for execution at the same time. This paper presents a protocol, named WSCP (Web Service Co-allocation Protocol), that supports fast co-allocation of distributed Web services when they are shared by multiple independent composite Web services. Our objective is to minimize the waiting time incurred on a composite service before it successfully co-allocates its components. WSCP is inspired by two seemingly unrelated ideas in distributed computing, namely the tentative hold protocol and the backoff protocol. By efficiently combining and taking advantage of these two protocols, WSCP is able to achieve a significant improvement over existing protocols while effectively minimizing livelock.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Newcomer, E.: Understanding Web Services. Addison-Wesley, Reading (2002)
Yang, J., Papazoglou, M.: Web component: A substrate for Web service reuse and composition. In: Pidduck, A.B., Mylopoulos, J., Woo, C.C., Ozsu, M.T. (eds.) CAiSE 2002. LNCS, vol. 2348, p. 21. Springer, Heidelberg (2002)
Papazoglou, M.P.: Web services and business transactions. World Wide Web: Internet and Web Information Systems 6, 49–91 (2003)
Tuecke, S., Czajkowski, K., Foster, I., Frey, J., Graham, S., Kesselman, C.: Grid service specification. Technical report, Open Grid Service Infrastructure WG, Global Grid Forum (2002)
Bernstein, P.A., Newcomer, E.: Principles of Transaction Processing. Morgan Kaufmann, San Francisco (1997)
Menascé, D.A.: QoS issues in Web services. IEEE Internet Computing, 72–75 (2002)
Roberts, J., Srinivasan, K.: Tentative hold protocol part 1: White paper (2001), http://www.w3.org/TR/tenthold-1/
Håstad, J., Leighton, T., Rogoff, B.: Analysis of backoff protocols for multiple access channels. SIAM Journal on Computing 25, 740–774 (1996)
Park, J., Choi, K.: Design of an efficient tentative hold protocol for automated coordination of multi-business transactions. In: Proceedings of the IEEE Conference on E-Commerce (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, J., Yang, T. (2003). A Protocol for Fast Co-Allocation of Shared Web Services. In: Benatallah, B., Shan, MC. (eds) Technologies for E-Services. TES 2003. Lecture Notes in Computer Science, vol 2819. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39406-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-39406-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20052-9
Online ISBN: 978-3-540-39406-8
eBook Packages: Springer Book Archive