{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T05:39:43Z","timestamp":1725946783519},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319748740"},{"type":"electronic","value":"9783319748757"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-74875-7_5","type":"book-chapter","created":{"date-parts":[[2018,1,27]],"date-time":"2018-01-27T06:42:30Z","timestamp":1517035350000},"page":"59-88","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Risk Aware Stochastic Placement of Cloud Services: The Case of Two Data Centers"],"prefix":"10.1007","author":[{"given":"Galia","family":"Shabtai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Raz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Shavitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,28]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/S0097539797329142","volume":"30","author":"J Kleinberg","year":"2000","unstructured":"Kleinberg, J., Rabani, Y., Tardos, \u00c9.: Allocating bandwidth for bursty connections. SIAM J. Comput. 30(1), 191\u2013217 (2000)","journal-title":"SIAM J. Comput."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Goel, A., Indyk, P.: Stochastic load balancing and related problems. In: IEEE FOCS 1999, pp. 579\u2013586 (1999)","DOI":"10.1109\/SFFCS.1999.814632"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Wang, M., Meng, X., Zhang, L.: Consolidating virtual machines with dynamic bandwidth demand in data centers. In: IEEE INFOCOM 2011, pp. 71\u201375 (2011)","DOI":"10.1109\/INFCOM.2011.5935254"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Breitgand, D., Epstein, A.: Improving consolidation of virtual machines with risk-aware bandwidth oversubscription in compute clouds. In: IEEE INFOCOM 2012, pp. 2861\u20132865 (2012)","DOI":"10.1109\/INFCOM.2012.6195716"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/11841036_50","volume-title":"Algorithms \u2013 ESA 2006","author":"E Nikolova","year":"2006","unstructured":"Nikolova, E., Kelner, J.A., Brand, M., Mitzenmacher, M.: Stochastic shortest paths via Quasi-convex maximization. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 552\u2013563. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841036_50"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Nikolova, E.: Approximation algorithms for offline risk-averse combinatorial optimization. Approximation, Randomization, and Combinatorial Optimization, pp. 338\u2013351. Algorithms and Techniques (2010)","DOI":"10.1007\/978-3-642-15369-3_26"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Shabtai, G., Raz, D., Shavitt, Y.: Risk aware stochastic placement of cloud services: the multiple data center case. In: ALGOCLOUD 2017 (2017)","DOI":"10.1007\/978-3-319-74875-7_9"},{"issue":"2","key":"5_CR8","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1080\/03461238.1956.10414946","volume":"1956","author":"CG Esseen","year":"1956","unstructured":"Esseen, C.G.: A moment inequality with an application to the central limit theorem. Scand. Actuarial J. 1956(2), 160\u2013170 (1956)","journal-title":"Scand. Actuarial J."},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1134\/S1064562410060062","volume":"82","author":"I Shevtsova","year":"2010","unstructured":"Shevtsova, I.: An improvement of convergence rate estimates in the Lyapunov theorem. Dokl. Math. 82, 862\u2013864 (2010)","journal-title":"Dokl. Math."},{"key":"5_CR10","volume-title":"Independent and Stationary Sequences of Random Variables","author":"IA Ibragimov","year":"1971","unstructured":"Ibragimov, I.A., Linnik, Y.V.: Independent and Stationary Sequences of Random Variables. Wolters-Noordhoff, Groningen (1971)"},{"key":"5_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139814782","volume-title":"Analysis of Boolean Functions","author":"R O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Cambridge University Press, Cambridge (2014)"},{"key":"5_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"RG Michael","year":"1979","unstructured":"Michael, R.G., David, S.J.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74875-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T21:43:52Z","timestamp":1570657432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-74875-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319748740","9783319748757"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74875-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}