Article

On admission control for profit maximization of networked service providers

Authors:

Sugata GhosalAuthors Info & Claims

WWW '03: Proceedings of the 12th international conference on World Wide Web

Pages 128 - 137

https://doi.org/10.1145/775152.775171

Published: 20 May 2003 Publication History

Abstract

Variability and diverseness among incoming requests to a service hosted on a finite capacity resource necessitates sophisticated request admission control techniques for providing guaranteed quality of service (QoS). We propose in this paper a service time based online admission control methodology for maximizing profits of a service provider. The proposed methodology chooses a subset of incoming requests such that the revenue of the provider is maximized. Admission control decision in our proposed system is based upon an estimate of the service time of the request, QoS bounds, prediction of arrivals and service times of requests to come in the short-term future, and rewards associated with servicing a request within its QoS bounds. Effectiveness of the proposed admission control methodology is demonstrated using experiments with a content-based messaging middleware service.

References

[1]

A.K. Iyengar, M.S. Squillante, and L. Zhang. Analysis and characterization of large-scale Web Server Access Patterns and Performance. In Proc. Conf. on World Wide Web, 1999.

Digital Library

[2]

X. Chen, P. Mohapatra, and H. Chen. An Admission Control Scheme for Predictable Server Response Time for Web Accesses. In Proc. Conf. on World Wide Web, 2001.

Digital Library

[3]

I.-R. Chen, and S.T. Li. A Cost-Based Admission Control Algorithm for Handling Mixed Workloads in Multimedia Server Systems. In Proc. IEEE Conf. on Parallel and Distributed Systems, Kyongju City, Korea, 2001.

Digital Library

[4]

Z. Liu, M.S. Squillante, and J.L. Wolf. On Maximizing Service-Level Agreement Profits. In Proc. ACM Conf. on Electronic Commerce, Orlando, FL, 2001.

Digital Library

[5]

T.S. Jayram, T. Kimbrel, R. Krauthgamer, B. Schieber, and M. Sviridenko. Online Server Allocation in a Server Farm via Benefit Task Systems. In Proc. ACM Symp. on Theory of Computing, pp. 540--549, 2001.

Digital Library

[6]

J.A. Garay, I.S. Gopal, S. Kutten, Y. Mansour, and M. Yung. Efficient online call control algorithms. In Proc. Israeli Conf. on Theory of Computing and Systems, pp. 285--293, 1993.

[7]

R.J. Lipton, and A. Tomkins. On-Line interval scheduling. In Proc. ACM-SIAM Symp. on Discrete Algorithms, 1994.

Digital Library

[8]

A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, and B. Schieber. Bandwidth allocation with preemption. In SIAM J. on Computing, vol. 28, pp. 1806--1828, 1999.

Digital Library

[9]

A. Bar-Noy, Y. Mansour, and B. Schieber. Competitive dynamic bandwidth allocation. Proc. ACM Symp. on Principles of Distributed Computing, 1998.

Digital Library

[10]

Y.-C. Chang, X. Guo, T. kimbrel, and A. King. Optimal allocation policies for web hosting. In Proc. Informs Conf. on Applied Probability, New York, NY, 2001.

[11]

S. Irani. Page replacement with multi-size pages and applications to web-caching. In Proc. ACM Symp. on Theory of Computing, El Paso, Texas, 1997.

Digital Library

[12]

N. Joshi, S.R. Kadaba, S. Patel, and G.S. Sundaram. Downlink scheduling in CDMA data networks. In Proc. Conf. on Mobile Computing and Networking, pp. 179--190, 2000.

Digital Library

[13]

M.S. Squillante, D.D. Yao, and L. Zhang. Web traffic Modeling and web server performance analysis. In Proc. IEEE Conf. on Decision and Control, pp. 4432--4437, 1999.

Digital Library

[14]

A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. (S.) Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. In Proc. ACM Symp. on Theory of Computing, pp. 735--744, Portland, OR, 2000.

Digital Library

[15]

Siberschatz and Galvin. Operating System Concepts. Addison-Wesley, Fifth Edn., pp. 130--133, 1999.

Digital Library

[16]

R. Morris, and D. Lin. Variance of aggregated web traffic. In Proc. IEEE INFOCOM, 2000.

[17]

M.K. Aguilera, R.E. Strom, D.C. Sturman, M. Astley, and T.D. Chandra, Matching events in a content-based subscription system. In Proc. Principles of Distributed Computing, 1999.

Digital Library

[18]

P.A. Samuelson and W.D. Nordhaus. Economics. Tata McGraw-Hill, pp. 80--83, 1998.

[19]

M.F. Arlitt and C.L. Williamson. Internet web servers: Workload characterization and performance implications. In IEEE/ACM Transactions on Networking, 5(5):631--645, 1997.

Digital Library

[20]

M.E. Crovella, M.S. Taqqu and Azer Bestavros. Heavy-tailed probability distributions in the World Wide Web. In A Practical Guide To Heavy Tails, pp. 3--26. Chapman & Hall, 1998.

Digital Library

[21]

Clarknet HTTP Trace. Available at ftp://ita.ee.ibl.gov/traces/clarknet_access_log_Sep4.gz, Oct 15, 2002.

