article

Provisioning servers in the application tier for e-commerce systems

Authors:

Daniel Villela,

Prashant Pradhan,

Dan RubensteinAuthors Info & Claims

ACM Transactions on Internet Technology (TOIT), Volume 7, Issue 1

Pages 7 - es

https://doi.org/10.1145/1189740.1189747

Published: 01 February 2007 Publication History

Abstract

Server providers that support e-commerce applications as a service for multiple e-commerce Web sites traditionally use a tiered server architecture. This architecture includes an application tier to process requests for dynamically generated content. How this tier is provisioned can significantly impact a provider's profit margin. In this article we study methods to provision servers in the application serving tier that increase a server provider's profits. First, we examine actual traces of request arrivals to the application tier of an e-commerce site, 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/1/PS queueing systems, and derive three simple methods that 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.

References

[1]

Almeida, V., Fonseca, R., Mendes, M. A., and Menasce, D. 2000. Resource management policies for e-commerce servers. Perf. Eval. Review 27, 4 (Mar.).

Digital Library

[2]

Challenger, J., Dantzig, P., Iyengar, A., Squillante, M., and Zhang, L. 2004. Efficiently serving dynamic data at highly accessed web sites. IEEE/ACM Trans. Netw. 12, 2.

Digital Library

[3]

de Farias, D., King, A., and Squillante, M. 2002. Dynamic control of web server farms. In INFORMS Revenue Management Section Conference.

[4]

Epperson, J. F. 2001. An Introduction to Numerical Methods and Analysis. J. Wiley, New York, NY.

[5]

Federgruen, A. and Groenvelt, H. 1986. The greedy procedure for resource allocation problems: necessary and sufficient conditions for optimality. Oper. Res. 34, 908--918.

[6]

Grossglauser, M. and Bolot, J.-C. 1999. On the long range dependence in network traffic. IEEE/ACM Trans. Netw. 7, 5 (Oct.), 629--640.

Digital Library

[7]

Harchol-Balter, M., Sigman, K., and Wierman, A. 2002. Understanding the slowdown of large jobs. Perf. Eval. Review 30, 3, 9--11.

Digital Library

[8]

Libman, L. and Orda, A. 1999. The designer's perspective to atomic noncooperative networks. IEEE/ACM Trans. Netw.

Digital Library

[9]

Liu, Z., Squillante, M., and Wolf, J. 2001a. On maximizing service-level-agreement profits. In Proceedings of the ACM Conference on Electronic Commerce, 213--223.

Digital Library

[10]

Liu, Z., Squillante, M., and Wolf, J. 2001b. Optimal control of resource allocation in e-business environments with strict quality-of-service performance guarantees. Tech. rep., IBM Research Division.

[11]

McWherter, D., Schroeder, B., Ailamaki, N., and Harchol-Balter, M. 2004. Priority mechanisms for OLTP and transactional Web applications. In Proceedings of the International Conference on Data Engineering (ICDE 2004). Boston, MA.

Digital Library

[12]

Menasce, D., Almeida, V., Riedi, R., Fonseca, R., and Jr., W. M. 2000. In search of invariants for e-business workloads. In Proceedings of the ACM Conference on Electronic Commerce. Minneapolis, MN, 56--65.

Digital Library

[13]

Nahum, E. 2002. Deconstructing specweb99. In Proceedings of the WCW'99. Boulder, CO.

[14]

Ryu, B. and Elwalid, A. 1996. The importance of long-range dependence of VBR video traffic in ATM traffic engineering: myths and realities. In Proceedings of the ACM SIGCOMM'96. Palo Alto, CA, 3--14.

Digital Library

[15]

Sairamesh, J., Ferguson, D., and Yemini, Y. 1995. An approach to pricing, optimal allocation and quality of service. In Proceedings of the INFOCOM'95, 1111--1119.

Digital Library

[16]

Shi, W., Collins, E., and Karamcheti, V. 2003. Modeling object characteristics of dynamic web content. J. Para. Distrib. Comput.

Digital Library

[17]

