{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:13:25Z","timestamp":1740158005779,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,10,13]],"date-time":"2016-10-13T00:00:00Z","timestamp":1476316800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s12652-016-0419-7","type":"journal-article","created":{"date-parts":[[2016,10,13]],"date-time":"2016-10-13T04:24:36Z","timestamp":1476332676000},"page":"123-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Analysis of a strategy of adaptive group admission of customers to single server retrial system"],"prefix":"10.1007","volume":"9","author":[{"given":"A.","family":"Brugno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. N.","family":"Dudin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3891-1825","authenticated-orcid":false,"given":"R.","family":"Manzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,13]]},"reference":[{"key":"419_CR1","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1016\/j.mcm.2009.12.011","volume":"51","author":"JR Artalejo","year":"2010","unstructured":"Artalejo JR (2010) Accessible bibliography on retrial queues: progress in 2000\u20132009. Math Comput Model 51:1071\u20131081","journal-title":"Math Comput Model"},{"key":"419_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-78725-9","volume-title":"Retrial queueing systems: a computational approach","author":"JR Artalejo","year":"2008","unstructured":"Artalejo JR, Gomez-Corral A (2008) Retrial queueing systems: a computational approach. Springer, Berlin"},{"key":"419_CR3","volume-title":"Applied probability and queues","author":"S Asmussen","year":"2003","unstructured":"Asmussen S (2003) Applied probability and queues. Springer, New York"},{"key":"419_CR4","doi-asserted-by":"crossref","first-page":"5606","DOI":"10.1007\/s10958-005-0432-4","volume":"131","author":"PP Bocharov","year":"2005","unstructured":"Bocharov PP, Manzo R, Pechinkin AV (2005) Analysis of a two-phase queueing system with a Markov arrival process and losses. Stability Problems for Stochastic Models. J Math Sci 131:5606\u20135613","journal-title":"J Math Sci"},{"key":"419_CR5","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1007\/s10958-006-0002-4","volume":"132","author":"PP Bocharov","year":"2006","unstructured":"Bocharov PP, Manzo R, Pechinkin AV (2006) Two-phase queueing system with a Markov arrival process and blocking. Stability problems for stochastic models. J Math Sci 132:578\u2013589","journal-title":"J Math Sci"},{"key":"419_CR6","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1023\/A:1015041602946","volume":"40","author":"L Breuer","year":"2002","unstructured":"Breuer L, Dudin AN, Klimenok VI (2002) A retrial $$BMAP\/PH\/N$$ B M A P \/ P H \/ N system. Queueing Syst 40:433\u2013457","journal-title":"Queueing Syst"},{"key":"419_CR7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/ett.1000","volume":"16","author":"L Breuer","year":"2005","unstructured":"Breuer L, Klimenok VI, Birukov AA, Dudin AN, Krieger U (2005) Modeling the access to a wireless network at hot spots. Eur Trans Telecommun 16:309\u2013316","journal-title":"Eur Trans Telecommun"},{"key":"419_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/1520-6750(199204)39:3<345::AID-NAV3220390305>3.0.CO;2-V","volume":"39","author":"SR Chakravarthy","year":"1992","unstructured":"Chakravarthy SR (1992) A finite capacity $$GI\/PH\/1$$ G I \/ P H \/ 1 queue with group services. Naval Res Logist Quart 39:345\u2013357","journal-title":"Naval Res Logist Quart"},{"key":"419_CR9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/(SICI)1099-0747(199609)12:3<179::AID-ASM282>3.0.CO;2-U","volume":"12","author":"SR Chakravarthy","year":"1996","unstructured":"Chakravarthy SR (1996) Analysis of the $$MAP\/PH\/1\/K$$ M A P \/ P H \/ 1 \/ K queue with service control. Appl Stoch Models Data Anal 12:179\u2013191","journal-title":"Appl Stoch Models Data Anal"},{"key":"419_CR10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/15326349808807459","volume":"14","author":"SR Chakravarthy","year":"1998","unstructured":"Chakravarthy SR (1998) Analysis of a priority polling system with group services. Commun Stat Stoch Models 14:25\u201349","journal-title":"Commun Stat Stoch Models"},{"unstructured":"Chakravarthy SR (2001) The batch Markovian arrival process: a review and future work. In: Raju N, Ramaswami V (eds) Krishnamoorthy A. Notable Publications Inc., Advances in Probability Theory and Stochastic Processes, pp 21\u201329","key":"419_CR11"},{"key":"419_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1155\/S1048953394000171","volume":"7","author":"SR Chakravarthy","year":"1994","unstructured":"Chakravarthy SR, Alfa AS (1994) A finite capacity queue with Markovian arrivals and two servers with group services. J Appl Math Stoch Anal 7:161\u2013178","journal-title":"J Appl Math Stoch Anal"},{"key":"419_CR13","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1287\/ijoc.9.3.276","volume":"9","author":"SR Chakravarthy","year":"1997","unstructured":"Chakravarthy SR, Bin L (1997) A finite capacity queue with nonrenewal input and exponential dynamic group services. INFORMS J Comput 9:276\u2013287","journal-title":"INFORMS J Comput"},{"key":"419_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1019989127190","volume":"42","author":"SR Chakravarthy","year":"2002","unstructured":"Chakravarthy SR, Dudin AN (2002) A multiserver retrial queue with $$BMAP$$ B M A P arrivals and group services. Queueing Syst 42:5\u201331","journal-title":"Queueing Syst"},{"key":"419_CR15","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1134\/S0005117906030076","volume":"67","author":"C D\u2019Apice","year":"2006","unstructured":"D\u2019Apice C, Manzo R (2006) A finite capacity $$BMAP_{K}\/G_{K}\/1$$ B M A P K \/ G K \/ 1 queue with the generalized foreground-background processor-sharing discipline. Autom Remote Control 67:428\u2013434","journal-title":"Autom Remote Control"},{"key":"419_CR16","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1023\/B:AURC.0000047893.33693.d5","volume":"65","author":"C D\u2019Apice","year":"2004","unstructured":"D\u2019Apice C, Manzo R, Pechinkin AV (2004) A finite $$MAP_{K}\/G_{K}\/1$$ M A P K \/ G K \/ 1 queueing system with generalized foreground-background processor-sharing discipline. Autom Remote Control 65:1793\u20131799","journal-title":"Autom Remote Control"},{"key":"419_CR17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01149327","volume":"1","author":"BT Doshi","year":"1986","unstructured":"Doshi BT (1986) Queueing systems with vacations\u2014a survey. Queueing Syst 1:29\u201366","journal-title":"Queueing Syst"},{"key":"419_CR18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0895-7177(99)00136-3","volume":"30","author":"AN Dudin","year":"1999","unstructured":"Dudin AN, Klimenok V (1999) Queueing system $$BMAP\/G\/1$$ B M A P \/ G \/ 1 with repeated calls. Math Comput Model 30:115\u2013128","journal-title":"Math Comput Model"},{"key":"419_CR19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/A:1019196701000","volume":"34","author":"AN Dudin","year":"2000","unstructured":"Dudin AN, Klimenok V (2000) A retrial $$BMAP\/SM\/1$$ B M A P \/ S M \/ 1 system with linear repeated requests. Queueing Syst 34:47\u201366","journal-title":"Queueing Syst"},{"key":"419_CR20","doi-asserted-by":"crossref","first-page":"8999","DOI":"10.1016\/j.cor.2015.03.008","volume":"61","author":"AN Dudin","year":"2015","unstructured":"Dudin AN, Manzo R, Piscopo R (2015) Single server retrial queue with group admission of customers. Comput Oper Res 61:8999","journal-title":"Comput Oper Res"},{"key":"419_CR21","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.cie.2013.06.020","volume":"66","author":"O Dudina","year":"2013","unstructured":"Dudina O, Kim CS, Dudin S (2013) Retrial queueing system with Markovian arrival flow and phase type service time distribution. Comput Ind Eng 66:360\u2013373","journal-title":"Comput Ind Eng"},{"doi-asserted-by":"crossref","unstructured":"Falin GI (1990) A survey of retrial queues. Queueing Systems, Theory and Applications 7:127\u2013168","key":"419_CR22","DOI":"10.1007\/BF01158472"},{"doi-asserted-by":"crossref","unstructured":"Falin GI, Templeton JGC (1997) Retrial Queues (Series: Monographs on Statistics and Applied Probability), Chapman & Hall","key":"419_CR23","DOI":"10.1007\/978-1-4899-2977-8"},{"key":"419_CR24","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/TNET.2003.820252","volume":"11","author":"DP Heyman","year":"2003","unstructured":"Heyman DP, Lucantoni D (2003) Modelling multiple IP traffic streams with rate limits. IEEE\/ACM Trans Netw 11:948\u2013958","journal-title":"IEEE\/ACM Trans Netw"},{"key":"419_CR25","volume-title":"Denumerable Markov Chains","author":"JG Kemeni","year":"1966","unstructured":"Kemeni JG, Snell JL, Knapp AW (1966) Denumerable Markov Chains. Van Nostrand, New York"},{"key":"419_CR26","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.cor.2013.09.005","volume":"43","author":"CS Kim","year":"2014","unstructured":"Kim CS, Klimenok V, Dudin AN (2014) Optimization of guard channel policy in cellular mobile networks with account of retrials. Comput Oper Res 43:181\u2013190","journal-title":"Comput Oper Res"},{"key":"419_CR27","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1016\/j.cor.2009.09.008","volume":"37","author":"CS Kim","year":"2010","unstructured":"Kim CS, Klimenok V, Mushko V, Dudin AN (2010) The $$BMAP\/PH\/N$$ B M A P \/ P H \/ N retrial queueing system operating in Markovian random environment. Comput Oper Res 37:1228\u20131237","journal-title":"Comput Oper Res"},{"key":"419_CR28","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10479-012-1254-7","volume":"201","author":"CS Kim","year":"2012","unstructured":"Kim CS, Mushko VV, Dudin AN (2012) Computation of the steady state distribution for multi-server retrial queues with phase type service process. Ann Oper Res 201:307\u2013323","journal-title":"Ann Oper Res"},{"key":"419_CR29","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0166-5316(03)00067-1","volume":"54","author":"A Klemm","year":"2003","unstructured":"Klemm A, Lindermann C, Lohmann M (2003) Modelling IP traffic using the batch Markovian arrival process. Perform Eval 54:149\u2013173","journal-title":"Perform Eval"},{"key":"419_CR30","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s11134-006-0300-z","volume":"54","author":"VI Klimenok","year":"2006","unstructured":"Klimenok VI, Dudin AN (2006) Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queueing Syst 54:245\u2013259","journal-title":"Queueing Syst"},{"key":"419_CR31","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1142\/S0217595907001310","volume":"24","author":"VI Klimenok","year":"2007","unstructured":"Klimenok VI, Orlovsky DS, Dudin AN (2007) A $$BMAP\/PH\/N$$ B M A P \/ P H \/ N system with impatient repeated calls. Asia Pac J Oper Res 24:293\u2013312","journal-title":"Asia Pac J Oper Res"},{"key":"419_CR32","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1016\/j.ejor.2007.02.053","volume":"189","author":"VI Klimenok","year":"2008","unstructured":"Klimenok VI, Orlovsky DS, Kim CS (2008) The $$BMAP\/PH\/N$$ B M A P \/ P H \/ N retrial queue with Markovian flow of breakdowns. Eur J Oper Res 189:1057\u20131072","journal-title":"Eur J Oper Res"},{"key":"419_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/15326349108807174","volume":"7","author":"D Lucantoni","year":"1991","unstructured":"Lucantoni D (1991) New results on the single server queue with a batch Markovian arrival process. Commun Stat Stoch Models 7:1\u201346","journal-title":"Commun Stat Stoch Models"},{"key":"419_CR34","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":"419_CR35","volume-title":"Structured stochastic matrices of $$M\/G\/1$$ M \/","author":"M Neuts","year":"1989","unstructured":"Neuts M (1989) Structured stochastic matrices of $$M\/G\/1$$ M \/ G \/ 1 type and their applications. Marcel Dekker, New York"},{"unstructured":"Takagi H (1991) Queueing analysis: a foundation of performance evaluation. North-Holland","key":"419_CR36"},{"key":"419_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-33723-4","volume-title":"Vacation queueing models\u2014theory and applications","author":"N Tian","year":"2006","unstructured":"Tian N, Zhang ZG (2006) Vacation queueing models\u2014theory and applications. Springer, Heidelberg"},{"key":"419_CR38","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01158899","volume":"2","author":"T Yang","year":"1987","unstructured":"Yang T, Templeton JGC (1987) A survey on retrial queues. Queueing Syst 2:201\u2013233","journal-title":"Queueing Syst"},{"unstructured":"Ye Q (2000) High accuracy algorithms for solving nonlinear matrix equations in queueing models. In: Latouche G, Taylor PG (eds) Advances in Algorithmic Methods for Stochastic Models, Proceedings of the 3rd International Conference on Matrix Analytic Methods. Notable Publications, New Jersey, pp 401\u2013415","key":"419_CR39"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-016-0419-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-016-0419-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-016-0419-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T10:53:25Z","timestamp":1568458405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-016-0419-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,13]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["419"],"URL":"https:\/\/doi.org\/10.1007\/s12652-016-0419-7","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"type":"print","value":"1868-5137"},{"type":"electronic","value":"1868-5145"}],"subject":[],"published":{"date-parts":[[2016,10,13]]}}}