{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:08:29Z","timestamp":1775254109976,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030032319","type":"print"},{"value":"9783030032326","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-03232-6_15","type":"book-chapter","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T07:44:48Z","timestamp":1539935088000},"page":"221-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Load Balanced Distributed Directories"],"prefix":"10.1007","author":[{"given":"Shishir","family":"Rai","sequence":"first","affiliation":[]},{"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[]},{"given":"Costas","family":"Busch","sequence":"additional","affiliation":[]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-1-4615-3604-8_13","volume-title":"Workshop on Scalable Shared Memory Multiprocessors","author":"A Agarwal","year":"1991","unstructured":"Agarwal, A., et al.: The MIT alewife machine: a large-scale distributed-memory multiprocessor. In: Dubois, M., Thakkar, S. (eds.) Workshop on Scalable Shared Memory Multiprocessors, pp. 239\u2013261. Springer, Boston (1991). https:\/\/doi.org\/10.1007\/978-1-4615-3604-8_13"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(94)90158-9","volume":"130","author":"N Alon","year":"1994","unstructured":"Alon, N., Kalai, G., Ricklin, M., Stockmeyer, L.J.: Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. Theor. Comput. Sci. 130(1), 175\u2013201 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-319-14720-8_17","volume-title":"Transactional Memory. Foundations, Algorithms, Tools, and Applications","author":"H Attiya","year":"2015","unstructured":"Attiya, H., Gramoli, V., Milani, A.: Directory protocols for distributed transactional memory. In: Guerraoui, R., Romano, P. (eds.) Transactional Memory. Foundations, Algorithms, Tools, and Applications. LNCS, vol. 8913, pp. 367\u2013391. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-14720-8_17"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/115994.116013","volume":"21","author":"B Awerbuch","year":"1991","unstructured":"Awerbuch, B., Peleg, D.: Concurrent online tracking of mobile users. SIGCOMM Comput. Commun. Rev. 21(4), 221\u2013233 (1991)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: FOCS, pp. 184\u2013193 (1996)","DOI":"10.1109\/SFCS.1996.548477"},{"issue":"12","key":"15_CR6","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TC.1978.1675013","volume":"27","author":"LM Censier","year":"1978","unstructured":"Censier, L.M., Feautrier, P.: A new solution to coherence problems in multicache systems. IEEE Trans. Comput. 27(12), 1112\u20131118 (1978)","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"15_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/2.55500","volume":"23","author":"D Chaiken","year":"1990","unstructured":"Chaiken, D., Fields, C., Kurihara, K., Agarwal, A.: Directory-based cache coherence in large-scale multiprocessors. Computer 23(6), 49\u201358 (1990)","journal-title":"Computer"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0056478","volume-title":"Distributed Computing","author":"MJ Demmer","year":"1998","unstructured":"Demmer, M.J., Herlihy, M.P.: The arrow distributed directory protocol. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 119\u2013133. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056478"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: STOC, pp. 448\u2013455 (2003)","DOI":"10.1145\/780542.780608"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-15369-3_14","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"I Gorodezky","year":"2010","unstructured":"Gorodezky, I., Kleinberg, R.D., Shmoys, D.B., Spencer, G.: Improved lower bounds for the universal and a priori TSP. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) RANDOM 2010, APPROX 2010. LNCS, vol. 6302, pp. 178\u2013191. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15369-3_14"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Gupta, A., Hajiaghayi, M.T., R\u00e4cke, H.: Oblivious network design. In: SODA, pp. 970\u2013979 (2006)","DOI":"10.1145\/1109557.1109665"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Leighton, T.: Improved lower and upper bounds for universal TSP in planar metrics. In: SODA, pp. 649\u2013658 (2006)","DOI":"10.1145\/1109557.1109628"},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/173682.165164","volume":"21","author":"Maurice Herlihy","year":"1993","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. In: ISCA, pp. 289\u2013300 (1993)","journal-title":"ACM SIGARCH Computer Architecture News"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00446-007-0037-x","volume":"20","author":"M Herlihy","year":"2007","unstructured":"Herlihy, M., Sun, Y.: Distributed transactional memory for metric-space networks. Distrib. Comput. 20(3), 195\u2013208 (2007)","journal-title":"Distrib. Comput."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Jia, L., Lin, G., Noubir, G., Rajaraman, R., Sundaram, R.: Universal approximations for TSP, steiner tree, and set cover. In: STOC, pp. 386\u2013395 (2005)","DOI":"10.1145\/1060590.1060649"},{"key":"15_CR16","unstructured":"Krauthgamer, R., Lee, J.R.: Navigating nets: simple algorithms for proximity search. In: SODA, pp. 798\u2013807 (2004)"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: SPAA, pp. 311\u2013320 (1997)","DOI":"10.1145\/258492.258523"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Rajaraman, R., Richa, A.W., V\u00f6cking, B., Vuppuluri, G.: A data tracking scheme for general networks. In: SPAA, pp. 247\u2013254 (2001)","DOI":"10.1145\/378580.378670"},{"issue":"4","key":"15_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/964723.383072","volume":"31","author":"S Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. SIGCOMM Comput. Commun. Rev. 31(4), 161\u2013172 (2001)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K Raymond","year":"1989","unstructured":"Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7(1), 61\u201377 (1989)","journal-title":"ACM Trans. Comput. Syst."},{"key":"15_CR21","unstructured":"Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: SODA, pp. 770\u2013779 (2000)"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329\u2013350. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45518-3_18"},{"issue":"5","key":"15_CR23","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s00446-014-0214-7","volume":"27","author":"G Sharma","year":"2014","unstructured":"Sharma, G., Busch, C.: Distributed transactional memory for general networks. Distrib. Comput. 27(5), 329\u2013362 (2014)","journal-title":"Distrib. Comput."},{"issue":"2","key":"15_CR24","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00453-013-9803-2","volume":"71","author":"G Sharma","year":"2015","unstructured":"Sharma, G., Busch, C.: An analysis framework for distributed hierarchical directories. Algorithmica 71(2), 377\u2013408 (2015)","journal-title":"Algorithmica"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.jpdc.2015.02.002","volume":"78","author":"G Sharma","year":"2015","unstructured":"Sharma, G., Busch, C.: A load balanced directory for distributed shared memory objects. J. Parallel Distrib. Comput. 78, 6\u201324 (2015)","journal-title":"J. Parallel Distrib. Comput."},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.tcs.2015.05.006","volume":"608","author":"G Sharma","year":"2015","unstructured":"Sharma, G., Busch, C.: Optimal nearest neighbor queries in sensor networks. Theor. Comput. Sci. 608, 146\u2013165 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"15_CR27","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s004460050028","volume":"10","author":"N Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. Distrib. Comput. 10(2), 99\u2013116 (1997)","journal-title":"Distrib. Comput."},{"issue":"4","key":"15_CR28","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/964723.383071","volume":"31","author":"I Stoica","year":"2001","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. SIGCOMM Comput. Commun. Rev. 31(4), 149\u2013160 (2001)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: STOC, pp. 281\u2013290 (2004)","DOI":"10.1145\/1007352.1007399"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-10877-8_6","volume-title":"Principles of Distributed Systems","author":"B Zhang","year":"2009","unstructured":"Zhang, B., Ravindran, B.: Brief announcement: Relay: a cache-coherence protocol for distributed transactional memory. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 48\u201353. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10877-8_6"},{"issue":"1","key":"15_CR31","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"BY Zhao","year":"2006","unstructured":"Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: a resilient global-scale overlay for service deployment. IEEE J. Sel. Areas Commun. 22(1), 41\u201353 (2006)","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03232-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:49:28Z","timestamp":1775249368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03232-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030032319","9783030032326"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03232-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coord.c.titech.ac.jp\/symp\/sss2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}