Squillante, M., Woo, B., and Zhang, L. 2001. Analysis of queues under correlated arrivals with applications to Web server performance. Perf. Eval. Rev. 28, 4 (Mar.), 41--43.

Digital Library

[18]

Sriram, K. and Whitt, W. 1986. Characterizing superposition arrival processes in packet multiplexers for voice and data. IEEE J. Sel. Areas Comm. 4, 6 (Sept.), 833--846.

Digital Library

[19]

Starobinski, D. and Sidi, M. 2000. Stochastically bounded burstiness for communication networks. IEEE Trans. Info. Theory 46, 1 (Jan.), 206--212.

Digital Library

[20]

Tantawi, A. and Towsley, D. 1985. Optimal static load balancing in distributed computer systems. J. ACM 32, 2, 445--465.

Digital Library

[21]

Tantawi, A., Wolf, J., and Towsley, D. 1988. Optimal allocation of multiple class resources in computers systems. In Proceedings of the Sigmetrics, 253--260.

Digital Library

[22]

Urgaonkar, B., Pacifici, G., Shenoy, P., Spreitzer, M., and Tantawi, A. 2005. An analytical model for multi-tier internet services and its applications. In Proceedings of Sigmetrics 2005, 291--302.

Digital Library

[23]

Villela, D., Pradhan, P., and Rubenstein, D. 2004. Provisioning servers at the applicatior tier for e-commerce systems. In Proceedings of the International Workshop on Quality of Service (2004). Montreal, Canada.

[24]

Wolf, J. and Yu, P. 2001. On balancing the load in a clustered web farm. ACM Trans. Internet Tech. 1, 2 (Nov.), 231--261.

Digital Library

[25]

Yaron, O. and Sidi, M. 1993. Performance and stability of communication networks via robust exponential bounds. IEEE/ACM Trans. Netw. 1, 3, 372--385.

Digital Library

[26]

Yashkov, S. 1983. A derivation of response time distribution for a M/G/1 processor sharing queue. Problems of Control and Information Theory 12, 133--148.

[27]

Yashkov, S. F. 1987. Processor-sharing queues: Some progress in analysis. Queueing Syst. 2, 1--17.

Digital Library

[28]

Zhang, Z., Kurose, J., and Towsley, D. 1995. Statistical analysis of generalized processor sharing scheduling discipline. IEEE J. Sel. Areas in Comm. 13, 6 (Aug.), 1071--1080.

Digital Library

[29]

Zwart, B. and Boxma, O. 2000. Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Syst. 35, 141--166.

Digital Library

Cited By

Gessert FWingerath WRitter NGessert FWingerath WRitter N(2024)Polyglotte Persistenz im DatenmanagementSchnelles und skalierbares Cloud-Datenmanagement10.1007/978-3-031-54388-3_7(161-188)Online publication date: 3-May-2024
https://doi.org/10.1007/978-3-031-54388-3_7
Khalid SAhmad I(2023)Dual Optimization of Revenue and Expense in Geo-Distributed Data Centers Using Smart GridIEEE Transactions on Cloud Computing10.1109/TCC.2022.315098511:2(1622-1635)Online publication date: 1-Apr-2023
https://doi.org/10.1109/TCC.2022.3150985
Zeng TXu ZWu DLi XLiu BHu HTan STan YXu CStewart CZhou QCao Y(2023)Exploring nonintrusive measurements of spatio‐temporal portrait of microservicesSoftware: Practice and Experience10.1002/spe.3234Online publication date: 27-Jun-2023
https://doi.org/10.1002/spe.3234
Show More Cited By

Index Terms

Provisioning servers in the application tier for e-commerce systems

Recommendations

The internet vs e-commerce servers: when will server performance matter?
CASCON '98: Proceedings of the 1998 conference of the Centre for Advanced Studies on Collaborative research

The cycle time of an Internet based online shopper includes time at an electronic commerce (e-commerce) server to gather information and purchase products, download time to transfer data over the Internet, and think time for interpreting the results of ...
A class-based scheme for E-commerce web servers: Formal specification and performance evaluation

