{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T06:02:13Z","timestamp":1771480933713,"version":"3.50.1"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Performance Evaluation"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1016\/j.peva.2025.102540","type":"journal-article","created":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T16:55:58Z","timestamp":1767027358000},"page":"102540","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Leveraging task offloading in edge-cloud Computing systems using\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si4.svg\" display=\"inline\" id=\"d1e2428\">\n                      <mml:mrow>\n                        <mml:mi>G<\/mml:mi>\n                        <mml:mi>I<\/mml:mi>\n                        <mml:mo>\/<\/mml:mo>\n                        <mml:msup>\n                          <mml:mrow>\n                            <mml:mi>M<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:mrow>\n                            <mml:mrow>\n                              <mml:mo>(<\/mml:mo>\n                              <mml:mi>L<\/mml:mi>\n                              <mml:mo>\u2192<\/mml:mo>\n                              <mml:mi>K<\/mml:mi>\n                              <mml:mo>)<\/mml:mo>\n                            <\/mml:mrow>\n                          <\/mml:mrow>\n                        <\/mml:msup>\n                        <mml:mo>\/<\/mml:mo>\n                        <mml:mn>1<\/mml:mn>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    queueing model with dynamic service rates"],"prefix":"10.1016","volume":"171","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4260-4721","authenticated-orcid":false,"given":"Veena","family":"Goswami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.peva.2025.102540_b1","doi-asserted-by":"crossref","first-page":"3739","DOI":"10.1080\/03610926.2020.1801739","article-title":"Extended analysis and computationally efficient results for the GI\/Ma,b\/1 queueing system","volume":"51","author":"Samanta","year":"2022","journal-title":"Comm. Statist. Theory Methods"},{"key":"10.1016\/j.peva.2025.102540_b2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1080\/16843703.2011.11673249","article-title":"Performance analysis of a renewal input bulk service queue with accessible and non-accessible batches","volume":"8","author":"Goswami","year":"2011","journal-title":"Qual. Technol. Quant. Manag."},{"key":"10.1016\/j.peva.2025.102540_b3","first-page":"1","article-title":"Stationary system-length distribution of markovian bulk service queue with modified bulk service rule and dynamic service rates","author":"Singh","year":"2021","journal-title":"Int. J. Comput. Math.: Comput. Syst. Theory"},{"key":"10.1016\/j.peva.2025.102540_b4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1186\/s13677-021-00243-9","article-title":"A novel approach for iot tasks offloading in edge-cloud environments","volume":"10","author":"Almutairi","year":"2021","journal-title":"J. Cloud Comput."},{"key":"10.1016\/j.peva.2025.102540_b5","first-page":"286","article-title":"Survey on task scheduling in cloud computing environment","volume":"vol. 7","author":"Wang","year":"2022"},{"key":"10.1016\/j.peva.2025.102540_b6","doi-asserted-by":"crossref","DOI":"10.1109\/TPDS.2025.3583966","article-title":"Improved methods of task assignment and resource allocation with preemption in edge computing systems","author":"Rublein","year":"2025","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.peva.2025.102540_b7","doi-asserted-by":"crossref","first-page":"7487","DOI":"10.1109\/TVT.2022.3167892","article-title":"A multi-user tasks offloading scheme for integrated edge-fog-cloud computing environments","volume":"71","author":"Okegbile","year":"2022","journal-title":"IEEE Trans. Veh. Technol."},{"key":"10.1016\/j.peva.2025.102540_b8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/TWC.2022.3191287","article-title":"Impatient queuing for intelligent task offloading in multiaccess edge computing","volume":"22","author":"Han","year":"2022","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"10.1016\/j.peva.2025.102540_b9","doi-asserted-by":"crossref","first-page":"5773","DOI":"10.1109\/JIOT.2019.2946426","article-title":"DPTO: A deadline and priority-aware task offloading in fog computing framework leveraging multilevel feedback queueing","volume":"7","author":"Adhikari","year":"2019","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.peva.2025.102540_b10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1186\/s13677-022-00293-7","article-title":"Characterization of task response time in fog enabled networks using queueing theory under different virtualization modes","volume":"11","author":"Mohamed","year":"2022","journal-title":"J. Cloud Comput."},{"key":"10.1016\/j.peva.2025.102540_b11","doi-asserted-by":"crossref","DOI":"10.1109\/TMC.2024.3452502","article-title":"Task offloading via prioritized experience-based double dueling dqn in edge-assisted iiot","author":"Chi","year":"2024","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10.1016\/j.peva.2025.102540_b12","doi-asserted-by":"crossref","first-page":"3027","DOI":"10.1109\/TCC.2023.3251561","article-title":"Joint task offloading and resource allocation for device-edge-cloud collaboration with subtask dependencies","volume":"11","author":"Liu","year":"2023","journal-title":"IEEE Trans. Cloud Comput."},{"key":"10.1016\/j.peva.2025.102540_b13","doi-asserted-by":"crossref","first-page":"186080","DOI":"10.1109\/ACCESS.2020.3029649","article-title":"A survey and taxonomy on task offloading for edge-cloud computing","volume":"8","author":"Wang","year":"2020","journal-title":"IEEE Access"},{"key":"10.1016\/j.peva.2025.102540_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.sysarc.2021.102225","article-title":"A survey on task offloading in multi-access edge computing","volume":"118","author":"Islam","year":"2021","journal-title":"J. Syst. Archit."},{"key":"10.1016\/j.peva.2025.102540_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2021.108177","article-title":"Task offloading in edge and cloud computing: A survey on mathematical, artificial intelligence and control theory solutions","volume":"195","author":"Saeik","year":"2021","journal-title":"Comput. Netw."},{"key":"10.1016\/j.peva.2025.102540_b16","series-title":"First course in bulk queues","author":"Chaudhry","year":"1983"},{"key":"10.1016\/j.peva.2025.102540_b17","series-title":"Stochastic Models in Queueing Theory","author":"Medhi","year":"2002"},{"key":"10.1016\/j.peva.2025.102540_b18","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1111\/j.2517-6161.1961.tb00397.x","article-title":"A bulk-service queueing problem with variable capacity","volume":"23","author":"Jaiswal","year":"1961","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"10.1016\/j.peva.2025.102540_b19","first-page":"207","article-title":"Computational analysis of single-server bulk-service queues, M\/GY\/1","volume":"21","author":"Briere","year":"1989","journal-title":"Adv. in Appl. Probab."},{"key":"10.1016\/j.peva.2025.102540_b20","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1111\/j.2517-6161.1954.tb00149.x","article-title":"On queueing processes with bulk service","volume":"16","author":"Bailey","year":"1954","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"10.1016\/j.peva.2025.102540_b21","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1214\/aoms\/1177698869","article-title":"A general class of bulk queues with Poisson input","volume":"38","author":"Neuts","year":"1967","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/j.peva.2025.102540_b22","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S0004972700007012","article-title":"Some results for the general bulk service queueing system","volume":"23","author":"Holman","year":"1981","journal-title":"Bull. Aust. Math. Soc."},{"key":"10.1016\/j.peva.2025.102540_b23","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/jpr.2017.8","article-title":"Optimal bulking threshold of batch service queues","author":"Zeng","year":"2017","journal-title":"J. Appl. Probab."},{"key":"10.1016\/j.peva.2025.102540_b24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/opre.34.2.267","article-title":"The bulk service queue with a general control strategy: theoretical analysis and a new computational procedure","volume":"34","author":"Powell","year":"1986","journal-title":"Oper. Res."},{"key":"10.1016\/j.peva.2025.102540_b25","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1287\/ijoc.4.3.300","article-title":"Numerical issues in computing steady-state queueing-time distributions of single-server bulk-service queues: M\/gb\/1 and M\/Gd\/1","volume":"4","author":"Chaudhry","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/j.peva.2025.102540_b26","first-page":"46","article-title":"A bulk service queue with accessible and non-accessible batches","volume":"27","author":"Sivasamy","year":"1990","journal-title":"Opsearch"},{"key":"10.1016\/j.peva.2025.102540_b27","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1002\/nav.3800320406","article-title":"An M\/M\/1 queue with a general bulk service rule","volume":"32","author":"Curry","year":"1985","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/j.peva.2025.102540_b28","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.peva.2011.09.002","article-title":"Reducing congestion in bulk-service finite-buffer queueing system using batch-size-dependent service","volume":"69","author":"Banerjee","year":"2012","journal-title":"Perform. Eval."},{"key":"10.1016\/j.peva.2025.102540_b29","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1016\/j.cor.2012.10.009","article-title":"Tail probabilities of the delay in a batch-service queueing model with batch-size dependent service times and a timer mechanism","volume":"40","author":"Claeys","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.peva.2025.102540_b30","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.cie.2014.06.009","article-title":"Analysis of finite-buffer discrete-time batch-service queue with batch-size-dependent service","volume":"75","author":"Banerjee","year":"2014","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.peva.2025.102540_b31","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.peva.2016.12.002","article-title":"Modeling and analysis of an infinite-buffer batch-arrival queue with batch-size-dependent service: MX\/Gn(a,b)\/1","volume":"108","author":"Pradhan","year":"2017","journal-title":"Perform. Eval."},{"key":"10.1016\/j.peva.2025.102540_b32","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s11009-023-09985-2","article-title":"Analysis of a discrete-time queue with modified batch service policy and batch-size-dependent service","volume":"25","author":"Panda","year":"2023","journal-title":"Methodol. Comput. Appl. Probab."},{"key":"10.1016\/j.peva.2025.102540_b33","first-page":"171","article-title":"G\/Ma,b\/1 queues with server vacations","volume":"37","author":"Chol","year":"1994","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"10.1016\/j.peva.2025.102540_b34","series-title":"Linear Algebra and Matrix Theory","author":"Nering","year":"1970"},{"key":"10.1016\/j.peva.2025.102540_b35","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1287\/ijoc.1030.0045","article-title":"An algorithm to compute the waiting time distribution for the m\/g\/1 queue","volume":"16","author":"Shortle","year":"2004","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.peva.2025.102540_b36","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01159395","article-title":"A numerically efficient method for the MAP\/D\/1\/K queue via rational approximations","volume":"22","author":"Akar","year":"1996","journal-title":"Queueing Syst."}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531625000744?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531625000744?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T05:02:56Z","timestamp":1771477376000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166531625000744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":36,"alternative-id":["S0166531625000744"],"URL":"https:\/\/doi.org\/10.1016\/j.peva.2025.102540","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Leveraging task offloading in edge-cloud Computing systems using  queueing model with dynamic service rates","name":"articletitle","label":"Article Title"},{"value":"Performance Evaluation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.peva.2025.102540","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102540"}}