DocumentCode :
2984176
Title :
A Tabu Search Approach for Dynamic Service Substitution in SOA Applications
Author :
Zhang, Can ; Chen, Haopeng ; Du, Jinbo
Author_Institution :
Sch. of Software, Shanghai Jiao Tong Univ., Shanghai, China
fYear :
2011
fDate :
12-15 Dec. 2011
Firstpage :
284
Lastpage :
289
Abstract :
Due to the possibility of internal changes of services or changes in their environment, dynamic service substitution has become a key problem in Service Oriented Architecture (SOA). In recent years, researchers have worked out several algorithms for dynamic service substitution. However, the performance of these algorithms is generally not that satisfactory. In this paper, we propose a heuristic service substitution algorithm based on Tabu Search. The algorithm models the service substitution problem as searching valid solutions in the Candidate Service Graph (CSG). In the end, the effectiveness and performance of the algorithm are studied by simulations. The simulation results show that the algorithm performs very well in dynamic adaption, especially when the scale of the service substitution problem surges.
Keywords :
graph theory; search problems; service-oriented architecture; SOA applications; candidate service graph; dynamic service substitution; heuristic service substitution algorithm; service oriented architecture; tabu search approach; Availability; Educational institutions; Heuristic algorithms; Quality of service; Service oriented architecture; Vectors; SOA; service substitution; tabu search;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Services Computing Conference (APSCC), 2011 IEEE Asia-Pacific
Conference_Location :
Jeju Island
Print_ISBN :
978-1-4673-0206-7
Type :
conf
DOI :
10.1109/APSCC.2011.50
Filename :
6127974
Link To Document :
بازگشت