Title :
Graph planning approach for adaptive substitution of conversational services
Author :
Chen, Leilei ; Qin, Haihuan
Author_Institution :
Sch. of Comput. Sci., Fudan Univ., Shanghai, China
Abstract :
Dynamic substitution of conversational services during the execution of service orchestrations is a challenging issue in Service-Oriented Architecture. For a conversational service and its candidate substitute service, there may exist mismatches at interface level as well as protocol level. To make the service substitution consistent, it is essential to implement adaptation to overcome both types of mismatches. In this paper, we present an automatic approach to generate adaptation contract for conversational service substitution. Our approach is based on graph planning technique, which enables us to retrieve a solution in polynomial time. Experiments show that the proposed approach is potentially applicable for on-the-fly service substitution.
Keywords :
Web services; computational complexity; graph theory; planning (artificial intelligence); protocols; service-oriented architecture; SOA; candidate substitute service; conversational service adaptive substitution; conversational service dynamic substitution; graph planning technique; interface level; on-the-fly service substitution; polynomial time; protocol level; service orchestration execution; service-oriented architecture; Abstracts; Concrete; Contracts; Encoding; Manganese; Planning; Protocols; adaptation; conversational service; graph planning; service substitution;
Conference_Titel :
Service Systems and Service Management (ICSSSM), 2012 9th International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4577-2024-6
DOI :
10.1109/ICSSSM.2012.6252308