Dynamic Budget-Constrained Pricing in the Cloud

We introduce a new model of user-based dynamic pricing in which decisions occur in real time and are strongly influenced by the budget constraints of users. This model captures the fundamental operation of many electronic markets that are used for allocating resources. In particular, we focus on those used in data centers and cloud computing where pricing is often an internal mechanism used to efficiently allocate virtual machines. We study the allocative properties and dynamic stability of this pricing model under a standard framework of cloud computing systems which leads to highly degenerate systems of prices. We show that as the size of the system grows the user-based budget-constrained dynamic pricing mechanism converges to the standard Walrasian prices. However, for finite systems, the prices can be non-degenerate and the allocations unfair, with large groups of users receiving allocations significantly below their fair share. In addition, we show that improper choice of price update parameters can lead to significant instabilities in prices, which could be problematic in real cloud computing systems, by inducing system instabilities and allowing manipulations by users. We construct scaling rules for parameters that reduce these instabilities.

[1]  H. Uzawa Walras' Tâtonnement in the Theory of Exchange , 1960 .

[2]  Randy H. Katz,et al.  Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center , 2011, NSDI.

[3]  David E. Culler,et al.  PlanetLab: an overlay testbed for broad-coverage services , 2003, CCRV.

[4]  David E. Culler,et al.  Hierarchical scheduling for diverse datacenter workloads , 2013, SoCC.

[5]  Richard H. Timberlake Private Production of Scrip-Money in the Isolated Community , 1987 .

[6]  Joan L. Sweeney,et al.  Monetary Theory and the Great Capitol Hill Baby Sitting Co-op Crisis: Comment , 1977 .

[7]  R. Z. Khasminskii,et al.  Singularly Perturbed Switching Diffusions: Rapid Switchings and Fast Diffusions , 1999 .

[8]  E. L. Hahne,et al.  Round robin scheduling for fair flow control in data communication networks , 1986, ICC.

[9]  Scott Shenker,et al.  Choosy: max-min fair sharing for datacenter jobs with constraints , 2013, EuroSys '13.

[10]  Joseph Y. Halpern,et al.  Efficiency and nash equilibria in a scrip system for P2P networks , 2006, EC '06.

[11]  Qing Zhang,et al.  Continuous-Time Markov Chains and Applications: A Two-Time-Scale Approach , 2012 .

[12]  L. Walras Elements of Pure Economics, or The Theory of Social Wealth , 1955 .

[13]  Richard Cole,et al.  Fast-converging tatonnement algorithms for one-time and ongoing market problems , 2008, STOC.

[14]  Scott Shenker,et al.  Disk-Locality in Datacenter Computing Considered Irrelevant , 2011, HotOS.

[15]  Herbert E. Scarf,et al.  A LIMIT THEOREM ON THE CORE OF AN ECONOMY , 1963, Classics in Game Theory.