The Services Composition Algorithm in Incomplete Visible and Dynamic Environment

As the increasing of the type and number for web services, how to effectively deal with composition service problem in transparent and dynamic environment has become a hot issue for researchers. Considering most of the current works for service composition are based on the static and known topology, this paper puts forward a new service composition algorithm-NVDSCM, which show great interest for service composition in dynamic and partially-known environment. By dynamically and automatically monitoring the connection state with neighbors, NVDSCM can effectively reduce the number of duplicated and unnecessary composition request. Furthermore, it applies local-repair strategy to maintain the connection relation with neighbors for each web services, which is very important to improve algorithm efficiency for large scope. Based on the analysis of the experiment, NVDSCM can effectively solve the problem of service composition in partially-known and dynamic environment, including better composition path quality and more stability as the change of scope size.