{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T16:57:13Z","timestamp":1717606633787},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Sci Res Dev"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s00450-011-0150-8","type":"journal-article","created":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T01:02:08Z","timestamp":1302570128000},"page":"169-179","source":"Crossref","is-referenced-by-count":8,"title":["Migrating and replicating data in networks"],"prefix":"10.1007","volume":"27","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,12]]},"reference":[{"issue":"1\u20132","key":"150_CR1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0304-3975(98)00116-9","volume":"234","author":"D Achlioptas","year":"2000","unstructured":"Achlioptas D, Chrobak M, Noga J (2000) Competitive analysis of randomized paging algorithms. Theor Comput Sci 234(1\u20132):203\u2013218","journal-title":"Theor Comput Sci"},{"key":"150_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-60220-8_58","volume-title":"Proc of the 4th int workshop on algorithms and data structures (WADS)","author":"S Albers","year":"1995","unstructured":"Albers S, Koga H (1995) Page migration with limited local memory capacity. In: Proc of the 4th int workshop on algorithms and data structures (WADS), pp 147\u2013158"},{"issue":"1","key":"150_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1006\/jagm.1997.0906","volume":"27","author":"S Albers","year":"1998","unstructured":"Albers S, Koga H (1998) New on-line algorithms for the page replication problem. J Algorithms 27(1):75\u201396. Also appeared in Proc of the 4th SWAT, pp 25\u201336 (1994)","journal-title":"J Algorithms"},{"key":"150_CR4","first-page":"337","volume-title":"Proc of the 8th ACM symp on computational geometry (SoCG)","author":"N Alon","year":"1992","unstructured":"Alon N, Azar Y (1992) On-line Steiner trees in the Euclidean plane. In: Proc of the 8th ACM symp on computational geometry (SoCG), pp 337\u2013343"},{"key":"150_CR5","first-page":"164","volume-title":"Proc of the 25th ACM symp on theory of computing (STOC)","author":"B Awerbuch","year":"1993","unstructured":"Awerbuch B, Bartal Y, Fiat A (1993) Competitive distributed file allocation. In: Proc of the 25th ACM symp on theory of computing (STOC), pp 164\u2013173"},{"key":"150_CR6","first-page":"22","volume-title":"Proc of the 34th IEEE symp on foundations of computer science (FOCS)","author":"B Awerbuch","year":"1993","unstructured":"Awerbuch B, Bartal Y, Fiat A (1993) Heat & Dump: competitive distributed paging. In: Proc of the 34th IEEE symp on foundations of computer science (FOCS), pp 22\u201331"},{"issue":"1","key":"150_CR7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1006\/jagm.1998.0924","volume":"28","author":"B Awerbuch","year":"1998","unstructured":"Awerbuch B, Bartal Y, Fiat A (1998) Distributed paging for general networks. J Algorithms 28(1):67\u2013104. Also appeared in Proc of the 7th SODA, pp 574\u2013583 (1996)","journal-title":"J Algorithms"},{"key":"150_CR8","first-page":"97","volume-title":"Dagstuhl workshop on on-line algorithms","author":"Y Bartal","year":"1996","unstructured":"Bartal Y (1996) Distributed paging. In: Dagstuhl workshop on on-line algorithms, pp 97\u2013117"},{"key":"150_CR9","first-page":"184","volume-title":"Proc of the 37th IEEE symp on foundations of computer science (FOCS)","author":"Y Bartal","year":"1996","unstructured":"Bartal Y (1996) Probabilistic approximations of metric spaces and its algorithmic applications. In: Proc of the 37th IEEE symp on foundations of computer science (FOCS), pp 184\u2013193"},{"key":"150_CR10","first-page":"161","volume-title":"Proc of the 30th ACM symp on theory of computing (STOC)","author":"Y Bartal","year":"1998","unstructured":"Bartal Y (1998) On approximating arbitrary metrics by tree metrics. In: Proc of the 30th ACM symp on theory of computing (STOC), pp 161\u2013168"},{"issue":"3","key":"150_CR11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1006\/jcss.1995.1073","volume":"51","author":"Y Bartal","year":"1995","unstructured":"Bartal Y, Fiat A, Rabani Y (1995) Competitive algorithms for distributed data management. J Comput Syst Sci 51(3):341\u2013358. Also appeared in Proc of the 24nd STOC, pp 39\u201350 (1992)","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"150_CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0304-3975(00)00259-0","volume":"268","author":"Y Bartal","year":"2001","unstructured":"Bartal Y, Charikar M, Indyk P (2001) On page migration and other relaxed task systems. Theor Comput Sci 268(1):43\u201366. Also appeared in Proc of the 8th SODA, pp\u00a043\u201352 (1997)","journal-title":"Theor Comput Sci"},{"issue":"1","key":"150_CR13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01294260","volume":"11","author":"S Ben-David","year":"1994","unstructured":"Ben-David S, Borodin A, Karp RM, Tardos G, Wigderson A (1994) On the power of randomization in online algorithms. Algorithmica 11(1):2\u201314. Also appeared in Proc of the 22nd STOC, pp 379\u2013386 (1990)","journal-title":"Algorithmica"},{"key":"150_CR14","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/1073970.1074016","volume-title":"Proc of the 17th ACM symp on parallelism in algorithms and architectures (SPAA)","author":"M Bienkowski","year":"2005","unstructured":"Bienkowski M (2005) Dynamic page migration with stochastic requests. In: Proc of the 17th ACM symp on parallelism in algorithms and architectures (SPAA), pp 270\u2013278"},{"key":"150_CR15","first-page":"815","volume-title":"Proc of the 13th European symp on algorithms (ESA)","author":"M Bienkowski","year":"2005","unstructured":"Bienkowski M, Byrka J (2005) Bucket game with applications to set multicover and dynamic page migration. In: Proc of the 13th European symp on algorithms (ESA), pp 815\u2013826"},{"key":"150_CR16","first-page":"962","volume-title":"Proc of the European conf in parallel processing (Euro-Par)","author":"M Bienkowski","year":"2005","unstructured":"Bienkowski M, Korzeniowski M (2005) Dynamic page migration under Brownian motion. In: Proc of the European conf in parallel processing (Euro-Par), pp 962\u2013971"},{"key":"150_CR17","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/1007912.1007923","volume-title":"Proc of the 16th ACM symp on parallelism in algorithms and architectures (SPAA)","author":"M Bienkowski","year":"2004","unstructured":"Bienkowski M, Korzeniowski M, Meyer auf der\u00a0Heide F (2004) Fighting against two adversaries: page migration in dynamic networks. In: Proc of the 16th ACM symp on parallelism in algorithms and architectures (SPAA), pp 64\u201373"},{"key":"150_CR18","first-page":"365","volume-title":"Proc of the 22nd symp on theoretical aspects of computer science (STACS)","author":"M Bienkowski","year":"2005","unstructured":"Bienkowski M, Dynia M, Korzeniowski M (2005) Improved algorithms for dynamic page migration. In: Proc of the 22nd symp on theoretical aspects of computer science (STACS), pp 365\u2013376"},{"issue":"4","key":"150_CR19","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.jda.2008.07.006","volume":"7","author":"M Bienkowski","year":"2009","unstructured":"Bienkowski M, Byrka J, Korzeniowski M, Meyer auf der\u00a0Heide\u00a0F (2009) Optimal algorithms for page migration in dynamic networks. J Discrete Algorithms 7(4):545\u2013569","journal-title":"J Discrete Algorithms"},{"key":"150_CR20","unstructured":"Black DL, Sleator DD (1989) Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University"},{"key":"150_CR21","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"issue":"1","key":"150_CR22","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/jagm.1996.0853","volume":"24","author":"M Chrobak","year":"1997","unstructured":"Chrobak M, Larmore LL, Reingold N, Westbrook J (1997) Page migration algorithms using work functions. J Algorithms 24(1):124\u2013157. Also appeared in Proc of the 4th ISAAC, pp 406\u2013415 (1993)","journal-title":"J Algorithms"},{"issue":"3","key":"150_CR23","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol J, Rao S, Talwar K (2004) A tight bound on approximating arbitrary metrics by tree metrics. J Comput Syst Sci 69(3):485\u2013497. Also appeared in Proc of the 35th STOC, pp 448\u2013455 (2003)","journal-title":"J Comput Syst Sci"},{"issue":"4","key":"150_CR24","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A Fiat","year":"1991","unstructured":"Fiat A, Karp RM, Luby M, McGeoch LA, Sleator DD, Young NE (1991) Competitive paging algorithms. J Algorithms 12(4):685\u2013699","journal-title":"J Algorithms"},{"key":"150_CR25","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-44436-X_15","volume-title":"Proc of the 3rd int workshop on approximation algorithms for combinatorial optimization (APPROX)","author":"R Fleischer","year":"2000","unstructured":"Fleischer R, Seiden SS (2000) New results for online page replication. In: Proc of the 3rd int workshop on approximation algorithms for combinatorial optimization (APPROX), pp 144\u2013154"},{"issue":"2\u20133","key":"150_CR26","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.tcs.2004.05.017","volume":"324","author":"R Fleischer","year":"2004","unstructured":"Fleischer R, G\u0142azek W, Seiden SS (2004) New results for online page replication. Theor Comput Sci 324(2\u20133):219\u2013251","journal-title":"Theor Comput Sci"},{"key":"150_CR27","first-page":"273","volume-title":"Proc of the 24th int symp on mathematical foundations of computer science (MFCS)","author":"W G\u0142azek","year":"1999","unstructured":"G\u0142azek W (1999) Lower and upper bounds for the problem of page replication in ring networks. In: Proc of the 24th int symp on mathematical foundations of computer science (MFCS), pp 273\u2013283"},{"issue":"1","key":"150_CR28","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0304-3975(00)00262-0","volume":"268","author":"W G\u0142azek","year":"2001","unstructured":"G\u0142azek W (2001) Online algorithms for page replication in rings. Theor Comput Sci 268(1):107\u2013117","journal-title":"Theor Comput Sci"},{"issue":"3","key":"150_CR29","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M Imase","year":"1991","unstructured":"Imase M, Waxman BM (1991) Dynamic Steiner tree problem. SIAM J Discrete Math 4(3):369\u2013384","journal-title":"SIAM J Discrete Math"},{"issue":"1","key":"150_CR30","first-page":"77","volume":"3","author":"AR Karlin","year":"1988","unstructured":"Karlin AR, Manasse MS, Rudolph L, Sleator DD (1988) Competitive snoopy caching. Algorithmica 3(1):77\u2013119. Also appeared in Proc of the 27th FOCS, pp 244\u2013254 (1986)","journal-title":"Algorithmica"},{"key":"150_CR31","first-page":"416","volume-title":"Proc of the IFIP 12th world computer congress","author":"RM Karp","year":"1992","unstructured":"Karp RM (1992) On-line algorithms versus off-line algorithms: how much is it worth to know the future. In: Proc of the IFIP 12th world computer congress, pp 416\u2013429"},{"key":"150_CR32","first-page":"436","volume-title":"Proc of the 4th int symp on algorithms and computation (ISAAC)","author":"H Koga","year":"1993","unstructured":"Koga H (1993) Randomized on-line algorithms for the page replication problem. In: Proc of the 4th int symp on algorithms and computation (ISAAC), pp 436\u2013445"},{"issue":"3","key":"150_CR33","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1137\/S0097539795287824","volume":"28","author":"C Lund","year":"1999","unstructured":"Lund C, Reingold N, Westbrook J, Yan DCK (1999) Competitive on-line algorithms for distributed data management. SIAM J Comput 28(3):1086\u20131111. Also appeared as on-line distributed data management in Proc of the 2nd ESA, pp 202\u2013214 (1994)","journal-title":"SIAM J Comput"},{"issue":"2","key":"150_CR34","first-page":"161","volume":"42","author":"A Matsubayashi","year":"2008","unstructured":"Matsubayashi A (2008) Uniform page migration on general networks. Int J Pure Appl Math 42(2):161\u2013168","journal-title":"Int J Pure Appl Math"},{"issue":"6","key":"150_CR35","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"LA McGeoch","year":"1991","unstructured":"McGeoch LA, Sleator DD (1991) A strongly competitive randomized paging algorithm. Algorithmica 6(6):816\u2013825","journal-title":"Algorithmica"},{"issue":"2","key":"150_CR36","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator DD, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202\u2013208","journal-title":"Commun ACM"},{"key":"150_CR37","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani VV (2001) Approximation algorithms. Springer, Berlin"},{"key":"150_CR38","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1137\/S0097539791199796","volume":"23","author":"J Westbrook","year":"1994","unstructured":"Westbrook J (1994) Randomized algorithms for the multiprocessor page migration. SIAM J Comput 23:951\u2013965. Also appeared in Proc of the DIMACS workshop on on-line algorithms, pp 135\u2013149 (1992)","journal-title":"SIAM J Comput"},{"issue":"5","key":"150_CR39","first-page":"451","volume":"28","author":"J Westbrook","year":"1995","unstructured":"Westbrook J, Yan DCK (1995) The performance of greedy algorithms for the on-line Steiner tree and related problems. Theory Comput Syst 28(5):451\u2013468. Also appeared in Proc of the 3rd WADS, pp 622\u2013633 (1993)","journal-title":"Theory Comput Syst"}],"container-title":["Computer Science - Research and Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s00450-011-0150-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T18:24:53Z","timestamp":1497896693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00450-011-0150-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,12]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["150"],"URL":"https:\/\/doi.org\/10.1007\/s00450-011-0150-8","relation":{},"ISSN":["1865-2034","1865-2042"],"issn-type":[{"value":"1865-2034","type":"print"},{"value":"1865-2042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,12]]}}}