{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T10:03:14Z","timestamp":1774605794936,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:00:00Z","timestamp":1772236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:00:00Z","timestamp":1772236800000},"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":["Computing"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00607-025-01615-8","type":"journal-article","created":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T11:13:49Z","timestamp":1772277229000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A dynamic game theoretic resource allocation utilization in high-load torrent based large-scale distributed data centers"],"prefix":"10.1007","volume":"108","author":[{"given":"Pardis","family":"Kallesari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peyman","family":"Bayat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gholamhossein","family":"Ekbatanifard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,28]]},"reference":[{"key":"1615_CR1","doi-asserted-by":"crossref","unstructured":"Legout A, Urvoy-Keller G, Michiardi P (2006) Rarest first and choke algorithms are enough. Technical report, INRIA. https:\/\/arxiv.org\/abs\/cs\/0609026","DOI":"10.1145\/1177080.1177106"},{"key":"1615_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.comnet.2017.02.008","volume":"116","author":"N Anjum","year":"2017","unstructured":"Anjum N, Karamshuk D, Shikh-Bahaei M, Sastry N (2017) Survey on peer-assisted content delivery networks. Comput Netw 116:79\u201395. https:\/\/doi.org\/10.1016\/j.comnet.2017.02.008","journal-title":"Comput Netw"},{"key":"1615_CR3","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.simpat.2016.10.009","volume":"70","author":"GL Stavrinides","year":"2017","unstructured":"Stavrinides GL, Duro FR, Karatza HD, Garcia BJ, Carretero J (2017) Different aspects of workflow scheduling in large-scale distributed systems. Simul Model Pract Theory 70:120\u2013134. https:\/\/doi.org\/10.1016\/j.simpat.2016.10.009","journal-title":"Simul Model Pract Theory"},{"key":"1615_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.sysarc.2022.102545","volume":"128","author":"W Dou","year":"2022","unstructured":"Dou W, Liu B, Lin C, Wang X, Jiang X, Qi L (2022) Architecture of virtual edge data center with intelligent metadata service of a geo-distributed file system. J Syst Archit 128:102\u2013545. https:\/\/doi.org\/10.1016\/j.sysarc.2022.102545","journal-title":"J Syst Archit"},{"key":"1615_CR5","doi-asserted-by":"publisher","first-page":"659","DOI":"10.32604\/csse.2022.021729","volume":"42","author":"M Mokhtari","year":"2022","unstructured":"Mokhtari M, Motameni H, Bayat P (2022) Solving the task starvation and resources problem using optimized smpia in cloud. Comput Syst Sci Eng 42:659\u2013675. https:\/\/doi.org\/10.32604\/csse.2022.021729","journal-title":"Comput Syst Sci Eng"},{"key":"1615_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-024-04898-2","volume":"28","author":"GA Babaei","year":"2025","unstructured":"Babaei GA, Bayat P, Ekbatanifard G (2025) Detecting attacks on the internet of things network in the computing fog layer with an embedded learning approach based on clustering and blockchain. Cluster Comput 28:226. https:\/\/doi.org\/10.1007\/s10586-024-04898-2","journal-title":"Cluster Comput"},{"key":"1615_CR7","doi-asserted-by":"publisher","first-page":"104","DOI":"10.31577\/cai_2021_1_104","volume":"40","author":"M Mokhtari","year":"2021","unstructured":"Mokhtari M, Bayat P, Motameni H (2021) Multi-objective task scheduling using smart mpi-based cloud resources. Comput Inform 40:104\u2013144. https:\/\/doi.org\/10.31577\/cai_2021_1_104","journal-title":"Comput Inform"},{"key":"1615_CR8","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1016\/j.procs.2019.04.150","volume":"151","author":"GL Stavrinides","year":"2019","unstructured":"Stavrinides GL, Duro FR, Karatza HD, Garcia BJ, Carretero J (2019) Overcoming free-riding behavior in peer-to-peer networks using points system approach. Procedia Comput Sci 151:1060\u20131065. https:\/\/doi.org\/10.1016\/j.procs.2019.04.150","journal-title":"Procedia Comput Sci"},{"key":"1615_CR9","doi-asserted-by":"crossref","unstructured":"Challenger M, Bayat P, Meybodi MR (2006) A reliable optimization on distributed mutual exclusion algorithm. In: Crovella, M., Feeney, L.M., Rubenstein, D., Raghavan, S.V. (eds) 2nd international conference on testbeds and research infrastructures for the development of networks and communities, 2006. TRIDENTCOM 2006. IEEE, New York, NY, USA, pp. 8\u2013566.","DOI":"10.1109\/TRIDNT.2006.1649198"},{"key":"1615_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102906","volume":"174","author":"CKS Rodrigues","year":"2025","unstructured":"Rodrigues CKS, Rocha V (2025) Enhancing bittorrent for efficient interactive video-on-demand streaming over manets. J Netw Comput Appl 174:102906. https:\/\/doi.org\/10.1016\/j.jnca.2020.102906","journal-title":"J Netw Comput Appl"},{"key":"1615_CR11","doi-asserted-by":"crossref","unstructured":"Ekbatanifard G, Mada K (2017) Dynamic clustering with a mobile sink in wireless sensor networks. In: Crovella M, Feeney LM, Rubenstein D, Raghavan SV (eds.) 2017 3rd Iranian conference on intelligent systems and signal processing (ICSPIS), pp. 93\u201399","DOI":"10.1109\/ICSPIS.2017.8311596"},{"key":"1615_CR12","doi-asserted-by":"crossref","unstructured":"Ekbatanifard G, Yaghmaee MH, Monsefi R (2009) An adaptive cross-layer multichannel qos-mac protocol for cluster based wireless multimedia sensor networks. In: Crovella M, Feeney LM, Rubenstein D, Raghavan SV (eds) 2009 International conference on ultra modern telecommunications & workshops, pp. 1\u20136","DOI":"10.1109\/ICUMT.2009.5345446"},{"key":"1615_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.5121\/ijcnc.2014.6503","volume":"6","author":"CKDS Rodrigues","year":"2014","unstructured":"Rodrigues CKDS (2014) On the optimization of bittorrent-like protocols for interactive on-demand streaming systems. Int J Comput Netw Commun (IJCNC) 6:39\u201358. https:\/\/doi.org\/10.5121\/ijcnc.2014.6503","journal-title":"Int J Comput Netw Commun (IJCNC)"},{"key":"1615_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.bjp.2013.12.007","volume":"59","author":"X Le\u00f3n","year":"2014","unstructured":"Le\u00f3n X, Chaabouni R, S\u00e1nchez AM, Garc\u00eda LP (2014) Torrentguard: stopping scam and malware distribution in the bittorrent ecosystem. Comput Networks 59:77\u201390. https:\/\/doi.org\/10.1016\/j.bjp.2013.12.007","journal-title":"Comput Networks"},{"key":"1615_CR15","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.adhoc.2018.06.013","volume":"79","author":"M Rethfeldt","year":"2018","unstructured":"Rethfeldt M, Beichler B, Danielis P, Uster F, Haubelt C, Timmermann D (2018) Mentor: a wireless-mesh-network-aware data dissemination overlay based on bittorrent. Ad Hoc Networks 79:146\u2013159. https:\/\/doi.org\/10.1016\/j.adhoc.2018.06.013","journal-title":"Ad Hoc Networks"},{"key":"1615_CR16","doi-asserted-by":"publisher","DOI":"10.1201\/9781439863855","volume-title":"Cake-cutting algorithms: be fair if you can","author":"J Robertson","year":"1998","unstructured":"Robertson J, Webb W (1998) Cake-cutting algorithms: be fair if you can. A K Peters\/CRC Press, New York"},{"key":"1615_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.geb.2022.01.027","volume":"133","author":"M Kyropoulou","year":"2022","unstructured":"Kyropoulou M, Ortega J, Segal-Halevi E (2022) Fair cake-cutting in practice. Games Econ Behav 133:28\u201349. https:\/\/doi.org\/10.1016\/j.geb.2022.01.027","journal-title":"Games Econ Behav"},{"key":"1615_CR18","unstructured":"Slantchev BL (2004) Game theory: repeated games. Accessed: 2025-03-14"},{"key":"1615_CR19","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.comnet.2008.09.029","volume":"53","author":"N Andrade","year":"2009","unstructured":"Andrade N, Santos NE, Brasileiro F, Ripeanu M (2009) Resource demand and supply in bittorrent content-sharing communities. Comput Networks 53:515\u2013527. https:\/\/doi.org\/10.1016\/j.comnet.2008.09.029","journal-title":"Comput Networks"},{"key":"1615_CR20","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1007\/s00355-022-01416-4","volume":"59","author":"J Ortega","year":"2022","unstructured":"Ortega J, Segal HE (2022) Obvious manipulations in cake-cutting. Soc Choice Welfare 59:969\u2013988. https:\/\/doi.org\/10.1007\/s00355-022-01416-4","journal-title":"Soc Choice Welfare"},{"key":"1615_CR21","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.dam.2024.05.029","volume":"357","author":"SM Yuen","year":"2024","unstructured":"Yuen SM, Suksompong W (2024) Approximate envy-freeness in graphical cake cutting. Discrete Appl Math 357:112\u2013131. https:\/\/doi.org\/10.1016\/j.dam.2024.05.029","journal-title":"Discrete Appl Math"},{"key":"1615_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.artint.2022.103783","volume":"313","author":"E Elkind","year":"2022","unstructured":"Elkind E, Segal HE, Suksompong W (2022) Mind the gap: cake cutting with separation. Artif Intell 313:103\u2013783. https:\/\/doi.org\/10.1016\/j.artint.2022.103783","journal-title":"Artif Intell"},{"key":"1615_CR23","unstructured":"Islam S (2017) Network load balancing methods: experimental comparisons and improvement. arXiv preprint arXiv:1710.06957. Accessed: 2025-10-18"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-025-01615-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-025-01615-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-025-01615-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T09:32:53Z","timestamp":1774603973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-025-01615-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,28]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1615"],"URL":"https:\/\/doi.org\/10.1007\/s00607-025-01615-8","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,28]]},"assertion":[{"value":"17 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"44"}}