Revenue maximization in web service provision

  • Michele Mazzucco
  • Isi Mitrani
  • Jennie Palmer
  • Mike Fisher
  • Paul McKee
Special Issue Paper


An architecture of a hosting system is presented, where a number of servers are used to provide different types of web services to paying customers. There are charges for running jobs and penalties for failing to meet agreed Quality-of-Service requirements. The objective is to maximize the total average revenue per unit time. Dynamic policies for making allocation and admission decisions are introduced and evaluated. The results of several experiments with a real implementation of the architecture are described.


Web Service Hosting  Resource Allocation  Admission Control  Queuing Theory 


  1. 1.
    Abramowitz M, Stegun I (1972) Handbook of Mathematical Functions. 10th printing. National Bureau of Standards, Washington D.C.Google Scholar
  2. 2.
    Bennani M, Menasce D (2005) Resource Allocation for Autonomic Data Centers using Analytic Performance Models. Proceedings of the Second International Conference on Autonomic Computing (ICAC 2005), pp 229–240Google Scholar
  3. 3.
    Chandra A, Gong W, Shenoy P (2003) Dynamic resource allocation for shared data centers using online measurements. 11th IEEE/ACM International Workshop on Quality of Service (IWQoS 2003), pp 381–398Google Scholar
  4. 4.
    Ghosh S, Rajkumar R, Hansen J, Lehoczky J (2003) Scalable Resource Allocation for Multi-Processor QoS Optimization. Procs 23rd Int Conf on Distributed Computing Systems, pp 174–183Google Scholar
  5. 5.
    Gradshtein I, Ryzhik I (1980) Table of Integrals, Series, and Products. Academic Press, LondonGoogle Scholar
  6. 6.
    Hansen JP, Ghosh S, Rajkumar R, Lehoczky J (2004) Resource Management of Highly Configurable Tasks. Procs. 18th Int Parallel and Distributed Processing Symposium, pp 116–123Google Scholar
  7. 7.
    Huberman BA, Wu F, Zhang L (2005) Ensuring trust in one time exchanges: solving the QoS problem. NETNOMICS 7(1):27–37CrossRefGoogle Scholar
  8. 8.
    Kanodia V, Knightly E (2000) Multi-Class Latency-Bounded Web Services. Eighth International Workshop on Quality of Service (IWQoS 2000), pp 231–239Google Scholar
  9. 9.
    Kephart JO, Chess DM (2003) The vision of autonomic computing. Computer 36(1):41–50CrossRefMathSciNetGoogle Scholar
  10. 10.
    Levy R, Nagarajarao J, Pacifici G, Spreitzer A, Tantawi A, Youssef A (2003) Performance Management for Cluster Based Web Services. IFIP/IEEE Eighth International Symposium on Integrated Network Management, pp 247–261Google Scholar
  11. 11.
    Mitrani I (1998) Probabilistic Modelling. Cambridge University Press, CambridgeMATHGoogle Scholar
  12. 12.
    Rajkumar R, Lee C, Lehoczky J, Siewiorek D (1997) A Resource Allocation Model for QoS Management. Procs 18th IEEE Real-Time Systems Symposium, pp 298–307Google Scholar
  13. 13.
    Sallé M, Bartolini C (2004) Management by Contract. In: Procs. 2004 IEEE/IFIP Network Operations and Management SymposiumGoogle Scholar
  14. 14.
    Villela D, Pradhan P, Rubenstein D (2007) Provisioning Servers in the Application Tier for E-Commerce Systems. ACM Trans Internet Technol 7(1):7CrossRefGoogle Scholar
  15. 15.
    Welsh M, Culler D, Brewer E (2001) SEDA: An Architecture for Well-Conditioned, Scalable Internet Services. Proceedings of the Eighteenth Symposium on Operating Systems Principles, pp 230–243Google Scholar
  16. 16.
    Whitt W (1993) Approximations for the GI/G/m queue. Prod Operat Manage 2(2):114–161MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag 2009

Authors and Affiliations

  • Michele Mazzucco
    • 1
  • Isi Mitrani
    • 1
  • Jennie Palmer
    • 1
  • Mike Fisher
    • 2
  • Paul McKee
    • 2
  1. 1.School of Computing ScienceNewcastle UniversityNewcastleUK
  2. 2.BT GroupIpswichUK

Personalised recommendations