Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Optimizing Multi-Feature Queries for Image Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing
Mechanism design for online real-time scheduling
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
An optimal online algorithm for packet scheduling with agreeable deadlines
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Bid based scheduler with backfilling for a multiprocessor system
Proceedings of the ninth international conference on Electronic commerce
E-contracting with price configuration for Web services and QoS
International Journal of Web and Grid Services
Hi-index | 0.00 |
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.