Provisioning servers in the application tier for E-commerce systems
- 13 November 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Server providers that support e-commerce applications as a service to multiple e-commerce websites traditionally use a tiered server architecture. This architecture includes an application tier to process requests that require dynamically generated content. How this tier is provisioned can significantly impact a provider's profit margin. We study methods to provision servers in the application serving tier to increase a server provider's profits. First, we examine actual traces of request arrivals to the application tier of e-commerce sites, and show that the arrival process is effectively Poisson. Next, we construct an optimization problem in the context of a set of application servers modeled as M/G/l/PS queueing systems, and derive three simple methods to approximate the allocation that maximizes profits. Simulation results demonstrate that our approximation methods achieve profits that are close to optimal and are significantly higher than those achieved via simple heuristics.Keywords
This publication has 20 references indexed in Scilit:
- Priority mechanisms for OLTP and transactional Web applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Modeling object characteristics of dynamic Web contentJournal of Parallel and Distributed Computing, 2003
- An approach to pricing, optimal allocation and quality of service provisioning in high-speed packet networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On maximizing service-level-agreement profitsPublished by Association for Computing Machinery (ACM) ,2001
- Analysis of queues under correlated arrivals with applications to web server performanceACM SIGMETRICS Performance Evaluation Review, 2001
- In search of invariants for e-business workloadsPublished by Association for Computing Machinery (ACM) ,2000
- Stochastically bounded burstiness for communication networksIEEE Transactions on Information Theory, 2000
- Optimal allocation of multiple class resources in computer systemsPublished by Association for Computing Machinery (ACM) ,1988
- Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and DataIEEE Journal on Selected Areas in Communications, 1986
- Optimal static load balancing in distributed computer systemsJournal of the ACM, 1985