This paper is an investigation into the performance of E-commerce applications. E-commerce has become one of the most popular applications of the web as a large population of web users is now benefiting from various on-line services including product ...
Analysis of Queueing Systems with Synchronous Single Vacation for Some Servers

We study a multi-server M/M/c type queue with a single vacation policy for some idle servers. In this queueing system, if at a service completion instant, any d (d ⩽c) servers become idle, these d servers will take one and only one vacation together. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Internet Technology

ACM Transactions on Internet Technology Volume 7, Issue 1

February 2007

184 pages

ISSN:1533-5399

EISSN:1557-6051

DOI:10.1145/1189740

Issue’s Table of Contents

Copyright © 2007 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 2007

Published in TOIT Volume 7, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

70
Total Citations
View Citations
1,209
Total Downloads

Downloads (Last 12 months)20
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Gessert FWingerath WRitter NGessert FWingerath WRitter N(2024)Polyglotte Persistenz im DatenmanagementSchnelles und skalierbares Cloud-Datenmanagement10.1007/978-3-031-54388-3_7(161-188)Online publication date: 3-May-2024
https://doi.org/10.1007/978-3-031-54388-3_7
Khalid SAhmad I(2023)Dual Optimization of Revenue and Expense in Geo-Distributed Data Centers Using Smart GridIEEE Transactions on Cloud Computing10.1109/TCC.2022.315098511:2(1622-1635)Online publication date: 1-Apr-2023
https://doi.org/10.1109/TCC.2022.3150985
Zeng TXu ZWu DLi XLiu BHu HTan STan YXu CStewart CZhou QCao Y(2023)Exploring nonintrusive measurements of spatio‐temporal portrait of microservicesSoftware: Practice and Experience10.1002/spe.3234Online publication date: 27-Jun-2023
https://doi.org/10.1002/spe.3234
Al-Dulaimy ATaheri JKassler AHoseinyFarahabady MDeng SZomaya A(2022)MultiScaler: A Multi-Loop Auto-Scaling Approach for Cloud-Based ApplicationsIEEE Transactions on Cloud Computing10.1109/TCC.2020.303167610:4(2769-2786)Online publication date: 1-Oct-2022
https://doi.org/10.1109/TCC.2020.3031676
Li XZeng TLiu BHu HXu ZTan STan YXu C(2022)Nonintrusive Measurement on Temporal and Spatial Features of Microservice Inferences2022 IEEE Smartworld, Ubiquitous Intelligence & Computing, Scalable Computing & Communications, Digital Twin, Privacy Computing, Metaverse, Autonomous & Trusted Vehicles (SmartWorld/UIC/ScalCom/DigitalTwin/PriComp/Meta)10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00030(16-24)Online publication date: Dec-2022
https://doi.org/10.1109/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00030
Sacco AFlocco MEsposito FMarchetto G(2021)Supporting Sustainable Virtual Network Mutations With MystiqueIEEE Transactions on Network and Service Management10.1109/TNSM.2021.305964718:3(2714-2727)Online publication date: Sep-2021
https://doi.org/10.1109/TNSM.2021.3059647
Poonkuntran SManessa J(2021)Estimation of Sharing Dependencies in Personal Storage Clouds Using Ensemble Learning ApproachesOperationalizing Multi-Cloud Environments10.1007/978-3-030-74402-1_4(65-85)Online publication date: 18-Sep-2021
https://doi.org/10.1007/978-3-030-74402-1_4
Gessert FWingerath WRitter NGessert FWingerath WRitter N(2020)Polyglot Persistence in Data ManagementFast and Scalable Cloud Data Management10.1007/978-3-030-43506-6_7(149-174)Online publication date: 15-May-2020
https://doi.org/10.1007/978-3-030-43506-6_7
Su YFeng DHua YShi Z(2019)Understanding the latency distribution of cloud object storage systemsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2019.01.008128:C(71-83)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1016/j.jpdc.2019.01.008
Nouri SLi HVenugopal SGuo WHe MTian W(2019)Autonomic decentralized elasticity based on a reinforcement learning controller for cloud applicationsFuture Generation Computer Systems10.1016/j.future.2018.11.04994:C(765-780)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1016/j.future.2018.11.049
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents