Bid-based approach for pricing Web service

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4275 LNCS - I, Issue , 2006, Pages 360-376

  Yahav, Inbal ^a   Gal, Avigdor ^a   Larson, Nathan ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; OUTSOURCING; PROBLEM SOLVING; RESOURCE ALLOCATION; WORLD WIDE WEB;

ENTERPRIZE ACTIVITIES; SERVICE-ORIENTED ARCHITECTURE (SOA); WEB SERVICES;

INFORMATION SERVICES;

EID: 33845418933     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11914853_22     Document Type: Conference Paper

References (22)

1. 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)
2. Lin, Z., Zhao, H., Ramanathan, S.: Pricing web services for optimizing resource allocation an implementation scheme. Web2003, Seattle, WA (2003)
3. Bartall, Y., Chin, F.Y., Chrobak, M., Fung, S.P., Jawor, W., Lavil, R., Sgall, J., Tichy, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. In: 21st STACS, LNCS 2996, Springer (2004) 187-198
4. Li, D., Lin, Z., Stahl, D.O., Whinston, A.B.: Bridging agent-based simulations and direct experiments - an experimental system for internet traffic pricing. AMCIS'01, Boston (2001)
5. Gupta, A., Stahl, D.O., Whinston, A.B.: A stochastic equilibrium model of internet pricing. Journal of Economic Dynamics and Control (1997) 697-722
6. Lin, Z., Ow, P., Stahl, D.O., Whinston, A.B.: Exp loring traffic pricing for the virtual private network. In: WITS. (1999)
7. Stratmann, T.: Logrolling, perspectives on public choice: A handbook. Cambridge University Press, Cambridge, United Kingdom (1997)
8. Mani, A., Nagarajan, A.: Understanding quality of service for web services: Improving the performance of your web services, http://www-106.ibm. com/developerworks/library/ws-quality.html (2002)
9. Fowler, A.: Effective negotiation. Institute of Personnel Management (1986)
10. Chrobak, M., Jawor, W., Sgall, J., Tichy, T.: Improved online algorithm for buffer management in qos switches. ESA (2004)
11. Hajek, B.: On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time, conference in Information Sciences and Systems (2001) 434-438
12. Li, F., Sethuraman, J., Stein, C.: An optimal online algorithm for packet scheduling with agreeable deadlines. In: 16th ACM-SIAM SODA. (2005) 460-469
13. Sgall, J.: Online algorithms for scheduling unit jobs. In: 7th MAPSP. (2005)
14. Graham, R.: Bounds for certain multiprocessing anomalies. Bell Sys. Tech. Journal 45 (1966) 1563-1581
15. Kessekman, A., Lother, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in qos switches. SIAM J. Comput 33 (2004) 563-583
16. Buyyal, 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 (2002) 1507-1542
17. Porter, R.: Mechanism design for online real-time scheduling. In: ACM Conference on Electronic Cemmerce. (2004)
18. Lawler, E., Lenstra, J., Kan, A.R., Shmoys, D.: Sequencing and scheduling: Algorithms and complexity, Logistics of Production and Inventory. Volume 4: Logistics of Production and Inventory. S.C. Graves, A.H.G. Rinnooy Kan and P.H. Zipkin, eds (1990)
19. Edmonds, J.: Paths, trees, flowers. Canadian Journal of Mathematisc (1965) 449-467
20. Güntzer, U., Balke, W.T., Kießling, W.: Optimizing multi-feature queries in image databases. In: Twenty Sixth Very Large Databases (VLDB) Conference. (2001) 419-428
21. Yahav, I.: Bid-based online scheduling of unit-length tasks with hard deadlines. Master's thesis, Thechnion - Israel Institute of Technology (2006)
22. Liu, C., Wayland, J.W.: Scheduling algorithms for multiprogramming in a hard real time environment. Journal of ACM (1973) 4661