{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:19:18Z","timestamp":1725560358631},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287025"},{"type":"electronic","value":"9783540318675"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_1","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:05:47Z","timestamp":1127829947000},"page":"1-14","source":"Crossref","is-referenced-by-count":4,"title":["Page Migration in Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm Meyer auf","family":"der Heide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1\u20132","key":"1_CR1","doi-asserted-by":"publisher","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.: Competitive analysis of randomized paging algorithms. Theoretical Computer Science\u00a0234(1\u20132), 203\u2013218 (2000)","journal-title":"Theoretical Computer Science"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., Koga, H.: Page migration with limited local memory capacity. In: Proc. of the 4th Int. Workshop on Algorithms and Data Structures (WADS), pp. 147\u2013158 (1995)","DOI":"10.1007\/3-540-60220-8_58"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A.: Competitive distributed file allocation. In: Proc. of the 25th ACM Symp. on Theory of Computing (STOC), pp. 164\u2013173 (1993)","DOI":"10.1145\/167088.167142"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A.: Heat & dump: Competitive distributed paging. In: Proc. of the 34th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 22\u201331 (1993)","DOI":"10.1109\/SFCS.1993.366885"},{"issue":"1","key":"1_CR5","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.: Distributed paging for general networks. Journal of Algorithms\u00a028(1), 67\u2013104 (1998); Proc. of the 7th SODA, pp. 574\u2013583 (1996)","journal-title":"Journal of Algorithms"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Brinkmann, A., Scheideler, C.: Anycasting in adversarial systems: routing and admission control. In: Proc. of the 30th Int. Colloq. on Automata, Languages and Programming (ICALP), pp. 1153\u20131168 (2003)","DOI":"10.1007\/3-540-45061-0_88"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Distributed paging. In: Dagstul Workshop on On-line Algorithms, pp. 97\u2013117 (1996)","DOI":"10.1007\/BFb0029566"},{"issue":"1","key":"1_CR8","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.: On page migration and other relaxed task systems. Theoretical Computer Science\u00a0268(1), 43\u201366 (2001); Also appeared in Proc. of the 8th SODA, pp. 43\u201352, (1997)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"1_CR9","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.: Competitive algorithms for distributed data management. Journal of Computer and System Sciences\u00a051(3), 341\u2013358 (1995); Also appeared in Proc. of the 24nd STOC pp. 39\u201350 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Ben-David, S., Borodin, A., Karp, R.M., Tardos, G., Wigderson, A.: On the power of randomization in online algorithms. In: Proc. of the 22nd ACM Symp. on Theory of Computing (STOC), pp. 379\u2013386 (1990)","DOI":"10.1145\/100216.100268"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Bienkowski, M.: Dynamic page migration with stochastic requests. In: Proc. of the 17th ACM Symp. on Parallelism in Algorithms and Architectures, SPAA (2005) (to appear)","DOI":"10.1145\/1073970.1074016"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Byrka, J.: Bucket game with applications to set multicover and dynamic page migration. Unpublished manuscript (2005)","DOI":"10.1007\/11561071_72"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Dynia, M., Korzeniowski, M.: Improved algorithms for dynamic page migration. In: Proc. of the 22nd Symp. on Theoretical Aspects of Computer Science (STACS), pp. 365\u2013376 (2005)","DOI":"10.1007\/978-3-540-31856-9_30"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1007\/11549468_105","volume-title":"Euro-Par 2005 Parallel Processing","author":"M. Bienkowski","year":"2005","unstructured":"Bienkowski, M., Korzeniowski, M.: Dynamic page migration under brownian motion. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol.\u00a03648, pp. 962\u2013971. Springer, Heidelberg (2005)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Korzeniowski, M., Meyer auf der Heide, F.: 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 (2004)","DOI":"10.1145\/1007912.1007923"},{"key":"1_CR16","unstructured":"Black, D.L., Sleator, D.D.: Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University (1989)"},{"key":"1_CR17","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Larmore, L.L., Reingold, N., Westbrook, J.: Page migration algorithms using work functions. In: Proc. of the 4th Int. Symp. on Algorithms and Computation (ISAAC), pp. 406\u2013415 (1993)","DOI":"10.1007\/3-540-57568-5_272"},{"issue":"4","key":"1_CR19","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. Journal of Algorithms\u00a012(4), 685\u2013699 (1991)","journal-title":"Journal of Algorithms"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Harrelson, C., Hildrum, K., Rao, S.: A polynomial-time tree decomposition to minimize congestion. In: Proc. of the 15th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 34\u201343 (2003)","DOI":"10.1145\/777412.777419"},{"key":"#cr-split#-1_CR21.1","doi-asserted-by":"crossref","unstructured":"Krick, C., Meyer auf der Heide, F., R??cke, H., V??cking, B., Westermann, M.: Data management in networks: Experimental evaluation of a provably good strategy. Theory of Computing Systems??2, 217???245 (2002);","DOI":"10.1007\/s00224-001-1045-z"},{"key":"#cr-split#-1_CR21.2","unstructured":"Also appeared in Proc. of the 11nd SPAA, pp. 165???174, (1999)"},{"issue":"3","key":"1_CR22","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, D.C.K.: Competitive on-line algorithms for distributed data management. SIAM Journal on Computing\u00a028(3), 1086\u20131111 (1999); Also appeared as On-Line Distributed Data Management in Proc. of the 2nd ESA, pp. 202\u2013214 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Maggs, B.M., Meyer auf der Heide, F., V\u00f6cking, B., Westermann, M.: Exploiting locality for data management in systems of limited bandwidth. In: Proc. of the 38th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 284\u2013293 (1997)","DOI":"10.1109\/SFCS.1997.646117"},{"issue":"6","key":"1_CR24","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"L.A. McGeoch","year":"1991","unstructured":"McGeoch, L.A., Sleator, D.D.: A strongly competitive randomized paging algorithm. Algorithmica\u00a06(6), 816\u2013825 (1991)","journal-title":"Algorithmica"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48481-7_9","volume-title":"Algorithms - ESA 1999","author":"F. Meyer auf der Heide","year":"1999","unstructured":"Meyer auf der Heide, F., V\u00f6cking, B., Westermann, M.: Provably good and practical strategies for non-uniform data management in networks. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 89\u2013100. Springer, Heidelberg (1999)"},{"key":"1_CR26","unstructured":"Meyer auf der Heide, F., V\u00f6cking, B., Westermann, M.: Caching in networks. In: Proc. of the 11th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 430\u2013439 (2000)"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H.: Minimizing congestion in general networks. In: Proc. of the 43rd IEEE Symp. on Foundations of Computer Science (FOCS), pp. 43\u201352 (2002)","DOI":"10.1109\/SFCS.2002.1181881"},{"key":"1_CR28","unstructured":"R\u00e4cke, H.: Data management and routing in general networks. PhD thesis, Universit\u00e4t Paderborn (2003)"},{"issue":"2","key":"1_CR29","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/564585.564602","volume":"33","author":"R. Rajaraman","year":"2002","unstructured":"Rajaraman, R.: Topology control and routing in ad hoc networks: a survey. SIGACT News\u00a033(2), 60\u201373 (2002)","journal-title":"SIGACT News"},{"key":"1_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0013-1","volume-title":"Handbook of Randomized Computing","author":"S. Rajesekaran","year":"2001","unstructured":"Rajesekaran, S., Pardalos, P.M., Reif, J.H., Rolim, J.: Handbook of Randomized Computing, vol.\u00a0II. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"1_CR31","volume-title":"Wireless Communications: Principles and Practices","author":"T.S. Rappaport","year":"1996","unstructured":"Rappaport, T.S.: Wireless Communications: Principles and Practices. Prentice-Hall, Englewood Cliffs (1996)"},{"issue":"3","key":"1_CR32","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/1037083","volume":"37","author":"J.S. Rosenthal","year":"1995","unstructured":"Rosenthal, J.S.: Convergence rates for Markov chains. SIAM Review\u00a037(3), 387\u2013405 (1995)","journal-title":"SIAM Review"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Scheideler, C.: Models and techniques for communication in dynamic networks. In: Proc. of the 19th Symp. on Theoretical Aspects of Computer Science (STACS), pp. 27\u201349 (2002)","DOI":"10.1007\/3-540-45841-7_2"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Schindelhauer, C., Lukovszki, T., R\u00fchrup, S., Volbert, K.: Worst case mobility in ad hoc networks. In: Proc. of the 15th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 230\u2013239 (2003)","DOI":"10.1145\/777412.777448"},{"issue":"2","key":"1_CR35","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"key":"1_CR36","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1090\/dimacs\/007\/10","volume":"7","author":"J. Westbrook","year":"1992","unstructured":"Westbrook, J.: Randomized algorithms for multiprocessor page migration. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a07, 135\u2013150 (1992)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"1_CR37","unstructured":"Westermann, M.: Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. PhD thesis, Universit\u00e4t Paderborn (2000)"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computation: towards a uniform measure of complexity. In: Proc. of the 18th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:46:09Z","timestamp":1586472369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/11549345_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}