Mangala Gowri Nanda
Neeran Karnik
ABSTRACT
Web Services are emerging as the standard mechanism for making information and software available programmatically via the Internet, and as building blocks for applications. A composite web service may be built using multiple component web services. Once its specification has been developed, the composite service may be orchestrated either using a centralized engine or in a decentralized fashion. Decentralized orchestration improves scalability and concurrency. Dynamic binding coupled with decentralized orchestration adds high availability and fault tolerance to the system. In this paper, we categorize different forms of concurrency and provide an algorithm to identify these forms in a composite service specification. We also consider the impact of dynamic binding and faults on synchronization constructs.
- A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986. Google Scholar
Digital Library
- M. Aron, D. Sanders, P. Druschel, and W. Zwaenepoel. Scalable content-aware request distribution in cluster-based netwrok servers. In Proceedings of the 2000 USENIX Annual Technical Conference, June 2000. Google ScholarDigital Library
- V. Atluri, S. A. Chun, and P. Mazzoleni. A chinese wall security model for decentralized workflow systems. In Proc. of the Conference on Computer and Communications Security, November 2001. Google ScholarDigital Library
- G. Cabri, L. Leonardi, and F. Zambonelli. Coordination models for internet applications based on mobile agents. IEEE Computer Magazine, 1999. Google ScholarDigital Library
- P. Ciancarini, R. Tolksdorf, and F. Zambonelli. Coordination middleware for xml-centric applications. In Proceedings of the ACM Symposium on Applied Computing, 2002. Google ScholarDigital Library
- A. Fox, S. D. Gribble, Y. Chawathe, E. A. Brewer, and P. Gauthier. Cluster-based scalable network services. In Proceedings of the ACM Symposium of Operating Systems (SOSP), October 1997. Google ScholarDigital Library
- S. D. Gribble, E. A. Brewer, J. M. Hellerstein, and D. Culler. Scalable, distributed data structures for internet service construction. In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI2000), October 2000. Google ScholarDigital Library
- K.-H. Kim and C. A. Ellis. Workflow performance and scalability analysis using the layered queuing modeling methodology. In Proceedings of the International Conference on Supporting Group Work, 2001. Google ScholarDigital Library
- N. R. Mehta, N. Medvidovic, and S. Phadke. Towards a taxonomy of software connectors. In Proceedings of the 22nd International Conference on Software Engineering(ICSE 2000), May 2000. Google ScholarDigital Library
- M. G. Nanda and S. Chandra. Decentralizing composite web services. In preparation.Google Scholar
- J. Nieh, C. Vaill, and H. Zhong. Virtual-time round-robin: An O(1) proportional share scheduler. In Proceedings of the 2001 USENIX Annual Technical Conference, June 2001. Google ScholarDigital Library
- K. Ottenstein and L. Ottenstein. The program dependence graph in a software development environment. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pages 177--184. ACMSIGSOFT, 1984. Google ScholarDigital Library
- V. S. Pai, M. Aron, G. Banga, M. Svendsen, P. Druschel, W. Zwaenepoel, and E. Nahum. Locality-aware request distribution in cluster-based network servers. In Proceedings of the Eight International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VIII), October 1998. Google ScholarDigital Library
- S. R. Ponnekanti and A. Fox. SWORD: A developer toolkit for building composite web services. In Proceedings of the 11th International World Wide Web Conference, 2002.Google Scholar
- V. Sarkar. Automatic partitioning of a program dependence graph into parallel tasks. IBM Journal of Research and Development, 35:779--804, 1991. Google ScholarDigital Library
- M. Sayal, Y. Breitbart, P. Scheuermann, and R. Vingralek. Selection algorithms for replicated web servers. In Proceedings of the ACM Workshop on Internet Server Performance (WISP'98), 1998. Google ScholarDigital Library
- T. Stricker, J. Stichnoth, D. O. Hallaron, and T. Gross. Decoupling synchronization and data transfer in message passing systems of parallel computers. In Proceedings of the ACM International Conference on Supercomputing, 1995. Google ScholarDigital Library
- A. Tripathi, T. Ahmed, V. Kakani, and S. Jaman. Distributed Collaborations using Network Mobile Agents. In 2nd International Symposium on Agent Systems and Applications/4th International Symposium on Mobile Agents, September 2000. Google ScholarDigital Library
- H. Yu and A. Vahdat. The costs and limits of availability for replicated services. In Proceedings of the ACM Symposium of Operating Systems, 2001. Google ScholarDigital Library
Recommendations
Decentralized orchestration of composite web services
WWW Alt. '04: Proceedings of the 13th international World Wide Web conference on Alternate track papers & postersWeb services make information and software available programmatically via the Internet and may be used as building blocks for applications. A composite web service is one that is built using multiple component web services and is typically specified ...
Composing Web Services: A QoS View
An Internet application can invoke several services--a stock-trading Web service, for example, could invoke a payment service, which could then invoke an authentication service. Such a scenario is called a composite Web service, and it can be specified ...
Decentralized Orchestration with Local Centralized Orchestration for Composite Web Services
PDCAT '10: Proceedings of the 2010 International Conference on Parallel and Distributed Computing, Applications and TechnologiesDuring the execution period of composite Web services, the conventional centralized orchestration (CO) tends to incur various drawbacks such as unnecessary traffic, inappropriate dependencies, etc. Decentralized orchestration is advocated to solve these ...
Comments