-
[show abstract]
[hide abstract]
ABSTRACT: Service-based software system (SBS) is a software system based on service-oriented architecture (SOA). Although often treated as a composite service, an SBS is proposed from a more practical point of view based on restricted service provisions. In the highly competitive market, just meeting such requirements seems not enough to get more customers for service providers, and they usually provide additional preferential policies, such as a special order "buy-two-get-one-free". However, most of current adaptation approaches focus on single transaction, which makes it hard to take full advantage of such preferential policies in reselecting substitutable services. In this paper, we try to make the adaptation decision and reselect services from a broader view, i.e. expand the computation domain from single transaction to the whole lifecycle of an SBS by considering all of the past, current and predicable future executions. We call it "long-term benefit" to distinguish benefit in current approaches and propose a long-term benefit driven adaptation approach in this paper. In our approach, services that would bring the max expected long-term benefit would be selected and substituted into current instance in once adaptation. As the long-term benefit is accumulated in several executions, i.e. it depends on a decision sequence, we model the decision making problem as a sequential decision problem, and describe a realization based on partially observable Markov decision process (POMDP) for maximizing the real income in providing an SBS as an example.
Web Services (ICWS), 2011 IEEE International Conference on; 08/2011
-
IEEE International Conference on Web Services, ICWS 2011, Washington, DC, USA, July 4-9, 2011; 01/2011
-
[show abstract]
[hide abstract]
ABSTRACT: In Web Services composition, effectively appraising of QoS of Web Services is a main method of service selecting. Most of current QoS models do not consider the uncertainty, subjectivity, interacting and business relativity of the non-functional attributes of services. And they lack of the deep and thorough analysis of user requirements. Thus they are not able to provide sufficient support to service personalization, and they are lack of dynamic adaptability of constraints. By efficiently considering the impact on QoS model of the non-functional attributes of Web Services, this paper generates a personalized QoS model of a single service, and a dynamic personalized QoS appraise model, based on service effectiveness. The user requirement-driven service dynamic personalized QoS model proposed by this paper provides exquisite and appropriate appraise for the QoS of the whole composition flow. The analysis of the scenario shows that the method proposed in this paper is able to appraise Web Services more accurately and effectively.
Dependability, International Conference on. 07/2010;
-
[show abstract]
[hide abstract]
ABSTRACT: Due to the dynamic nature of environment in service computing, it becomes more important to make the Web service composition able to self-adapt to changes in its environment. Achieving this goal is a challenging task, as the performance of a composite Web service will be decreased if the adaptation happens frequently in runtime. In this paper, we improve adaptation of Web service composition by predicting the probability that a change will actual affect the running composite service, which is named change impact probability (CIP), and provide a methodology based on a comprehensive QoS model of a QoS change and an execution state model of an executing composite service for computing the CIP. To bring the proposed approach to fruition, we develop a prototype system and apply the approach to a loan rate query service for illustration.
Dependability, International Conference on. 07/2010;
-
[show abstract]
[hide abstract]
ABSTRACT: Nowadays, Web services are usually aggregated into a composite one to satisfy customers more and more complex requirements. Generally, there may be several different candidate services to carry out one task in a composite service, so a choice needs to be made to help users select the most suitable one. Based on the quality of services, this paper generates a Weighted Multistage Graph for composite service, and transforms the problem of service selection into the one of how to get a longest path. Considering the problem of Interface Matching, this paper presents a 3-layer Web service organization model (WS3LM), which can help get an executable composite service. This paper describes and compares two types of selection approaches: one type of local optimal selection and the other type of global optimal selection using Exhaustive Search Algorithm, Dynamic Programming.
Computers and Communications, 2006. ISCC '06. Proceedings. 11th IEEE Symposium on; 07/2006
-
[show abstract]
[hide abstract]
ABSTRACT: This paper first presents a 3-layer organization model and an evaluation model for services composition. Then it presents an approach for selecting global optimal execution plan of Web services composition, which is based on weighted multistage graph and fully considering interface-matching between Web services. Based on this approach, we can select the optimal execution plan dynamically by Dynamic Programming, Integer Programming, Genetic Algorithm or Immune Algorithm, which can solve the problem efficiently and make the selection more correct.
Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on; 01/2006
-
Advanced Web and Network Technologies, and Applications, APWeb 2006 International Workshops: XRA, IWSN, MEGA, and ICSE, Harbin, China, January 16-18, 2006, Proceedings; 01/2006
-
Interdisciplinary and Multidisciplinary Research in Computer Science, IEEE CS Proceeding of the First International Multi-Symposium of Computer and Computational Sciences (IMSCCS|06), June 20-24, 2006, Zhejiang University, Hangzhou, China, Vol. 2; 01/2006
-
[show abstract]
[hide abstract]
ABSTRACT: In order to realize a high-quality and good-performance service composition, based on current approach, we propose a new QoS-driven dynamic selection of composite Web services, which takes account of both the QoS properties and interface parameters matching degree. When doing the selection, we aware that the task is more or less a multistage decision-making process. Motivated by neural networks' high parallel performance and genetic algorithm's powerful computation ability, a genetic algorithm optimized neural network algorithm is proposed in this paper for such task. In order to make this algorithm more adaptable for multistage decision-making problem, we propose a new structured neural network to express the composed service instead of using the traditional neural networks, which minimizes the neurons involved and shows high performance than the earlier ones. Finally, through experimentation one can find that method proposed in this paper is more practical and effective than others
Cyberworlds, 2005. International Conference on; 12/2005
-
[show abstract]
[hide abstract]
ABSTRACT: In order to realize a high quality and good performance service composition, we propose new QoS driven dynamic selection of composite Web services, which takes account of both the QoS properties and interface parameter matching degree. When doing the selection, we are aware that the task is more or less a multistage decision making process. Motivated by transiently chaotic neural network high parallel performance and powerful computation ability, a new structured transiently chaotic neural network algorithm is proposed. In order to make this algorithm more adaptable for the multistage decision making problem, we propose a new structured neural network to express the composed service instead of using traditional neural networks, which minimizes the neurons involved and shows higher performance. Finally, through experimentation one can find that the method proposed in this paper is more practical and effective than others.
Service-Oriented System Engineering, 2005. SOSE 2005. IEEE International Workshop; 11/2005
-
Advances in Computer Science - ASIAN 2005, Data Management on the Web, 10th Asian Computing Science Conference, Kunming, China, December 7-9, 2005, Proceedings; 01/2005
-
Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2005), 5-8 December 2005, Dalian, China; 01/2005
-
iiWAS'2005 - The Seventh International Conference on Information Integrationand Web-based Applications Services, 19-21 September 2005, Kuala Lumpur, Malaysia; 01/2005
