DocumentCode :
2864926
Title :
A Dynamical Optimization Approach for Service Process Library
Author :
Wang, Lei ; Cao, Jian ; Zhao, Haiyan
Author_Institution :
Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China
fYear :
2011
fDate :
12-14 Dec. 2011
Firstpage :
1136
Lastpage :
1143
Abstract :
The capability of an intelligent services system is based on a set of services processes, which are often organized into and managed by a process library. In order to react to a outside requirement, the system takes one of the approaches of using a predefined process directly, composing existing process models or generating a new process model based on a search algorithm on demand. Therefore, to decide which process models should be stored and how to update process models within the library is very important to improve the efficiency and lower the space cost of the system. A suffix tree-based optimization approach is proposed, which is based on a tree-structured representation. The algorithm, its complexity analysis and experiments are presented.
Keywords :
computational complexity; libraries; optimisation; service-oriented architecture; tree data structures; complexity analysis; dynamical optimization approach; intelligent service system; process model; search algorithm; service process library; suffix tree-based optimization approach; tree-structured representation; Algorithm design and analysis; Analytical models; Atmospheric modeling; Educational institutions; Indexes; Libraries; Optimization; Service Process Library; Suffix Tree;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Dependable, Autonomic and Secure Computing (DASC), 2011 IEEE Ninth International Conference on
Conference_Location :
Sydney, NSW
Print_ISBN :
978-1-4673-0006-3
Type :
conf
DOI :
10.1109/DASC.2011.185
Filename :
6118863
Link To Document :
بازگشت