{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:58:06Z","timestamp":1771703886734,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T00:00:00Z","timestamp":1652400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T00:00:00Z","timestamp":1652400000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872311"],"award-info":[{"award-number":["61872311"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61973261"],"award-info":[{"award-number":["61973261"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62006069"],"award-info":[{"award-number":["62006069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10586-022-03603-5","type":"journal-article","created":{"date-parts":[[2022,5,13]],"date-time":"2022-05-13T12:02:46Z","timestamp":1652443366000},"page":"3785-3797","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Nash equilibrium and social optimization of a task offloading strategy with real-time virtual machine repair in an edge computing system"],"prefix":"10.1007","volume":"25","author":[{"given":"Xiaobing","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhili","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5845-5601","authenticated-orcid":false,"given":"Shunfu","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,13]]},"reference":[{"key":"3603_CR1","doi-asserted-by":"publisher","unstructured":"Ma, Q., Huang, H., Zhang, W., Qiu, M.: Design of smart home system based on collaborative edge computing and cloud computing. In: Algorithms and Architectures for Parallel Processing, pp. 355\u2013366 (2020). https:\/\/doi.org\/10.1007\/978-3-030-60248-2_24","DOI":"10.1007\/978-3-030-60248-2_24"},{"issue":"6","key":"3603_CR2","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/MNET.011.2000089","volume":"34","author":"Q Duan","year":"2020","unstructured":"Duan, Q., Wang, S., Ansari, N.: Convergence of networking and cloud\/edge computing: status, challenges, and opportunities. IEEE Network 34(6), 148\u2013155 (2020). https:\/\/doi.org\/10.1109\/MNET.011.2000089","journal-title":"IEEE Network"},{"key":"3603_CR3","doi-asserted-by":"publisher","unstructured":"Babou, C., Fall, D., Kashihara, S., Niang, I., Kadobayashi, Y.: Home edge computing (HEC): design of a new edge computing technology for achieving ultra-low latency. In: International Conference on Edge Computing, pp. 3\u201317 (2018). https:\/\/doi.org\/10.1007\/978-3-319-94340-4_1","DOI":"10.1007\/978-3-319-94340-4_1"},{"key":"3603_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-021-03781-w","author":"W Li","year":"2021","unstructured":"Li, W., Jin, S.: Performance evaluation and optimization of a task offloading strategy on the mobile edge computing with edge heterogeneity. J. Supercomput. (2021). https:\/\/doi.org\/10.1007\/s11227-021-03781-w","journal-title":"J. Supercomput."},{"issue":"4","key":"3603_CR5","doi-asserted-by":"publisher","first-page":"2735","DOI":"10.1007\/s10586-021-03268-6","volume":"24","author":"S Zaman","year":"2021","unstructured":"Zaman, S., Jehangiri, A., Maqsood, T., Ahmad, Z., Umar, A., Shuja, J., Alanazi, E., Alasmary, W.: Mobility-aware computational offloading in mobile edge networks: a survey. Clust. Comput. 24(4), 2735\u20132756 (2021). https:\/\/doi.org\/10.1007\/s10586-021-03268-6","journal-title":"Clust. Comput."},{"key":"3603_CR6","doi-asserted-by":"publisher","unstructured":"Li, S.: A task offloading optimization strategy in MEC-based smart cities. Internet Technol. Lett. 4(1), e158.1\u2013e158.5 (2020). https:\/\/doi.org\/10.1002\/itl2.158","DOI":"10.1002\/itl2.158"},{"key":"3603_CR7","doi-asserted-by":"publisher","unstructured":"Yand, P., Li, L., Liang, W., Zhang, H., Ding, Z.: Latency optimization for multi-user NOMA-MEC offloading using reinforcement learning. In: 28th Wireless and Optical Communications Conference (WOCC), pp. 1\u20135 (2019). https:\/\/doi.org\/10.1109\/WOCC.2019.8770605","DOI":"10.1109\/WOCC.2019.8770605"},{"key":"3603_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-7756-7","volume-title":"Resource Management and Performance Analysis of Wireless Communication Networks","author":"S Jin","year":"2021","unstructured":"Jin, S., Yue, W.: Resource Management and Performance Analysis of Wireless Communication Networks. Springer, Singapore (2021)"},{"key":"3603_CR9","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1109\/ACCESS.2020.3047815","volume":"9","author":"S Lv","year":"2021","unstructured":"Lv, S., Zhu, L.: Single server repairable queueing system with variable service rate and failure rate. IEEE Access 9, 1233\u20131239 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2020.3047815","journal-title":"IEEE Access"},{"issue":"5","key":"3603_CR10","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/s10958-019-04193-1","volume":"237","author":"A Kuki","year":"2019","unstructured":"Kuki, A., B\u00e9rczes, T., Sztrik, J., Kvach, A.: Numerical analysis of retrial queueing systems with conflict of customers and an unreliable server. J. Math. Sci. 237(5), 673\u2013683 (2019). https:\/\/doi.org\/10.1007\/s10958-019-04193-1","journal-title":"J. Math. Sci."},{"issue":"3","key":"3603_CR11","doi-asserted-by":"publisher","first-page":"419","DOI":"10.3390\/sym11030419","volume":"11","author":"SI Ammar","year":"2019","unstructured":"Ammar, S.I., Rajadurai, P.: Performance analysis of preemptive priority retrial queueing system with disaster under working breakdown services. Symmetry 11(3), 419 (2019). https:\/\/doi.org\/10.3390\/sym11030419","journal-title":"Symmetry"},{"key":"3603_CR12","doi-asserted-by":"publisher","unstructured":"Klimenok, V., Dudin, A., Shumchenia, U.: A multi-server queueing system with backup servers. In: Information Technologies and Mathematical Modelling (ITMM), pp. 117\u2013128 (2018). https:\/\/doi.org\/10.1007\/978-3-319-97595-5_10","DOI":"10.1007\/978-3-319-97595-5_10"},{"issue":"4","key":"3603_CR13","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1134\/S0005117919040040","volume":"80","author":"AI Peschansky","year":"2019","unstructured":"Peschansky, A.I.: Stationary characteristics of an unreliable multi-server queueing system with losses and time redundancy. Autom. Remote. Control. 80(4), 648\u2013665 (2019). https:\/\/doi.org\/10.1134\/S0005117919040040","journal-title":"Autom. Remote. Control."},{"key":"3603_CR14","doi-asserted-by":"publisher","unstructured":"Zhang, C., Du, H.: DMORA: decentralized multi-SP online resource allocation scheme for mobile edge computing. IEEE Trans. Cloud Comput. (2020). https:\/\/doi.org\/10.1109\/TCC.2020.3044852","DOI":"10.1109\/TCC.2020.3044852"},{"issue":"4","key":"3603_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.3390\/jsan9040058","volume":"9","author":"H Abdah","year":"2020","unstructured":"Abdah, H., Barraca, J.P., Aguiar, R.L.: Exploiting virtual machine commonality for improved resource allocation in edge networks. J. Sens. Actuator Netw. 9(4), 58 (2020). https:\/\/doi.org\/10.3390\/jsan9040058","journal-title":"J. Sens. Actuator Netw."},{"key":"3603_CR16","doi-asserted-by":"publisher","unstructured":"Liu, Y., Zhang, A., Xia, X., Chen, F., Ye, L., Zhang, B., He, Q.: Proactive data caching and replacement in the edge computing environment. In: IEEE 13th International Conference on Cloud Computing (CLOUD), pp. 193\u2013200 (2020). https:\/\/doi.org\/10.1109\/CLOUD49709.2020.00038","DOI":"10.1109\/CLOUD49709.2020.00038"},{"key":"3603_CR17","doi-asserted-by":"publisher","unstructured":"Fan, Q., Lin, J., Feng, G., Gao, Z., Wang, H., Li, Y.: Joint service caching and computation offloading to maximize system profits in mobile edge-cloud computing. In: 16th International Conference on Mobility, Sensing and Networking (MSN), pp. 244\u2013251 (2020). https:\/\/doi.org\/10.1109\/MSN50589.2020.00050","DOI":"10.1109\/MSN50589.2020.00050"},{"key":"3603_CR18","doi-asserted-by":"publisher","unstructured":"Kadir, N.: Observation of the common phenomena from a MATLAB model for M\/M\/1 queuing system. In: International Conference on Advances in Electrical Engineering (ICAEE), pp. 210\u2013212 (2015). https:\/\/doi.org\/10.1109\/ICAEE.2015.7506833","DOI":"10.1109\/ICAEE.2015.7506833"},{"key":"3603_CR19","volume-title":"Matrix-Geometric Solutions in Stochastic Models","author":"M Neuts","year":"1981","unstructured":"Neuts, M.: Matrix-Geometric Solutions in Stochastic Models. Johns Hopkins University Press, Baltimore (1981)"},{"issue":"2","key":"3603_CR20","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1239\/jap\/996986760","volume":"38","author":"Q He","year":"2001","unstructured":"He, Q., Neuts, M.: On the convergence and limits of certain matrix sequences arising in Quasi-Birth-and-Death Markov chains. J. Appl. Probab. 38(2), 519\u2013541 (2001). https:\/\/doi.org\/10.1239\/jap\/996986760","journal-title":"J. Appl. Probab."},{"issue":"1","key":"3603_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.cam.2008.07.056","volume":"219","author":"Q Liu","year":"2008","unstructured":"Liu, Q., Chen, G.: A note on the preconditioned Gauss\u2013Seidel method for M-matrices. J. Comput. Appl. Math. 219(1), 59\u201371 (2008). https:\/\/doi.org\/10.1016\/j.cam.2008.07.056","journal-title":"J. Comput. Appl. Math."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03603-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-022-03603-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03603-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T14:16:28Z","timestamp":1666880188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-022-03603-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,13]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["3603"],"URL":"https:\/\/doi.org\/10.1007\/s10586-022-03603-5","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,13]]},"assertion":[{"value":"14 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The code generated during the current study are available from the corresponding author on reasonable request.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}