Affiliation:
1. Jilin Medical College
2. Chengdu electromechanical college
3. Southwest Jiaotong University
Abstract
Service users in Service Oriented Architecture (SOA) need to choose provider from the candidates that respond their service requests in succession. For time-sensitive services, the user has to decide the optimal time to stop waiting for the next coming providers in order to shorten the total time. The Boundary Payoff Determination (BPD) approach is proposed in the paper to help the users to predict the payoff of each coming providers, and equips the users with practical conditions and steps to make proper decision. Simulation experiments show BPD superior to the existed methods and able to increase the QoS level of time-sensitive services in SOA.
Publisher
Trans Tech Publications, Ltd.
Reference13 articles.
1. M P. Parazoglou. Service-oriented Computing: Concepts, Characteristics and Directions, In Proc. 4th IEEE International Conference on Web Information Systems Engineering, 2003, pp.3-12.
2. C. Schröpfer, M. Binshtok, S. E. Shimony, A. Dayan, R. Brafman, P. Offermann, O. Holschke. Introducing Preferences over NFPs into Service Selection in SOA, In Proc. International Conference on Service-Oriented Computing Workshops, LNCS 4907, 2009, p.68.
3. F. Li, F. C. Yang, S. Su. On Distributed Service Selection for QoS Driven Service Composition, In Proc. 7th International Conference on E-Commerce and Web Technologies, LNCS 4082, 2006, pp.173-182.
4. T. Yu and K. Lin. Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints, In Proc. 3rd International Conference on Service-Oriented Computing, LNCS 3826, 2005, pp.130-143.
5. H. C. Wang, C. S. Lee, T.H. Ho. Combining Subjective and Objective QoS Factors for Personalized Web Service Selection. Expert Systems with Applications, 2007, 32(2): pp.571-584.