{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T15:03:09Z","timestamp":1750950189555,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,23]],"date-time":"2006-05-23T00:00:00Z","timestamp":1148342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,5,23]]},"DOI":"10.1145\/1135777.1135865","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"595-604","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":123,"title":["Dynamic placement for clustered web applications"],"prefix":"10.1145","author":[{"given":"A.","family":"Karve","sequence":"first","affiliation":[{"name":"IBM T.J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Kimbrel","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Pacifici","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Spreitzer","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Steinder","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sviridenko","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Tantawi","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,5,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060312"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/502152.502155"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/339331.339383"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1035167.1035193"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_34"},{"key":"e_1_3_2_1_7_1","unstructured":"\"WebSphere eXtended Deployment (XD) \" http:\/\/www-306.ibm.com\/software\/webservers\/appserv\/extend\/.  \"WebSphere eXtended Deployment (XD) \" http:\/\/www-306.ibm.com\/software\/webservers\/appserv\/extend\/."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945462"},{"key":"e_1_3_2_1_9_1","unstructured":"\"VMware \" http:\/\/www.vmware.com\/.  \"VMware \" http:\/\/www.vmware.com\/."},{"key":"e_1_3_2_1_10_1","first-page":"247","volume-title":"USA","author":"Levy R.","year":"2003","unstructured":"R. Levy , J. Nagarajarao , G. Pacifici , M. Spreitzer , A. N. Tantawi , and A. Youssef , \" Performance management for cluster based web services,\" in Proc. Int'l Symposium on Integrated Network Management, Colorado Springs , USA , March 2003 , pp. 247 -- 261 . R. Levy, J. Nagarajarao, G. Pacifici, M. Spreitzer, A. N. Tantawi, and A. Youssef, \"Performance management for cluster based web services,\" in Proc. Int'l Symposium on Integrated Network Management, Colorado Springs, USA, March 2003, pp. 247--261."},{"key":"e_1_3_2_1_11_1","first-page":"65","volume-title":"Fun with Algorithms","author":"Shachnai H.","year":"1998","unstructured":"H. Shachnai and T. Tamir , \" Noah's bagels -- some combinatorial aspects,\" in Proc. Int'l Conf . Fun with Algorithms , 1998 , pp. 65 -- 78 . H. Shachnai and T. Tamir, \"Noah's bagels -- some combinatorial aspects,\" in Proc. Int'l Conf. Fun with Algorithms, 1998, pp. 65--78."},{"key":"e_1_3_2_1_12_1","volume-title":"Linear Programming and Extensions","author":"Dantzig G.","year":"1998","unstructured":"G. Dantzig , Linear Programming and Extensions . Princeton University Press , 1998 . G. Dantzig, Linear Programming and Extensions. Princeton University Press, 1998."},{"key":"e_1_3_2_1_13_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993","unstructured":"R. K. Ahuja , T. L. Magnanti , and J. B. Orlin , Network Flows: Theory, Algorithms, and Applications . Prentice-Hall , 1993 . R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, 1993."},{"key":"e_1_3_2_1_14_1","volume-title":"Eds. Libreria Eredi Virgilio Veschi","author":"Gini C.","year":"1955","unstructured":"C. Gini , \"Variabilit\u00e0 e mutabilit\u00e0,\" in Memorie di metodologica statistica, E. Pizetti and T. Salvemini , Eds. Libreria Eredi Virgilio Veschi , 1955 . C. Gini, \"Variabilit\u00e0 e mutabilit\u00e0,\" in Memorie di metodologica statistica, E. Pizetti and T. Salvemini, Eds. Libreria Eredi Virgilio Veschi, 1955."},{"key":"e_1_3_2_1_15_1","first-page":"14","volume-title":"WA","author":"Appleby K.","year":"2001","unstructured":"K. Appleby , S. Fakhouri , L. Fong , G. Goldszmidt , M. Kalantar , S. Krishnakumar , D. Pazel , J. Pershing , and B. Rochwerger , \" Oceano SLA based management of a computing utility,\" in Proc. Int'l Symposium on Integrated Network Management, Seattle , WA , May 2001 , pp. 14 -- 18 . K. Appleby, S. Fakhouri, L. Fong, G. Goldszmidt, M. Kalantar, S. Krishnakumar, D. Pazel, J. Pershing, and B. Rochwerger, \"Oceano SLA based management of a computing utility,\" in Proc. Int'l Symposium on Integrated Network Management, Seattle, WA, May 2001, pp. 14--18."},{"key":"e_1_3_2_1_16_1","volume-title":"CA","author":"Chandra A.","year":"2003","unstructured":"A. Chandra , P. Goyal , and P. Shenoy , \" Quantifying the benefits of resource multiplexing in on-demand data centers,\" in First ACM Workshop on Algorithms and Architectures for Self-Managing Systems, San Diego , CA , Jun. 2003 . A. Chandra, P. Goyal, and P. Shenoy, \"Quantifying the benefits of resource multiplexing in on-demand data centers,\" in First ACM Workshop on Algorithms and Architectures for Self-Managing Systems, San Diego, CA, Jun. 2003."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s005300050067"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/76.660824"},{"key":"e_1_3_2_1_19_1","first-page":"229","volume-title":"PA","author":"Turgeon A.","year":"2000","unstructured":"A. Turgeon , Q. Snell , and M. Clement , \" Application placement using performance surfaces,\" in Proc. Ninth Int'l Symposium on High-Performance Distributed Computing, Pittsburgh , PA , August 2000 , pp. 229 -- 236 . A. Turgeon, Q. Snell, and M. Clement, \"Application placement using performance surfaces,\" in Proc. Ninth Int'l Symposium on High-Performance Distributed Computing, Pittsburgh, PA, August 2000, pp. 229--236."},{"key":"e_1_3_2_1_20_1","volume-title":"Object replication strategies in content distribution networks,\" in Proc. Sixth Int'l Workshop on Web Content Caching and Distribution","author":"Kangasharju J.","year":"2001","unstructured":"J. Kangasharju , J. Roberts , and K. W. Ross , \" Object replication strategies in content distribution networks,\" in Proc. Sixth Int'l Workshop on Web Content Caching and Distribution , Boston, MA , 2001 . J. Kangasharju, J. Roberts, and K. W. Ross, \"Object replication strategies in content distribution networks,\" in Proc. Sixth Int'l Workshop on Web Content Caching and Distribution, Boston, MA, 2001."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/967900.968238"},{"key":"e_1_3_2_1_22_1","volume-title":"On two class-constrained versions of the multiple knapsack problem,\" Algorithmica","author":"Shachnai H.","year":"2001","unstructured":"H. Shachnai and T. Tamir , \" On two class-constrained versions of the multiple knapsack problem,\" Algorithmica , vol. 29 , 2001 . H. Shachnai and T. Tamir, \"On two class-constrained versions of the multiple knapsack problem,\" Algorithmica, vol. 29, 2001."},{"key":"e_1_3_2_1_23_1","unstructured":"H. Shachnai and T. Tamir   ------ \"Noah bagels - some combinatorial aspects \" in Int'l Conference on FUN with Algorithms Isola d'Elba June 1998."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"}],"event":{"name":"WWW06: The 15th International World Wide Web Conference 2006","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","ACM Association for Computing Machinery"],"location":"Edinburgh Scotland","acronym":"WWW06"},"container-title":["Proceedings of the 15th international conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1135777.1135865","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1135777.1135865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:33Z","timestamp":1750259193000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1135777.1135865"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,23]]},"references-count":23,"alternative-id":["10.1145\/1135777.1135865","10.1145\/1135777"],"URL":"https:\/\/doi.org\/10.1145\/1135777.1135865","relation":{},"subject":[],"published":{"date-parts":[[2006,5,23]]},"assertion":[{"value":"2006-05-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}