Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Computationally feasible VCG mechanisms
Proceedings of the 2nd ACM conference on Electronic commerce
End-to-end arguments in system design
ACM Transactions on Computer Systems (TOCS)
A blueprint for introducing disruptive technology into the Internet
ACM SIGCOMM Computer Communication Review
Virtual worlds: fast and strategyproof auctions for dynamic resource allocation
Proceedings of the 4th ACM conference on Electronic commerce
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
An SLA-Oriented Capacity Planning Tool for Streaming Media Services
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Resource overbooking and application profiling in shared hosting platforms
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
An integrated experimental environment for distributed systems and networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
ICE: an iterative combinatorial exchange
Proceedings of the 6th ACM conference on Electronic commerce
Mirage: a microeconomic resource allocation system for sensornet testbeds
EmNets '05 Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors
Approximately-strategyproof and tractable multiunit auctions
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
| Hi-index | 0.00 |
Building reliable network services that can deliver consistent high performance to clients in the presence of failures and bursty demand is expensive and inefficient. Resources often need to be heavily overprovisioned to accommodate peak demand and the cost of such overprovisioning "prices out" many applications that could stand to benefit from a performance safety-net and ultimately provide more reliable service to end users. To address these problems, we propose an approach based on a shared Computational Service Provider (CSP). A CSP is an entity which provides massive amounts of widely distributed computation and storage and makes resources available through a mix of spot and derivative markets. Services obtain resources through the CSP and, drawing inspiration from finance, employ quantitative risk management techniques for trading off cost, performance, and risk to probabilistically achieve target levels of delivered client performance.