QoS-Aware Service Selection

  • James W. J. XueEmail author
  • Stephen A. Jarvis
Part of the Advanced Information and Knowledge Processing book series (AI&KP)


With the widespread use of the Internet, the number of web services that can provide similar functionality has increased rapidly in recent years. Web service selection has to be based on some non-functional attributes of the services, such as the quality of service (QoS). In this chapter, we use a server switching service that is commonly used in Internet hosting environments to explain how an agent can use a performance model to evaluate services and select the most suitable services among a number of functionally similar services returned by the service discovery. The various criteria that can be used to assess QoS are introduced in this chapter, including mean response time, throughput, system utilisation and others closely related to business such as revenue and operating costs. Service selection in the chosen case study depends on the quality and suitability of various switching policies, in other words, different switching policies can be selected depending on the QoS of the services and the run-time system state. Since the system performance can be evaluated using an analytic model, therefore, the QoS of services is assessed based on the output of the performance model.


Switching Cost Total Revenue Service Selection Queueing Network Admission Control Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. S. Ali, S. A. Ludwig, and O. F. Rana. A Cognitive Trust-Based Approach for Web Service Discovery and Selection. In Third IEEE European Conference on Web Services, 2005.Google Scholar
  2. 2.
    M. Arlitt and T. Jin. A Workload Characterization Study of the 1998 World Cup Web Site. IEEE Network, 14(3):30–37, 2000.CrossRefGoogle Scholar
  3. 3.
    G.Balbo and G. Serazzi. Asymptotic Analysis of Multiclass Closed Queueing Networks: Multiple Bottlenecks. Performance Evaluation, 30(3):115–152, 1997.CrossRefGoogle Scholar
  4. 4.
    P. Barford and M. Crovella. Generating Representative Web Workloads for Network and Server Performance Evaluation. ACM SIGMETRICS Performance Evaluation Review, 26(1):151–160, 1998.CrossRefGoogle Scholar
  5. 5.
    G. Bolch, S. Greiner, H. de Meer, and K. S. Trivedi. Queueing Networks and Markov Chains: modelling and performance evaluation with computer science applications. Wiley, 2nd edition, 2006.Google Scholar
  6. 6.
    J. Y. L. Boudec. Rate Adaptation, Congestion Control and Fairness: A Tutorial, Nov 2005.Google Scholar
  7. 7.
    G. Casale and G. Serazzi. Bottlenecks Identification in Multiclass Queueing Networks Using Convex Polytopes. In Modelling, Analysis, and Simulation of Comp. and Telecommunication Systems (MASCOTS), 2004.Google Scholar
  8. 8.
    P. J. Denning and J. P. Buzen. The Operational Analysis of Queueing Network Models. ACM Computing Surveys, 10(3):225–261, 1978.CrossRefGoogle Scholar
  9. 9.
    D. A. D’Mello and V. S. Ananthanarayana. Quality Driven Web Service Selection and Ranking. In Fifth International Conference on Information Technology (ITNG’08), 2008.Google Scholar
  10. 10.
    D. L. Eager and K. C. Sevcik. Bound Hierarchies for Multiple-class Queueing Networks. Journal of ACM, 33(1):179–206, 1986.CrossRefGoogle Scholar
  11. 11.
    S. Galizia, A. Gugliotta, and J. domingue. A Trust Based Methodology for Web Service Selection. In International Conference on Semantic Computing (ICSC’07), 2007.Google Scholar
  12. 12.
    Y. Gao, J. Na, B. Zhang, L. Yang, and Q. Gong. Optimal Web Services Selection Using Dynamic Programming. In 11th IEEE Symposium on Computers and Communications (ISCC’06), 2006.Google Scholar
  13. 13.
    Internet Trace. Internet Traffic Archive Hosted at Lawrence Berkeley National Laboratory. In, 2008.
  14. 14.
    T. Kerola. The Composite Bound Method for Computing Throughput Bounds in Multiple Class Environments. Performance Evaluation, 6(1):1–9, 1986.MathSciNetCrossRefGoogle Scholar
  15. 15.
    C. Knessl and C. Tier. Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations. Performance Evaluation, 33(4):219–248, 1998.CrossRefGoogle Scholar
  16. 16.
    M. Litoiu. A Performance Analysis Method for Autonomic Computing Systems. ACM Transaction on Autonomous and Adaptive Systems, 2(1):3, 2007.CrossRefGoogle Scholar
  17. 17.
    J. Little. A Proof of the Queueing Formula L = λ W. Operations Research, 9(3):383–387, May 1961.MathSciNetCrossRefGoogle Scholar
  18. 18.
    D. A. Menasce and V. A. F. Almeida. Capacity Planning for Web Performance: metrics, models,and methods. Prentice Hall PTR, 1998.Google Scholar
  19. 19.
    M. Reiser and S. Lavenberg. Mean-value Analysis of Closed Multi-Chain Queueing Networks. Journal of the Association for Computing Machinary, 27:313–322, 1980.CrossRefGoogle Scholar
  20. 20.
    J. Rolia, X. Zhu, M. Arlitt, and A. Andrzejak. Statistical Service Assurances for Applications in Utility Grid Environments. Technical report, Technical Report HPL-2002-155, HP Labs, 2002.Google Scholar
  21. 21.
    P. J. Schweitzer. A Fixed-point Approximation to Product-form Networks with Large Populations. In 2nd ORSA Telecommunication Conference, 1992.Google Scholar
  22. 22.
    K. Sevcik and I. Mitrani. The Distribution of Queueing Network States at Input and Output Instants. Journal of the Association for Computing Machinary, 28(2), 1981.Google Scholar
  23. 23.
    M. Sun and F. Arbab. Qos-driven Service Selection and Composition. In 8th International Conference on Application of Concurrency to System Design, 2008.Google Scholar
  24. 24.
    D. T. Tsesmetzis, I. G. Roussaki, I. V. Papaioannou, and M. E. Anagnostou. QoS awareness Support in Web Service Semantics. In the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW’06), 2006.Google Scholar
  25. 25.
    UDDI. Universal Description Discovery and Integretion. In, 2006.
  26. 26.
    B. Urgaonkar, G. Pacifici, P. J. Shenoy, M. Spreitzer, and A. Tantawi. An Analytical Model for Multi-tier Internet Services and its Applications. ACM SIGMETRICS Performance Evaluation Review, pages 291–302, 2005.Google Scholar
  27. 27.
    L. Vu, M. Hauswirth, and K. Aberer. QoS-Based Service Selection and Ranking with Trust and Reputation. Lecture Notes in Computer Science, 2005.Google Scholar
  28. 28.
    WSDL. Web Serivce Description Language. In wsdl.
  29. 29.
    P. C. Xiong and Y. S. Fan. QoS-aware Web Service Selection by a Synthetic Weight. In Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007.Google Scholar
  30. 30.
    A. Zalewski and A. Ratkowski. Evaluation of Dependability of Multi-tier Internet Business Applications with Queueing Networks. In International Conference on Dependability of Computer Systems ( DEPCOS-RELCOMEX’06), 2006.Google Scholar
  31. 31.
    J. Y. Zhou and T. Yang. Selective Early Request Termination for Busy Internet Services. In 15th International Conference on World Wide Web, Edinburgh, Scotland, 2006.Google Scholar

Copyright information

© Springer-Verlag London 2010

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of WarwickCoventryUK

Personalised recommendations