Abstract
We consider a problem of Web service resource allocation in an economic setting. We assume that different requestors have different valuations for services and a deadline for executing a service, after which it is no longer required. We formally show an optimal offline allocation that maximizes the total welfare, denoted as the total benefit of the requestors. We then propose a bid-based approach to resource allocation and pricing for Web services. Using a detailed simulation, we analyze its behavior and performance compared to other known algorithms. We empirically show that flexibility in service price benefits both the provider in terms of profit and the requestors in terms of welfare.
Our problem motivation stems from the expanding use of Service-Oriented Architecture (SOA) for outsourcing enterprize activities. While the most common method for pricing a Web service nowadays is a fixed-price policy (with a price of 0 in many cases), A Service-Oriented Architecture will increasingly generate competition among providers, underlying the importance of finding methodologies for pricing Web service execution.
An erratum to this chapter can be found at http://dx.doi.org/10.1007/11914853_71.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hung, P.C., Li, H.: Web services discovery based on the trade-off between quality and cost of service: A tokenbased approach. ACM SIGecom Exchanges 4 (2003)
Lin, Z., Zhao, H., Ramanathan, S.: Pricing web services for optimizing resource allocation an implementation scheme. In: Web 2003, Seattle, WA (2003)
Bartal, Y., Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Lavi, R., Sgall, J., Tichý, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 187–198. Springer, Heidelberg (2004)
Li, D., Lin, Z., Stahl, D.O., Whinston, A.B.: Bridging agent-based simulations and direct experiments - an experimental system for internet traffic pricing. In: AMCIS 2001, Boston (2001)
Gupta, A., Stahl, D.O., Whinston, A.B.: A stochastic equilibrium model of internet pricing. Journal of Economic Dynamics and Control, 697–722 (1997)
Lin, Z., Ow, P., Stahl, D.O., Whinston, A.B.: Exp loring traffic pricing for the virtual private network. In: WITS (1999)
Stratmann, T.: Logrolling, perspectives on public choice: A handbook. Cambridge University Press, Cambridge (1997)
Mani, A., Nagarajan, A.: Understanding quality of service for web services: Improving the performance of your web services (2002), http://www-106.ibm.com/developerworks/library/ws-quality.html
Fowler, A.: Effective negotiation. Institute of Personnel Management (1986)
Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Improved Online Algorithms for Buffer Management in QoS Switches. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 204–215. Springer, Heidelberg (2004)
Hajek, B.: On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In: Conference in Information Sciences and Systems, pp. 434–438 (2001)
Li, F., Sethuraman, J., Stein, C.: An optimal online algorithm for packet scheduling with agreeable deadlines. In: 16th ACM-SIAM SODA, pp. 460–469 (2005)
Sgall, J.: Online algorithms for scheduling unit jobs. In: 7th MAPSP (2005)
Graham, R.: Bounds for certain multiprocessing anomalies. Bell Sys. Tech. Journal 45, 1563–1581 (1966)
Kessekman, A., Lother, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in qos switches. SIAM J. Comput. 33, 563–583 (2004)
Buyya, R., Abramson, D., Giddy, J., Stockinger, H.: Economic models for resources management and scheduling in grid computation. The Journal on Concurrency and Computation: Practice and Experience 14, 1507–1542 (2002)
Porter, R.: Mechanism design for online real-time scheduling. In: ACM Conference on Electronic Cemmerce (2004)
Lawler, E., Lenstra, J., Kan, A.R., Shmoys, D.: Sequencing and scheduling: Algorithms and complexity, Logistics of Production and Inventory. In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H. (eds.) Logistics of Production and Inventory, vol. 4 (1990)
Edmonds, J.: Paths, trees, flowers. Canadian Journal of Mathematisc, 449–467 (1965)
Güntzer, U., Balke, W.T., Kießling, W.: Optimizing multi-feature queries in image databases. In: Twenty Sixth Very Large Databases (VLDB) Conference, pp. 419–428 (2001)
Yahav, I.: Bid-based online scheduling of unit-length tasks with hard deadlines. Master’s thesis, Thechnion - Israel Institute of Technology (2006)
Liu, C., Wayland, J.W.: Scheduling algorithms for multiprogramming in a hard real time environment. Journal of ACM, 46–61 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yahav, I., Gal, A., Larson, N. (2006). Bid-Based Approach for Pricing Web Service. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE. OTM 2006. Lecture Notes in Computer Science, vol 4275. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11914853_22
Download citation
DOI: https://doi.org/10.1007/11914853_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48287-1
Online ISBN: 978-3-540-48289-5
eBook Packages: Computer ScienceComputer Science (R0)