{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T22:58:24Z","timestamp":1777676304160,"version":"3.51.4"},"reference-count":23,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2006,2]]},"abstract":"<jats:p>Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommodated by flexible leasing arrangements. From the service provider's perspective, the problem is how many resources to lease and for how long. In this paper we formulate and solve the resource leasing problem for the case of a single service. The objective is to minimize the cost of leasing resources while still maintaining an adequate quality of service, which we measure by the average wait time of requests. Demand for the service and execution times of service requests are modeled as random variables. The problem is formulated as a continuous-time, infinite-horizon Markov decision problem. We use the dynamic programming method of value iteration for its solution and we characterize the resulting optimal cost function. We find that the cost of providing a service is convex-like in the number of resources leased and nondecreasing in the number of requests in the system. Close examination of the optimal cost function shows that the cost of providing a service is more sensitive to underdeployment than to overdeployment. Thus, when demand for the service is known to exist, but is unpredictable, it is better to lease more resources than fewer resources.<\/jats:p>","DOI":"10.1177\/1094342006061891","type":"journal-article","created":{"date-parts":[[2006,2,2]],"date-time":"2006-02-02T06:48:09Z","timestamp":1138862889000},"page":"91-101","source":"Crossref","is-referenced-by-count":1,"title":["A Resource Leasing Policy for on-Demand Computing"],"prefix":"10.1177","volume":"20","author":[{"given":"Darin","family":"England","sequence":"first","affiliation":[{"name":"DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIVERSITY OF MINNESOTA,\r                        TWIN CITIES, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Weissman","sequence":"additional","affiliation":[{"name":"DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIVERSITY OF MINNESOTA,\r                        TWIN CITIES, USA ()"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2006,2,1]]},"reference":[{"key":"atypb1","unstructured":"Arnold, D. et al. 2002. Users\u2019 Guide to NetSolve V1.4.1. Innovative\n                Computing Department Technical Report ICL-UT-02-05, University of Tennessee,\n                Knoxville, TN, June."},{"key":"atypb2","volume-title":"Dynamic Programming and Optimal Control","author":"Bertsekas, D. P.","year":"2000","edition":"2"},{"key":"atypb3","volume-title":"Dynamic Programming and Optimal Control","author":"Bertsekas, D. P.","year":"2001","edition":"2"},{"key":"atypb4","volume-title":"Neuro-Dynamic Programming","author":"Bertsekas, D. P.","year":"1996"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1002\/0471200581"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.690"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1109\/GRID.2004.4"},{"key":"atypb8","volume-title":"The Grid: Blueprint for a New Computing Infrastructure","author":"Foster, I.","year":"2004"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1177\/109434200101500302"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2002.1009167"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1145\/268998.266662"},{"key":"atypb12","volume-title":"Fundamentals of Queueing Theory","author":"Gross, D. M.","year":"1985","edition":"2"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1109\/49.824797"},{"key":"atypb14","volume-title":"Adventures in Stochastic Processes","author":"Resnick, S. I.","year":"1992"},{"key":"atypb15","volume-title":"Introduction to Probability Models","author":"Ross, S. M.","year":"1989","edition":"4"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024083511032"},{"key":"atypb17","volume-title":"Proceedings of the 2002 USENIX Annual Technical Conference","author":"von Behren, R.","year":"2002"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1109\/SAINT.2001.905172"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.636"},{"key":"atypb20","volume-title":"Proceedings of the IEEE International Symposium on Cluster Computing and the Grid (CCGrid2005)","author":"Weissman, J. B.","year":"2005"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502057"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2001.924985"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1002\/0470867167.ch32"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342006061891","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342006061891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:18:23Z","timestamp":1777450703000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342006061891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["10.1177\/1094342006061891"],"URL":"https:\/\/doi.org\/10.1177\/1094342006061891","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}