{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T20:46:43Z","timestamp":1777063603019,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T00:00:00Z","timestamp":1657670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T00:00:00Z","timestamp":1657670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007065","name":"Universit\u00e0 degli Studi di Salerno","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007065","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A priority queueing model with many types of requests and restricted processor sharing is considered. A novel discipline of requests admission and service is proposed. This discipline assumes restriction of the bandwidth (capacity) of the server and the number of requests that can receive service in the system at the same time. This discipline is some kind of realistic hybrid of the traditional discipline of service in a multi-server system and the discipline of the limited processor sharing. The requests of the highest priority can push out from the service the low priority requests. Therefore, the important problem is fitting of the number of requests that can receive service at the same time to the bandwidth of the server. This problem is solved via construction and analysis of a multi-dimensional Markov chain describing operation of the system under any fixed set of the system parameters.<\/jats:p>","DOI":"10.1007\/s12652-022-04233-w","type":"journal-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T22:04:56Z","timestamp":1657749896000},"page":"12651-12662","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Priority queueing system with many types of requests and restricted processor sharing"],"prefix":"10.1007","volume":"14","author":[{"given":"Ciro","family":"D\u2019Apice","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Dudin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Dudin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3891-1825","authenticated-orcid":false,"given":"Rosanna","family":"Manzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"4233_CR1","doi-asserted-by":"crossref","unstructured":"Alencar M, Yashina M, Tatashev A (2021) Loss queueing systems with limited processor sharing and applications to communication network. In: Paper presented at the 2021 international conference on engineering management of communication and technology, EMCTECH, Vienna, Austria, 20\u201322 October 2021","DOI":"10.1109\/EMCTECH53459.2021.9618978"},{"issue":"1","key":"4233_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s11134-006-7586-8","volume":"53","author":"E Altman","year":"2006","unstructured":"Altman E, Avrachenkov K, Ayesta U (2006) A survey on discriminatory processor sharing. Queueing Syst 53(1):53\u201363","journal-title":"Queueing Syst"},{"key":"4233_CR3","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1016\/j.procs.2010.04.175","volume":"1","author":"H Baumann","year":"2010","unstructured":"Baumann H, Sandmann W (2010) Numerical solution of level dependent quasi-birth-and-death processes. Procedia Comput Sci 1:1561\u20131569","journal-title":"Procedia Comput Sci"},{"issue":"1","key":"4233_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1134\/S0005117907010080","volume":"68","author":"PP Bocharov","year":"2007","unstructured":"Bocharov PP, D\u2019Apice C, Manzo R, Pechinkin AV (2007) Analysis of the multi-server markov queuing system with unlimited buffer and negative customers. Autom Remote Control 68(1):85\u201394","journal-title":"Autom Remote Control"},{"key":"4233_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apm.2017.05.019","volume":"50","author":"A Brugno","year":"2017","unstructured":"Brugno A, Dudin AN, Manzo R (2017) Retrial queue with discipline of adaptive permanent pooling. Appl Math Model 50:1\u201316","journal-title":"Appl Math Model"},{"issue":"1","key":"4233_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s12652-016-0419-7","volume":"9","author":"A Brugno","year":"2018","unstructured":"Brugno A, Dudin AN, Manzo R (2018) Analysis of a strategy of adaptive group admission of customers to single server retrial system. J Ambient Intell Humaniz Comput 9(1):123\u2013135","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"4233_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-022-03857-2","author":"G Chen","year":"2022","unstructured":"Chen G, Xia L, Jiang Z, Peng X, Xu H (2022) A two-class map\/ph\/1 weighted fair queueing system and its application to telecommunications. J Ambient Intell Humaniz Comput. https:\/\/doi.org\/10.1007\/s12652-022-03857-2","journal-title":"J Ambient Intell Humaniz Comput"},{"issue":"6","key":"4233_CR8","doi-asserted-by":"publisher","first-page":"2591","DOI":"10.1007\/s12652-019-01318-x","volume":"11","author":"MP D\u2019Arienzo","year":"2020","unstructured":"D\u2019Arienzo MP, Dudin AN, Dudin SA, Manzo R (2020) Analysis of a retrial queue with group service of impatient customers. J Ambient Intell Humaniz Comput 11(6):2591\u20139","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"4233_CR9","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10479-014-1626-2","volume":"239","author":"A Dudin","year":"2016","unstructured":"Dudin A, Kim CS, Dudina O, Dudin S (2016) Queueing system with generalized phase type service time distribution. Ann Oper Res 239:401\u2013428","journal-title":"Ann Oper Res"},{"key":"4233_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-319-61382-6_4","volume":"10372","author":"S Dudin","year":"2017","unstructured":"Dudin S, Dudin A, Dudina O, Samouylov K (2017) Analysis of a retrial queue with limited processor sharing operating in the random environment. Lect Notes Comput Sci 10372:38\u201349","journal-title":"Lect Notes Comput Sci"},{"key":"4233_CR11","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2021.2009827","author":"AN Dudin","year":"2021","unstructured":"Dudin AN, Dudina OS, Dudin SA, Kostyukova OI (2021) Optimization of road design via the use of a queueing model with transit and local users and processor sharing disciplines. Optimization. https:\/\/doi.org\/10.1080\/02331934.2021.2009827","journal-title":"Optimization"},{"issue":"4","key":"4233_CR12","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1109\/LWC.2019.2961354","volume":"9","author":"AT El-Toukhy","year":"2019","unstructured":"El-Toukhy AT, Arslan H (2019) Enhancing the performance of low priority sus using reserved channels in CRN. IEEE Wirel Commun Lett 9(4):513\u2013517","journal-title":"IEEE Wirel Commun Lett"},{"key":"4233_CR13","first-page":"375","volume-title":"International conference on optimization and decision science","author":"M de Falco","year":"2017","unstructured":"de Falco M, Mastrandrea N, Rarit\u00e0 L (2017) A queueing networks-based model for supply systems. International conference on optimization and decision science. Springer, New York, pp 375\u2013383"},{"key":"4233_CR14","unstructured":"Gaeta M, Rarit\u00e0 L (2013) A stochastic approach for supply systems. In Proceeding of 25th European modeling and simulation symposium, pp 401\u2013409"},{"key":"4233_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2016.10.001","volume":"79","author":"A Ghosh","year":"2017","unstructured":"Ghosh A, Banik A (2017) An algorithmic analysis of the BMAP\/MSP\/1 generalized processor-sharing queue. Comput Oper Res 79:1\u201311","journal-title":"Comput Oper Res"},{"key":"4233_CR16","doi-asserted-by":"publisher","first-page":"2429","DOI":"10.1007\/s12652-021-03442-z","volume":"13","author":"S Goel","year":"2022","unstructured":"Goel S, Kulshrestha R (2022) Queueing based spectrum management in cognitive radio networks with retrial and heterogeneous service classes. J Ambient Intell Humaniz Comput 13:2429\u20132437","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"4233_CR17","volume-title":"Kronecker products and matrix calculus with applications","author":"A Graham","year":"2018","unstructured":"Graham A (2018) Kronecker products and matrix calculus with applications. Courier Dover Publications, New York"},{"issue":"2","key":"4233_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/stsy.2021.0087","volume":"12","author":"V Gupta","year":"2022","unstructured":"Gupta V, Zhang J (2022) Approximations and optimal control for state-dependent limited processor sharing queues. Stochastic Systems 12(2):205\u2013225","journal-title":"Stochastic Systems"},{"key":"4233_CR19","doi-asserted-by":"publisher","first-page":"567","DOI":"10.2307\/1428072","volume":"28","author":"QM He","year":"1996","unstructured":"He QM (1996) Queues with marked customers. Adv Appl Probab 28:567\u2013587","journal-title":"Adv Appl Probab"},{"key":"4233_CR20","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1016\/j.apm.2012.03.021","volume":"37","author":"CS Kim","year":"2013","unstructured":"Kim CS, Dudin SA, Taramin OS, Baek J (2013) Queueing system MAP\/PH\/N\/N+R with impatient heterogeneous customers as a model of call center. Appl Math Model 37:958\u2013976","journal-title":"Appl Math Model"},{"issue":"2","key":"4233_CR21","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1109\/TWC.2019.2948166","volume":"19","author":"C Kim","year":"2019","unstructured":"Kim C, Dudin SA, Dudina OS, Dudin AN (2019) Mathematical models for the operation of a cell with bandwidth sharing and moving users. IEEE Trans Wirel Commun 19(2):744\u2013755","journal-title":"IEEE Trans Wirel Commun"},{"key":"4233_CR22","doi-asserted-by":"publisher","first-page":"106933","DOI":"10.1109\/ACCESS.2021.3100561","volume":"9","author":"C Kim","year":"2021","unstructured":"Kim C, Dudin A, Dudin S, Dudina O (2021) Mathematical model of operation of a cell of a mobile communication network with adaptive modulation schemes and handover of mobile users. IEEE Access 9:106933\u2013106946","journal-title":"IEEE Access"},{"key":"4233_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-022-03903-z","author":"S Lee","year":"2022","unstructured":"Lee S, Dudin A, Dudina O, Kim C (2022) Analysis of a priority queueing system with the enhanced fairness of servers scheduling. J Ambient Intell Humaniz Comput. https:\/\/doi.org\/10.1007\/s12652-022-03903-z","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"4233_CR24","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0167-6377(03)00028-2","volume":"31","author":"H Masuyama","year":"2003","unstructured":"Masuyama H, Takine T (2003) Sojourn time distribution in a MAP\/M\/1 processor-sharing queue. Oper Res Lett 31:406\u2013412","journal-title":"Oper Res Lett"},{"issue":"11","key":"4233_CR25","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1016\/j.peva.2010.08.012","volume":"67","author":"J Nair","year":"2010","unstructured":"Nair J, Wierman A, Zwart B (2010) Tail-robust scheduling via limited processor sharing. Perform Eval 67(11):978\u2013995","journal-title":"Perform Eval"},{"key":"4233_CR26","volume-title":"Matrix-geometric solutions in stochastic models","author":"M Neuts","year":"1981","unstructured":"Neuts M (1981) Matrix-geometric solutions in stochastic models. The Johns Hopkins University Press, Baltimore"},{"key":"4233_CR27","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1080\/15326348508807020","volume":"1","author":"V Ramaswami","year":"1985","unstructured":"Ramaswami V, Lucantoni DN (1985) Algorithms for the multi-server queue with phase-type service. Commun Stat Stochastic Models 1:393\u2013417","journal-title":"Commun Stat Stochastic Models"},{"key":"4233_CR28","first-page":"406","volume":"678","author":"KE Samouylov","year":"2016","unstructured":"Samouylov KE, Sopin ES, Gudkova I (2016) Sojourn time analysis for processor sharing loss queuing system with service interruptions and MAP arrivals. Commun Comput Inf Sci 678:406\u2013417","journal-title":"Commun Comput Inf Sci"},{"key":"4233_CR29","first-page":"1","volume":"178108","author":"B Sun","year":"2014","unstructured":"Sun B, Lee MH, Dudin SA, Dudin AN (2014a) Analysis of multiserver queueing system with opportunistic occupation and reservation of servers. Math Prob Eng ID 178108:1\u201313","journal-title":"Math Prob Eng ID"},{"key":"4233_CR30","first-page":"1","volume":"813150","author":"B Sun","year":"2014","unstructured":"Sun B, Lee MH, Dudin SA, Dudin AN (2014b) $${MAP}+{MAP}\/{M}_2\/{N}\/\\infty$$ queueing system with absolute priority and reservation of servers. Math Prob Eng ID 813150:1\u201315","journal-title":"Math Prob Eng ID"},{"issue":"3","key":"4233_CR31","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/3199524.3199548","volume":"45","author":"M Telek","year":"2018","unstructured":"Telek M, Van Houdt B (2018) Response time distribution of a class of limited processor sharing queues. ACM SIGMETRICS Perform Eval Rev 45(3):143\u2013155","journal-title":"ACM SIGMETRICS Perform Eval Rev"},{"issue":"1","key":"4233_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01182931","volume":"2","author":"SF Yashkov","year":"1987","unstructured":"Yashkov SF (1987) Processor-sharing queues: some progress in analysis. Queueing Syst 2(1):1\u201317","journal-title":"Queueing Syst"},{"key":"4233_CR33","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1134\/S0005117907090202","volume":"68","author":"SF Yashkov","year":"2007","unstructured":"Yashkov SF, Yashkova AS (2007) Processor sharing. Autom Remote Control 68:1662\u20131731","journal-title":"Autom Remote Control"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-022-04233-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12652-022-04233-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-022-04233-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T16:32:22Z","timestamp":1690216342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12652-022-04233-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,13]]},"references-count":33,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["4233"],"URL":"https:\/\/doi.org\/10.1007\/s12652-022-04233-w","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,13]]},"assertion":[{"value":"14 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2022","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 have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}