{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:57:56Z","timestamp":1743119876524,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038686"},{"type":"electronic","value":"9783642038693"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","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":[[2009]]},"DOI":"10.1007\/978-3-642-03869-3_26","type":"book-chapter","created":{"date-parts":[[2009,8,22]],"date-time":"2009-08-22T04:04:48Z","timestamp":1250913888000},"page":"253-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Comparison of Access Policies for Replica Placement in Tree Networks"],"prefix":"10.1007","author":[{"given":"Anne","family":"Benoit","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"26_CR1","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/71.932716","volume":"12","author":"K. Kalpakis","year":"1985","unstructured":"Kalpakis, K., Dasgupta, K., Wolfson, O.: Optimal placement of replicas in trees with read, write, and storage costs. IEEE Trans. Parallel and Distributed Systems\u00a012(6), 628\u2013637 (1985)","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S1389-1286(02)00251-7","volume":"40","author":"I. Cidon","year":"2002","unstructured":"Cidon, I., Kutten, S., Soffer, R.: Optimal allocation of electronic content. Computer Networks\u00a040, 205\u2013218 (2002)","journal-title":"Computer Networks"},{"key":"26_CR3","volume-title":"International Conference on Parallel and Distributed Systems (ICPADS)","author":"P. Liu","year":"2006","unstructured":"Liu, P., Lin, Y.F., Wu, J.J.: Optimal placement of replicas in data grid environments with locality assurance. In: International Conference on Parallel and Distributed Systems (ICPADS). IEEE Computer Society Press, Los Alamitos (2006)"},{"issue":"12","key":"26_CR4","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.1016\/j.jpdc.2008.08.002","volume":"68","author":"J.J. Wu","year":"2008","unstructured":"Wu, J.J., Lin, Y.F., Liu, P.: Optimal replica placement in hierarchical data grids with locality assurance. Journal of Parallel and Distributed Computing\u00a068(12), 1517\u20131538 (2008)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"12","key":"26_CR5","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.1109\/TPDS.2008.25","volume":"19","author":"A. Benoit","year":"2008","unstructured":"Benoit, A., Rehn-Sonigo, V., Robert, Y.: Replica Placement and Access Policies in Tree Networks. IEEE Transactions on Parallel and Distributed Systems\u00a019(12), 1614\u20131627 (2008)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/103140.103146","volume":"16","author":"O. Wolfson","year":"1991","unstructured":"Wolfson, O., Milo, A.: The multicast policy and its relationship to replicated data placement. ACM Trans. Database Syst.\u00a016(1), 181\u2013205 (1991)","journal-title":"ACM Trans. Database Syst."},{"key":"26_CR7","unstructured":"Karlsson, M., Karamanolis, C., Mahalingam, M.: A framework for evaluating replica placement algorithms. Research Report HPL-2002-219, HP Laboratories, Palo Alto, CA (2002)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1109\/ICDCS.2004.1281600","volume-title":"ICDCS 2004: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004)","author":"M. Karlsson","year":"2004","unstructured":"Karlsson, M., Karamanolis, C.: Choosing Replica Placement Heuristics for Wide-Area Systems. In: ICDCS 2004: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), Washington, DC, USA, pp. 350\u2013359. IEEE Computer Society, Los Alamitos (2004)"},{"issue":"10","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1109\/TPDS.2006.145","volume":"17","author":"G. Rodolakis","year":"2006","unstructured":"Rodolakis, G., Siachalou, S., Georgiadis, L.: Replicated server placement with QoS constraints. IEEE Trans. Par. Distr. Systems\u00a017(10), 1151\u20131162 (2006)","journal-title":"IEEE Trans. Par. Distr. Systems"},{"key":"26_CR10","volume-title":"CoreGRID 2007, Core GRID Symposium 2007","author":"V. Rehn-Sonigo","year":"2007","unstructured":"Rehn-Sonigo, V.: Optimal Closest Policy with QoS and Bandwidth Constraints for Placing Replicas in Tree Networks. In: CoreGRID 2007, Core GRID Symposium 2007. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2009 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03869-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T13:38:01Z","timestamp":1589895481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03869-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038686","9783642038693"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03869-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}