{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:25:18Z","timestamp":1737609918662,"version":"3.33.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Ser. F-Inf. Sci."],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1007\/s11432-007-0018-5","type":"journal-article","created":{"date-parts":[[2007,11,17]],"date-time":"2007-11-17T09:41:41Z","timestamp":1195292501000},"page":"811-830","source":"Crossref","is-referenced-by-count":8,"title":["Dynamic replication of web contents"],"prefix":"10.1007","volume":"50","author":[{"given":"Amjad","family":"Mahmood","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/356876.356883","volume":"14","author":"L. Dowdy","year":"1982","unstructured":"Dowdy L, Foster D. Comparative models of the file assignment problem. Comput Surveys, 1982, 14(2): 287\u2013313","journal-title":"Comput Surveys"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Anderson T, Breitbart Y, Korth H F, et al. Replication, consistency and practicality: Are these mutually exclusively. In: Proc ACM SIGMOD International Conference on Management of Data. Seattle, 1998, 484\u2013495","DOI":"10.1145\/276304.276347"},{"issue":"2","key":"18_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/71.89063","volume":"2","author":"D. Agrawal","year":"1991","unstructured":"Agrawal D, Bernstein A J. A nonblocking quorum consensus protocol for replicated data. IEEE Trans Paral Distrib Syst, 1991, 2(2): 171\u2013179","journal-title":"IEEE Trans Paral Distrib Syst"},{"issue":"12","key":"18_CR4","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1016\/j.jpdc.2004.04.005","volume":"64","author":"T. Loukopoulos","year":"2004","unstructured":"Loukopoulos T, Ahmad I. Static and adaptive distributed data replication using genetic algorithms. J Paral Distrib Comput, 2004, 64(12): 1270\u20131285","journal-title":"J Paral Distrib Comput"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Karlsson M, Karamanolis C. Choosing replica placement heuristics for wide-area systems. In: Proc International Conference on Distributed Computing Systems (ICDCS) 2004. Available at http:\/\/www.hpl.hp.com\/personal\/Magnus_Karlsson","DOI":"10.1109\/ICDCS.2004.1281600"},{"issue":"6","key":"18_CR6","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/j.sysarc.2003.12.003","volume":"50","author":"F. Tenzakhti","year":"2004","unstructured":"Tenzakhti F, Day K, Olud-Khaoua M. Replication algorithms for the word-wide web. J Syst Arch, 2004, 50(6): 591\u2013605","journal-title":"J Syst Arch"},{"issue":"3","key":"18_CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/44498.45063","volume":"13","author":"P. G. M. Apers","year":"1998","unstructured":"Apers P G M. Data allocation in distributed database systems. ACM Trans Database Syst, 1998, 13(3): 263\u2013304","journal-title":"ACM Trans Database Syst"},{"issue":"10","key":"18_CR8","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/T-C.1969.222542","volume":"18","author":"W. W. Chu","year":"1969","unstructured":"Chu, W. W. Optimal file allocation in a multiple computer system. IEEE Trans Comput, 1969, 18(10): 885\u2013889","journal-title":"IEEE Trans Comput"},{"issue":"11","key":"18_CR9","first-page":"345","volume":"6","author":"S. Ceri","year":"1982","unstructured":"Ceri S, Martella G, Pelagatti G. Optimal file allocation in a computer network: a solution method based on knapsack problem. Comput Networks, 1982, 6(11): 345\u2013357","journal-title":"Comput Networks"},{"issue":"10","key":"18_CR10","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/322217.322226","volume":"27","author":"M. K. Fisher","year":"1980","unstructured":"Fisher M K, Hochbaum D S. Database location in computer networks. J ACM, 1980, 27(10): 718\u2013735","journal-title":"J ACM"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01001955","volume":"11","author":"S. K. Chang","year":"1982","unstructured":"Chang S K, Liu A C. File allocation in distributed database. Int J Comput Inf Sci, 1982, 11: 325\u2013340","journal-title":"Int J Comput Inf Sci"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Loikopoulos T, Ahmed I. Static and dynamic data replication algorithms for fast information access in large distributed systems. In: Proc 20th IEEE conference on Distributed Computing Systems, Taipei, 2000, 385\u2013392","DOI":"10.1109\/ICDCS.2000.840950"},{"issue":"1","key":"18_CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/75577.75583","volume":"33","author":"B. Gavish","year":"1990","unstructured":"Gavish B, Sheng O R L. Dynamic file migration in distributed computer systems. Comm ACM, 1990, 33(1): 177\u2013189","journal-title":"Comm ACM"},{"key":"18_CR14","unstructured":"Qiu L, Padmanabham V N, Voelker G M. On the placement of web server replicas. In: Proc. 20th IEEE INFOCOM, Anchorage. USA, 2001. 1587\u20131596"},{"key":"18_CR15","unstructured":"Radoslavov P, Govindan R, Estrin D. Topology informed internet replica placement. In: Proc. 6th Int. workshop on Web Caching and Content Distribution, Boston. 2001. Available at http:\/\/www.cs.bu.edu\/techreports\/2001-017-wcw01-proceedings"},{"issue":"2","key":"18_CR16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1006\/jpdc.1999.1572","volume":"59","author":"B. Li","year":"1999","unstructured":"Li B. Content replication in a distributed and controlled environment. J Paral Distrib Comput, 1999, 59(2): 229\u2013251","journal-title":"J Paral Distrib Comput"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Xu Z, Bhuyan L. QoS-aware object replica placement in CDNs. In: IEEE Global Telecommunication Conference (GLOBECOM\u20195), Boston, 2005. 5\u20137","DOI":"10.1109\/GLOCOM.2005.1577761"},{"issue":"2","key":"18_CR18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/249978.249982","volume":"22","author":"O. Wolfson","year":"1997","unstructured":"Wolfson O, Jajodia S, Huang Y. An adaptive data replication algorithm. ACM Trans Database Syst, 1997, 22(2): 255\u2013314","journal-title":"ACM Trans Database Syst"},{"issue":"1","key":"18_CR19","doi-asserted-by":"crossref","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. ACM Trans Database Syst, 1991, 16(1): 181\u2013205","journal-title":"ACM Trans Database Syst"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Bestavros A. Demand-based document dissemination to reduce traffic and balance load in distributed information systems. In: Proc. IEEE Symp. On Parallel and Distributed Processing. 1995. 338\u2013345","DOI":"10.1109\/SPDP.1995.530703"},{"issue":"1","key":"18_CR21","first-page":"164","volume":"281","author":"Y. Bartal","year":"2001","unstructured":"Bartal Y, Charikar M, Indyk P. On page migration and other relaxed task systems. Theory Comput Sci, 2001, 281(1): 164\u2013173","journal-title":"Theory Comput Sci"},{"issue":"6","key":"18_CR22","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1109\/71.932716","volume":"12","author":"K. Kalpakis","year":"2001","unstructured":"Kalpakis K, Dasgupta K, Wolfson O. Optimal placement of replicas in trees with read, write and storage costs. IEEE Trans Paral Dist Syst, 2001, 12(6): 628\u2013637","journal-title":"IEEE Trans Paral Dist Syst"},{"issue":"10","key":"18_CR23","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/S0743-7315(03)00095-9","volume":"63","author":"L. Zhuo","year":"2003","unstructured":"Zhuo L, Wang C-L, Lau F C M. Document replication and distribution in extensible geographically distributed web servers. J Paral Dist Comput, 2003, 63(10): 927\u2013944","journal-title":"J Paral Dist Comput"},{"issue":"7","key":"18_CR24","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1109\/JSAC.2002.802068","volume":"20","author":"J. Xu","year":"2002","unstructured":"Xu J, Li B, Lee D L. Placement problems for transparent data replication proxy services. IEEE J Select Area Commun, 2002, 20(7): 1383\u20131398","journal-title":"IEEE J Select Area Commun"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Hedfdaya A, Mirdad S. Web Wave: globally load balanced fully distributed caching of hot published documents. In: Proc. 17th IEEE Int. Conf. On Distributed Computing Systems. 1997. 160\u2013168","DOI":"10.1109\/ICDCS.1997.597907"},{"issue":"1","key":"18_CR26","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.comnet.2004.02.006","volume":"45","author":"N. Fujita","year":"2004","unstructured":"Fujita N, Ishikawa Y, Iwata A, et al. Coarse-grain replica management strategies for dynamic replication of web contents. Comput Networks, 2004, 45(1): 19\u201334","journal-title":"Comput Networks"},{"issue":"4","key":"18_CR27","first-page":"371","volume":"24","author":"A. Mahmood","year":"2005","unstructured":"Mahmood A. Object replication algorithms for world wide web. Comput Inf, 2005, 24(4): 371\u2013390","journal-title":"Comput Inf"},{"issue":"3","key":"18_CR28","first-page":"347","volume":"29","author":"A. Mahmood","year":"2005","unstructured":"Mahmood A. Object grouping and replication algorithms for world wide web. Informatica, 2005, 29(3): 347\u2013356","journal-title":"Informatica"},{"issue":"8","key":"18_CR29","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/TPDS.2005.94","volume":"16","author":"X. Jia","year":"2005","unstructured":"Jia X, Li D, Du H, Cao J. On optimal replication of data object at hierarchical and transparent web proxies. IEEE Trans Paral Distr Syst, 2005, 16(8): 673\u2013685","journal-title":"IEEE Trans Paral Distr Syst"},{"issue":"5","key":"18_CR30","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TPDS.2004.1278100","volume":"15","author":"X. Tang","year":"2004","unstructured":"Tang X, Chanson S T. Minimal cost replication of dynamic web contents under flat update delivery. IEEE Trans Paral Distr Syst, 2004, 15(5): 431\u2013439","journal-title":"IEEE Trans Paral Distr Syst"},{"issue":"6","key":"18_CR31","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/71.689446","volume":"9","author":"M. Colajanni","year":"1998","unstructured":"Colajanni M, Yu P S. Analysis of task assignment policies in scalable distributed web server systems. IEEE Trans Paral Distr Syst, 1998, 9(6): 585\u2013600","journal-title":"IEEE Trans Paral Distr Syst"},{"issue":"11","key":"18_CR32","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1145\/359863.359895","volume":"20","author":"E. Grapa","year":"1997","unstructured":"Grapa E, Belford G G. Some theorems to aid solving the file allocation problem. Commun ACM, 1997, 20(11): 878\u2013882","journal-title":"Commun ACM"},{"issue":"1","key":"18_CR33","first-page":"15","volume":"2","author":"P. Braford","year":"1999","unstructured":"Braford P, Bestarov A, Bradley A, et al. Changes in web client access patterns: characteristics and caching implications. WWW J, 1999, 2(1): 15\u201328","journal-title":"WWW J"},{"key":"18_CR34","volume-title":"Data Management on Distributed Databases","author":"B. W. Wah","year":"1981","unstructured":"Wah B W. Data Management on Distributed Databases. Michigan: UMI Research Press, 1981"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Mahmood A. Adaptive data allocation in distributed systems: a cybernetics approach. PhD Thesis, University of London, 1994","DOI":"10.1088\/0967-1846\/1\/6\/004"},{"key":"18_CR36","unstructured":"Calvert K, Zegura E. GT-Internetwork topology models (GT-ITM). http:\/\/www.cc.gatech.edu\/fac\/ellen.zegura\/gt-itm ."},{"key":"18_CR37","doi-asserted-by":"crossref","unstructured":"Zegura E, Calvert K, Bhattacharjee S. How to model an internetwork. In: Proc INFOCOM\u201996, 1996","DOI":"10.1109\/INFCOM.1996.493353"},{"key":"18_CR38","volume-title":"Human Behavior and the Principle of Least-effort","author":"G. K. Zipf","year":"1949","unstructured":"Zipf G K. Human Behavior and the Principle of Least-effort. Cambridge: Addison-Wesley, 1949"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-007-0018-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-007-0018-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-007-0018-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T14:20:37Z","timestamp":1737555637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-007-0018-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":38,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["18"],"URL":"https:\/\/doi.org\/10.1007\/s11432-007-0018-5","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"type":"print","value":"1009-2757"},{"type":"electronic","value":"1862-2836"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}