{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,2]],"date-time":"2026-08-02T07:55:01Z","timestamp":1785657301326,"version":"3.56.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111265","type":"print"},{"value":"9783032111272","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-11127-2_4","type":"book-chapter","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:46Z","timestamp":1763409826000},"page":"21-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Poly-log Approximation for\u00a0Transaction Scheduling in\u00a0Fog-Cloud Computing and\u00a0Beyond"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8200-9046","authenticated-orcid":false,"given":"Ramesh","family":"Adhikari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4381-4333","authenticated-orcid":false,"given":"Costas","family":"Busch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0709-9600","authenticated-orcid":false,"given":"Pavan","family":"Poudel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,18]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C., Goldberg, A.V., Malkhi, D.: Routing in networks with low doubling dimension. In: 26th IEEE International Conference on Distributed Computing Systems (ICDCS\u201906), pp. 75\u201375. IEEE (2006)","DOI":"10.1109\/ICDCS.2006.72"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Adhikari, R., Busch, C.: Lockless blockchain sharding with multiversion control. In: International Colloquium on Structural Information and Communication Complexity, pp. 112\u2013131. Springer (2023)","DOI":"10.1007\/978-3-031-32733-9_6"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Adhikari, R., Busch, C., Kowalski, D.R.: Stable blockchain sharding under adversarial transaction generation. In: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 451\u2013461 (2024)","DOI":"10.1145\/3626183.3659970"},{"key":"4_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114184","volume":"978","author":"C Busch","year":"2023","unstructured":"Busch, C., Chlebus, B.S., Herlihy, M., Popovic, M., Poudel, P., Sharma, G.: Flexible scheduling of transactional memory on trees. Theoret. Comput. Sci. 978, 114184 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Busch, C., Chlebus, B.S., Kowalski, D.R., Poudel, P.: Stable scheduling in transactional memory. In: International Conference on Algorithms and Complexity, pp. 172\u2013186. Springer (2023)","DOI":"10.1007\/978-3-031-30448-4_13"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Impossibility results for distributed transactional memory. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp. 207\u2013215 (2015)","DOI":"10.1145\/2767386.2767433"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Fast scheduling in distributed transactional memory. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 173\u2013182 (2017)","DOI":"10.1145\/3087556.3087565"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00446-021-00410-w","volume":"35","author":"C Busch","year":"2022","unstructured":"Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Dynamic scheduling in distributed transactional memory. Distrib. Comput. 35(1), 19\u201336 (2022)","journal-title":"Distrib. Comput."},{"issue":"1","key":"4_CR9","first-page":"1","volume":"1","author":"Y Cao","year":"2023","unstructured":"Cao, Y., Fan, W., Ou, W., Xie, R., Zhao, W.: Transaction scheduling: from conflicts to runtime conflicts. Proc. ACM Manag. Data 1(1), 1\u201326 (2023)","journal-title":"Proc. ACM Manag. Data"},{"issue":"5","key":"4_CR10","doi-asserted-by":"publisher","first-page":"469","DOI":"10.14778\/3055540.3055541","volume":"10","author":"M Ceccarello","year":"2017","unstructured":"Ceccarello, M., Pietracaprina, A., Pucci, G., Upfal, E.: Mapreduce and streaming algorithms for diversity maximization in metric spaces of bounded doubling dimension. Proc. VLDB Endowment 10(5), 469\u2013480 (2017)","journal-title":"Proc. VLDB Endowment"},{"issue":"4","key":"4_CR11","first-page":"1","volume":"12","author":"THH Chan","year":"2016","unstructured":"Chan, T.H.H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in doubling metrics. ACM Trans. Algorithms (TALG) 12(4), 1\u201322 (2016)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"4_CR12","unstructured":"Gao, J., Guibas, L., Milosavljevic, N., Zhou, D.: Distributed resource management and matching in sensor networks. In: 2009 International Conference on Information Processing in Sensor Networks, pp. 97\u2013108 (2009)"},{"issue":"7","key":"4_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3544836","volume":"55","author":"M Goudarzi","year":"2022","unstructured":"Goudarzi, M., Palaniswami, M., Buyya, R.: Scheduling IoT applications in edge and fog computing environments: a taxonomy and future directions. ACM Comput. Surv. 55(7), 1\u201341 (2022)","journal-title":"ACM Comput. Surv."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Gramoli, V., Lu, Z., Tang, Q., Zarbafian, P.: Aoab: optimal and fair ordering of financial transactions. In: 2024 54th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 377\u2013388. IEEE (2024)","DOI":"10.1109\/DSN58291.2024.00045"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: 44th Symposium on Foundations of Computer Science, FOCS 2003, Cambridge, October 11-14, 2003, Proceedings, pp. 534\u2013543. IEEE Computer Society (2003)","DOI":"10.1109\/SFCS.2003.1238226"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Hendler, D., Naiman, A., Peluso, S., Quaglia, F., Romano, P., Suissa, A.: Exploiting locality in lease-based replicated transactional memory via task migration. In: DISC, pp. 121\u2013133 (2013)","DOI":"10.1007\/978-3-642-41527-2_9"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. In: ISCA, pp. 289\u2013300 (1993)","DOI":"10.1145\/165123.165164"},{"key":"4_CR18","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, 195\u2013208 (2007)","journal-title":"Distrib. Comput."},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3582500","volume":"19","author":"A Jayaprakash","year":"2023","unstructured":"Jayaprakash, A., Salavatipour, M.R.: Approximation schemes for capacitated vehicle routing on graphs of bounded treewidth, bounded doubling, or highway dimension. ACM Trans. Algorithms 19(2), 1\u201336 (2023)","journal-title":"ACM Trans. Algorithms"},{"key":"4_CR20","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: Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, pp. 386\u2013395 (2005)","DOI":"10.1145\/1060590.1060649"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.future.2022.04.035","volume":"135","author":"Y Kang","year":"2022","unstructured":"Kang, Y., Pan, L., Liu, S.: Job scheduling for big data analytical applications in clouds: a taxonomy study. Futur. Gener. Comput. Syst. 135, 129\u2013145 (2022)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10922-023-09774-9","volume":"32","author":"A Khiat","year":"2024","unstructured":"Khiat, A., Haddadi, M., Bahnes, N.: Genetic-based algorithm for task scheduling in fog-cloud environment. J. Netw. Syst. Manage. 32(1), 3 (2024)","journal-title":"J. Netw. Syst. Manage."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Kim, J., Ravindran, B.: On transactional scheduling in distributed transactional memory systems. In: Symposium on Self-Stabilizing Systems, pp. 347\u2013361. Springer (2010)","DOI":"10.1007\/978-3-642-16023-3_29"},{"issue":"5","key":"4_CR24","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00446-021-00401-x","volume":"34","author":"N Kitamura","year":"2021","unstructured":"Kitamura, N., Kitagawa, H., Otachi, Y., Izumi, T.: Low-congestion shortcut and graph parameters. Distrib. Comput. 34(5), 349\u2013365 (2021). https:\/\/doi.org\/10.1007\/s00446-021-00401-x","journal-title":"Distrib. Comput."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Konjevod, G., Richa, A.W., Xia, D.: Dynamic routing and location services in metrics of low doubling dimension. In: Proceedings of the Twenty-seventh ACM Symposium on Principles of Distributed Computing, pp. 417\u2013417 (2008)","DOI":"10.1145\/1400751.1400808"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: Proceedings of the Twenty-fourth Annual ACM Symposium on Principles of Distributed Computing, pp. 60\u201368 (2005)","DOI":"10.1145\/1073814.1073826"},{"key":"4_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2022.102687","volume":"123","author":"M Mokni","year":"2023","unstructured":"Mokni, M., Yassa, S., Hajlaoui, J.E., Omri, M.N., Chelouah, R.: Multi-objective fuzzy approach to scheduling and offloading workflow tasks in fog-cloud computing. Simul. Model. Pract. Theory 123, 102687 (2023)","journal-title":"Simul. Model. Pract. Theory"},{"key":"4_CR28","unstructured":"Mulzer, W., Willert, M.: Compact routing in unit disk graphs. In: 31st International Symposium on Algorithms and Computation (ISAAC 2020), pp. 16\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"1","key":"4_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s12243-016-0527-6","volume":"72","author":"HS Narman","year":"2017","unstructured":"Narman, H.S., Hossain, M.S., Atiquzzaman, M., Shen, H.: Scheduling internet of things applications in cloud computing. Ann. Telecommun. 72(1), 79\u201393 (2017)","journal-title":"Ann. Telecommun."},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Nikoui, T.S., Balador, A., masoud Rahmani, A., Bakhshi, Z.: Cost-aware task scheduling in fog-cloud environment. In: 2020 CSI\/CPSSI International Symposium on Real-Time and Embedded Systems and Technologies (RTEST), pp.\u00a01\u20138 (2020)","DOI":"10.1109\/RTEST49666.2020.9140118"},{"issue":"1","key":"4_CR31","first-page":"42","volume":"138","author":"TS Nikoui","year":"2016","unstructured":"Nikoui, T.S., Jabbehdari, S., Bagheri, A.: Providing a cloud broker-based approach to improve the energy consumption and achieve a green cloud computing. Int. J. Comput. Appl. 138(1), 42\u201349 (2016)","journal-title":"Int. J. Comput. Appl."},{"issue":"5","key":"4_CR32","doi-asserted-by":"publisher","first-page":"2824","DOI":"10.1109\/TSC.2021.3079110","volume":"15","author":"MLM Peixoto","year":"2021","unstructured":"Peixoto, M.L.M., Genez, T.A., Bittencourt, L.F.: Hierarchical scheduling mechanisms in multi-level fog computing. IEEE Trans. Serv. Comput. 15(5), 2824\u20132837 (2021)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"4_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2024.114463","volume":"993","author":"P Poudel","year":"2024","unstructured":"Poudel, P., Rai, S., Guragain, S.: Ordered scheduling in control-flow distributed transactional memory. Theor. Comput. Sci. 993, 114463 (2024). https:\/\/doi.org\/10.1016\/J.TCS.2024.114463","journal-title":"Theor. Comput. Sci."},{"key":"4_CR34","doi-asserted-by":"publisher","unstructured":"Poudel, P., Rai, S., Sharma, G.: Processing distributed transactions in a predefined order. In: ICDCN \u201921: International Conference on Distributed Computing and Networking, Virtual Event, January 5-8, 2021, pp. 215\u2013224. ACM (2021). https:\/\/doi.org\/10.1145\/3427796.3427819","DOI":"10.1145\/3427796.3427819"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Poudel, P., Sharma, G.: Graphtm: an efficient framework for supporting transactional memory in a distributed environment. In: ICDCN, pp. 11:1\u201311:10 (2020)","DOI":"10.1145\/3369740.3369774"},{"key":"4_CR36","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-24550-3_19","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"MM Saad","year":"2011","unstructured":"Saad, M.M., Ravindran, B.: Snake: control flow distributed software transactional memory. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) Stabilization, Safety, and Security of Distributed Systems, pp. 238\u2013252. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011)"},{"issue":"5","key":"4_CR37","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). https:\/\/doi.org\/10.1007\/s00446-014-0214-7","journal-title":"Distrib. Comput."},{"key":"4_CR38","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 Distr. Comput. 78, 6\u201324 (2015)","journal-title":"J. Parallel Distr. Comput."},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 204\u2013213 (1995)","DOI":"10.1145\/224964.224987"},{"issue":"5","key":"4_CR40","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1109\/TC.2011.64","volume":"61","author":"S Srinivasagopalan","year":"2011","unstructured":"Srinivasagopalan, S., Busch, C., Iyengar, S.: An oblivious spanning tree for single-sink buy-at-bulk in low doubling-dimension graphs. IEEE Trans. Comput. 61(5), 700\u2013712 (2011)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-47993-7_8","volume-title":"ECOOP 2002 \u2014 Object-Oriented Programming","author":"E Tilevich","year":"2002","unstructured":"Tilevich, E., Smaragdakis, Y.: J-Orchestra: automatic java application partitioning. In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 178\u2013204. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-47993-7_8"},{"issue":"1","key":"4_CR42","doi-asserted-by":"publisher","first-page":"121","DOI":"10.23919\/JCN.2022.000058","volume":"25","author":"H Tran-Dang","year":"2023","unstructured":"Tran-Dang, H., Kim, D.S.: Disco: distributed computation offloading framework for fog computing networks. J. Commun. Netw. 25(1), 121\u2013131 (2023)","journal-title":"J. Commun. Netw."},{"issue":"10","key":"4_CR43","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1016\/j.jpdc.2010.02.006","volume":"70","author":"T Usui","year":"2010","unstructured":"Usui, T., Behrends, R., Evans, J., Smaragdakis, Y.: Adaptive locks: combining transactions and locks for efficient concurrency. J. Parallel Distr. Comput. 70(10), 1009\u20131023 (2010)","journal-title":"J. Parallel Distr. Comput."},{"issue":"6","key":"4_CR44","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.14778\/3583140.3583153","volume":"16","author":"Q Zhang","year":"2023","unstructured":"Zhang, Q., et al.: Efficient distributed transaction processing in heterogeneous networks. Proc. VLDB Endowment 16(6), 1372\u20131385 (2023)","journal-title":"Proc. VLDB Endowment"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11127-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:49Z","timestamp":1763409829000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11127-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,18]]},"ISBN":["9783032111265","9783032111272"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11127-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,18]]},"assertion":[{"value":"18 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Kathmandu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nepal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}