Cited By

Nafea IYounas MHolton RAwan I(2014)A Priority-Based Admission Control Scheme for Commercial Web ServersInternational Journal of Parallel Programming10.1007/s10766-013-0290-542:5(776-797)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1007/s10766-013-0290-5
Patel KAnnavaram MPedram M(2013)NFRAIEEE Transactions on Computers10.1109/TC.2012.25362:9(1772-1785)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1109/TC.2012.253
Wang XWang ZXu X(2012)Analytic Profit Optimization of Service-Based SystemsProceedings of the 2012 IEEE 19th International Conference on Web Services10.1109/ICWS.2012.114(359-367)Online publication date: 24-Jun-2012
https://dl.acm.org/doi/10.1109/ICWS.2012.114
Show More Cited By

Index Terms

On admission control for profit maximization of networked service providers

Recommendations

Measurement-based admission control at edge routers

It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality of service (QoS). In this paper, we develop a scalable architecture and an algorithm for admission ...
Wireless Fair Intelligent Admission Control -- WFIAC
AINA '13: Proceedings of the 2013 IEEE 27th International Conference on Advanced Information Networking and Applications

In next generation wireless networks like WiMAX, a dynamic Call Admission Control (CAC) plays an important role to ensure Quality of Service (QoS) of existing users and to efficiently utilize network resources. We propose a predictive CAC namely Wireless ...
Comparison of Measurement-based Admission Control Algorithms for Controlled-Load Service
INFOCOM '97: Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution

We compare the performance of four admission control algorithms-- one parameter-based and three measurement-based--for controlled-load service. The parameter-based admission control ensures that the sum of reserved resources is bounded by capacity. The ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

WWW '03: Proceedings of the 12th international conference on World Wide Web

May 2003

772 pages

ISBN:1581136803

DOI:10.1145/775152

Conference Chairs:
Gusztáv Hencsey
MTA SZTAKI, Hungary
,
Bebo White
Stanford Linear Accelerator Center, USA
,
Program Chairs:
Yih-Farn Robin Chen
AT&T Labs -- Research, USA
,
László Kovács
MTA SZTAKI, Hungary
,
Steve Lawrence
Google Inc., USA

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

ACM: Association for Computing Machinery

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 May 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
601
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Nafea IYounas MHolton RAwan I(2014)A Priority-Based Admission Control Scheme for Commercial Web ServersInternational Journal of Parallel Programming10.1007/s10766-013-0290-542:5(776-797)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1007/s10766-013-0290-5
Patel KAnnavaram MPedram M(2013)NFRAIEEE Transactions on Computers10.1109/TC.2012.25362:9(1772-1785)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1109/TC.2012.253
Wang XWang ZXu X(2012)Analytic Profit Optimization of Service-Based SystemsProceedings of the 2012 IEEE 19th International Conference on Web Services10.1109/ICWS.2012.114(359-367)Online publication date: 24-Jun-2012
https://dl.acm.org/doi/10.1109/ICWS.2012.114
Qiu XHedwig MNeumann D(2012)SLA Based Dynamic Provisioning of Cloud Resource in OLTP SystemsE-Life: Web-Enabled Convergence of Commerce, Work, and Social Life10.1007/978-3-642-29873-8_28(302-310)Online publication date: 2012
https://doi.org/10.1007/978-3-642-29873-8_28
Wang XWang ZXu X(2011)Price Heuristics for Highly Efficient Profit Optimization of Service CompositionProceedings of the 2011 IEEE International Conference on Services Computing10.1109/SCC.2011.11(378-385)Online publication date: 4-Jul-2011
https://dl.acm.org/doi/10.1109/SCC.2011.11
Totok AKaramcheti V(2010)RDRPElectronic Commerce Research and Applications10.1016/j.elerap.2010.03.0019:6(549-561)Online publication date: 1-Nov-2010
https://dl.acm.org/doi/10.1016/j.elerap.2010.03.001
Urgaonkar BShenoy PRoscoe T(2009)Resource overbooking and application profiling in a shared Internet hosting platformACM Transactions on Internet Technology10.1145/1462159.14621609:1(1-45)Online publication date: 23-Feb-2009
https://dl.acm.org/doi/10.1145/1462159.1462160
Yuting Luo Deters R(2009)Using cooperation to improve the resource utilization in service ecologies2009 3rd IEEE International Conference on Digital Ecosystems and Technologies10.1109/DEST.2009.5276778(413-418)Online publication date: Jun-2009
https://doi.org/10.1109/DEST.2009.5276778
Luo YDeters R(2009)Using cooperation to improve the experience of mobile Web Services consumers2009 IEEE Asia-Pacific Services Computing Conference (APSCC)10.1109/APSCC.2009.5394122(213-218)Online publication date: Dec-2009
https://doi.org/10.1109/APSCC.2009.5394122
Bartolini NBongiovanni GSilvestri S(2009)Self-* through self-learningComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2008.11.01553:5(727-743)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1016/j.comnet.2008.11.015
Show More Cited By

View Options

Get Access

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 Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents