{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:12Z","timestamp":1760202672918,"version":"3.40.4"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035772"},{"type":"electronic","value":"9783319035789"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03578-9_4","type":"book-chapter","created":{"date-parts":[[2013,11,8]],"date-time":"2013-11-08T13:52:11Z","timestamp":1383918731000},"page":"36-54","source":"Crossref","is-referenced-by-count":2,"title":["Self-adjusting Grid Networks to Minimize Expected Path Length"],"prefix":"10.1007","author":[{"given":"Chen","family":"Avin","sequence":"first","affiliation":[]},{"given":"Michael","family":"Borokhovich","sequence":"additional","affiliation":[]},{"given":"Bernhard","family":"Haeupler","sequence":"additional","affiliation":[]},{"given":"Zvi","family":"Lotker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.14778\/1454159.1454162","volume":"1","author":"M. Poess","year":"2008","unstructured":"Poess, M., Nambiar, R.: Energy cost, the key challenge of today\u2019s data centers: a power consumption analysis of tpc-c results. Proceedings of the VLDB Endowment\u00a01(2), 1229\u20131240 (2008)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"4_CR2","unstructured":"U.S. Environmental Protection Agency: Report to congress on server and data center energy efficiency public law 109-431 (2007)"},{"key":"4_CR3","unstructured":"Heller, B., Seetharaman, S., Mahadevan, P., Yiakoumis, Y., Sharma, P., Banerjee, S., McKeown, N.: Elastictree: Saving energy in data center networks. In: Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, p. 17. USENIX Association (2010)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Mirza-Aghatabar, M., Koohi, S., Hessabi, S., Pedram, M.: An empirical investigation of mesh and torus noc topologies under different routing algorithms and traffic models. In: 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools, DSD 2007, pp. 19\u201326. IEEE (2007)","DOI":"10.1109\/DSD.2007.4341445"},{"key":"4_CR5","unstructured":"Greene, K.: TR10: Software-Defined Networking"},{"key":"4_CR6","unstructured":"Hoelzle, U.: Openflow @ google, Open Networking Summit (2012)"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1355734.1355746","volume":"38","author":"N. McKeown","year":"2008","unstructured":"McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., Shenker, S., Turner, J.: Openflow: enabling innovation in campus networks. SIGCOMM Comput. Commun. Rev.\u00a038(2), 69\u201374 (2008)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Gummadi, K., Dunn, R., Saroiu, S., Gribble, S., Levy, H., Zahorjan, J.: Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles, pp. 314\u2013329. ACM (2003)","DOI":"10.1145\/1165389.945475"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Klemm, A., Lindemann, C., Vernon, M., Waldhorst, O.: Characterizing the query behavior in peer-to-peer file sharing systems. In: Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement, pp. 55\u201367. ACM (2004)","DOI":"10.1145\/1028788.1028796"},{"key":"4_CR10","volume-title":"Computers and intractability: A guide to the theory of np-completeness","author":"D. Johnson","year":"1979","unstructured":"Johnson, D., Garey, M.: Computers and intractability: A guide to the theory of np-completeness. Freeman&Co., San Francisco (1979)"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Self-adjusting binary search trees. Journal of the ACM (JACM)\u00a032(3), 652\u2013686 (1985)","journal-title":"Journal of the ACM (JACM)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Lis, M., Shim, K., Cho, M., Fletcher, C., Kinsy, M., Lebedev, I., Khan, O., Devadas, S.: Brief announcement: distributed shared memory based on computation migration. In: SPAA, pp. 253\u2013256. ACM (2011)","DOI":"10.1145\/1989493.1989530"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Batista, D., da Fonseca, N., Granelli, F., Kliazovich, D.: Self-adjusting grid networks. In: IEEE International Conference on Communications, ICC 2007, pp. 344\u2013349. IEEE (2007)","DOI":"10.1109\/ICC.2007.64"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Shang, Y., Li, D., Xu, M.: Energy-aware routing in data center network. In: Proceedings of the First ACM SIGCOMM Workshop on Green Networking 2010, pp. 1\u20138. ACM, New York (2010)","DOI":"10.1145\/1851290.1851292"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Tang, M., Liu, Z., Liang, X., Hui, P.M.: Self-adjusting routing schemes for time-varying traffic in scale-free networks. Phys. Rev. E\u00a080(2), 026114 (2009)","DOI":"10.1103\/PhysRevE.80.026114"},{"issue":"3-4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.physleta.2006.12.009","volume":"364","author":"H. Zhang","year":"2007","unstructured":"Zhang, H., Liu, Z., Tang, M., Hui, P.: An adaptive routing strategy for packet delivery in complex networks. Physics Letters A\u00a0364(3-4), 177\u2013182 (2007)","journal-title":"Physics Letters A"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/978-3-642-31585-5_52","volume-title":"Automata, Languages, and Programming","author":"N. Jain","year":"2012","unstructured":"Jain, N., Menache, I., Naor, J(S.), Shepherd, F.B.: Topology-aware VM migration in bandwidth oversubscribed datacenter networks. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 586\u2013597. Springer, Heidelberg (2012)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/1993806.1993854","volume-title":"Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2011","author":"N. Bansal","year":"2011","unstructured":"Bansal, N., Lee, K.W., Nagarajan, V., Zafer, M.: Minimum congestion mapping in a cloud. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2011, pp. 267\u2013276. ACM, New York (2011)"},{"key":"4_CR19","first-page":"151","volume":"3","author":"F. Chung","year":"1988","unstructured":"Chung, F.: Labelings of graphs. Selected Topics in Graph Theory\u00a03, 151\u2013168 (1988)","journal-title":"Selected Topics in Graph Theory"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv.\u00a034, 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"4_CR21","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","volume":"25","author":"S. Bhatt","year":"1987","unstructured":"Bhatt, S., Cosmadakis, S.: The complexity of minimizing wire lengths in vlsi layouts. Information Processing Letters\u00a025(4), 263\u2013267 (1987)","journal-title":"Information Processing Letters"},{"issue":"2","key":"4_CR22","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"S. Bhatt","year":"1984","unstructured":"Bhatt, S., Thomson Leighton, F.: A framework for solving vlsi graph layout problems. Journal of Computer and System Sciences\u00a028(2), 300\u2013343 (1984)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"4_CR23","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.comgeo.2010.09.004","volume":"44","author":"E.D. Demaine","year":"2011","unstructured":"Demaine, E.D., Fekete, S.P., Rote, G., Schweer, N., Schymura, D., Zelke, M.: Integer point sets minimizing average pairwise l1 distance: What is the optimal shape of a town? Comput. Geom. Theory Appl.\u00a044(2), 82\u201394 (2011)","journal-title":"Geom. Theory Appl."},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Avin, C., Haeupler, B., Scheideler, C., Schmid, S.: Locally self-adjusting tree networks. In: 27th IEEE International Parallel and Distributed Processing Symposium, IPDPS (2013)","DOI":"10.1109\/IPDPS.2013.40"},{"issue":"4598","key":"4_CR25","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science\u00a0220(4598), 671 (1983)","journal-title":"Science"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Rabani, Y., Sinclair, A., Wanka, R.: Local divergence of markov chains and the analysis of iterative load-balancing schemes. In: Focs, p. 694. IEEE Computer Society (1998)","DOI":"10.1109\/SFCS.1998.743520"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Mukherjee, S., Gupte, N.: Gradient mechanism in a communication network. Phys. Rev. E\u00a077(3), 036121 (2008)","DOI":"10.1103\/PhysRevE.77.036121"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Jacob, R., Richa, A., Scheideler, C., Schmid, S., T\u00e4ubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, pp. 131\u2013140. ACM (2009)","DOI":"10.1145\/1582716.1582741"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Jacob, R., Ritscher, S., Scheideler, C., Schmid, S.: A self-stabilizing and local delaunay graph construction. Algorithms and Computation, 771\u2013780 (2009)","DOI":"10.1007\/978-3-642-10631-6_78"},{"issue":"6684","key":"4_CR30","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D. Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of \u2018small-world\u2019networks. Nature\u00a0393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinational problems. Complexity of Computer Computations, 85\u2013104 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"10","key":"4_CR32","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"34","author":"C.E. Leiserson","year":"1985","unstructured":"Leiserson, C.E.: Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans. Comput.\u00a034(10), 892\u2013901 (1985)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03578-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T19:56:36Z","timestamp":1746042996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03578-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035772","9783319035789"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03578-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}