{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T04:37:01Z","timestamp":1690432621067},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,10,7]],"date-time":"2015-10-07T00:00:00Z","timestamp":1444176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10479-015-2005-3","type":"journal-article","created":{"date-parts":[[2015,10,7]],"date-time":"2015-10-07T14:15:24Z","timestamp":1444227324000},"page":"319-364","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Performance analysis of a multiprogramming\u2013multiprocessor retrial queueing system with orderly reattempts"],"prefix":"10.1007","volume":"247","author":[{"given":"B. Krishna","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Thanikachalam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Kanakasabapathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Rukmani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,7]]},"reference":[{"issue":"4","key":"2005_CR1","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1145\/321784.321788","volume":"20","author":"I Adiri","year":"1973","unstructured":"Adiri, I., Hofri, M., & Yadin, M. (1973). A multiprogramming queue. Journal of ACM, 20(4), 589\u2013603.","journal-title":"Journal of ACM"},{"key":"2005_CR2","volume-title":"Probability, statistics and queuing theory with computer applications","author":"AO Allen","year":"2006","unstructured":"Allen, A. O. (2006). Probability, statistics and queuing theory with computer applications (2nd ed.). New Delhi, India: Academic Press (An imprint of Elsevier).","edition":"2"},{"key":"2005_CR3","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1016\/j.mcm.2004.02.046","volume":"42","author":"B Almasi","year":"2005","unstructured":"Almasi, B., Roszik, J., & Sztrik, J. (2005). Homogeneous finite-source retrial queues with server subject to breakdowns and repairs. Mathematical and Computer Modelling, 42, 673\u2013682.","journal-title":"Mathematical and Computer Modelling"},{"key":"2005_CR4","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1016\/j.mcm.2009.12.011","volume":"51","author":"JR Artalejo","year":"2010","unstructured":"Artalejo, J. R. (2010). Accessible bibliography on retrial queues: Progress in 2000\u20132009. Mathematical and Computer Modelling, 51, 1071\u20131081.","journal-title":"Mathematical and Computer Modelling"},{"key":"2005_CR5","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, J. R., & Gomez-Corral, A. (2008). Retrial queueing systems: A computational approach. Berlin: Springer."},{"key":"2005_CR6","first-page":"1","volume-title":"Advances in algorithmic methods for stochastic models","author":"JR Artalejo","year":"2000","unstructured":"Artalejo, J. R., Gomez-Corral, A., & Neuts, M. F. (2000). Numerical analysis of multiserver retrial queues operating under a full access policy. In G. Lotouche & P. G. Taylor (Eds.), Advances in algorithmic methods for stochastic models (pp. 1\u201319). New Jersey: Notable Publications Inc."},{"key":"2005_CR7","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1016\/S0377-2217(00)00330-1","volume":"135","author":"JR Artalejo","year":"2001","unstructured":"Artalejo, J. R., Gomez-Corral, A., & Neuts, M. F. (2001). Analysis of multiserver queues with constant retrial rate. European Journal of Operational Research, 135, 569\u2013581.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2005_CR8","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1017\/S0021900200116845","volume":"24","author":"B Avi-Itzhak","year":"1987","unstructured":"Avi-Itzhak, B., & Halfin, S. (1987). Server sharing with a limited number of service positions and symmetric queues. Journal of Applied Probability, 24(4), 990\u20131000.","journal-title":"Journal of Applied Probability"},{"issue":"3","key":"2005_CR9","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1017\/S0021900200041292","volume":"25","author":"B Avi-Itzhak","year":"1988","unstructured":"Avi-Itzhak, B., & Halfin, S. (1988). Response times in M\/M\/1 time-sharing schemes with limited number of service positions. Journal of Applied Probability, 25(3), 579\u2013595.","journal-title":"Journal of Applied Probability"},{"key":"2005_CR10","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1287\/opre.21.6.1212","volume":"21","author":"B Avi-Itzhak","year":"1973","unstructured":"Avi-Itzhak, B., & Heyman, D. P. (1973). Approximate queueing models for multiprogramming computer systems. Operations Research, 21, 1212\u20131230.","journal-title":"Operations Research"},{"issue":"8","key":"2005_CR11","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/MCOM.2003.1222715","volume":"41","author":"T Battestilli","year":"2003","unstructured":"Battestilli, T., & Perros, H. (2003). An introduction to optical burst switching. IEEE Communications Magazine, 41(8), 10\u201315.","journal-title":"IEEE Communications Magazine"},{"key":"2005_CR12","volume-title":"Data networks","author":"D Bertsekas","year":"1992","unstructured":"Bertsekas, D., & Gallager, R. (1992). Data networks (2nd ed.). New Jersey: Prentice-Hall International.","edition":"2"},{"key":"2005_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-1-4615-2241-6_2","volume-title":"Computations with Markov Chains","author":"D Bini","year":"1995","unstructured":"Bini, D., & Meini, B. (1995). On cyclic reduction applied to a class of Toeplitz-like matrices arising in queueing problems. In W. J. Stewart (Ed.), Computations with Markov Chains (pp. 21\u201338). Boston: Kluwer."},{"issue":"2","key":"2005_CR14","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1145\/322003.322007","volume":"24","author":"A Brandwajn","year":"1977","unstructured":"Brandwajn, A. (1977). A queueing model of multiprogrammed computer systems under full load conditions. Journal of ACM, 24(2), 222\u2013240.","journal-title":"Journal of ACM"},{"key":"2005_CR15","first-page":"1355","volume":"2","author":"Y Chen","year":"2003","unstructured":"Chen, Y., Wu, H., Xu, D., & Qiao, C. (2003). Performance analysis of optical burst switched node with deflection routing. Proceedings of IEEE ICC 2003, 2, 1355\u20131359.","journal-title":"Proceedings of IEEE ICC 2003"},{"key":"2005_CR16","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF01163860","volume":"11","author":"BD Choi","year":"1992","unstructured":"Choi, B. D., Shin, Y. W., & Ahn, W. C. (1992). Retrial queues with collision arising from unslotted CSMA \/ CD protocol. Queueing Systems, 11, 335\u2013356.","journal-title":"Queueing Systems"},{"issue":"2","key":"2005_CR17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1287\/opre.34.2.281","volume":"34","author":"H Daduna","year":"1986","unstructured":"Daduna, H. (1986). Cycle times in two-stage closed queueing networks: Applications to multiprogrammed computer systems with virtual memory. Operations Research, 34(2), 281\u2013288.","journal-title":"Operations Research"},{"key":"2005_CR18","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1080\/03610926.2011.579376","volume":"42","author":"VI Dragieva","year":"2013","unstructured":"Dragieva, V. I. (2013). A finite source retrial queues: Number of retrials. Communications in Statistics-Theory and Method, 42, 812\u2013829.","journal-title":"Communications in Statistics-Theory and Method"},{"key":"2005_CR19","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1080\/07362990701419946","volume":"25","author":"EH Elhafsi","year":"2007","unstructured":"Elhafsi, E. H., & Molle, M. (2007). On the solution to QBD processes with finite state space. Stochastic Analysis and Applications, 25, 763\u2013779.","journal-title":"Stochastic Analysis and Applications"},{"key":"2005_CR20","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01158472","volume":"7","author":"GI Falin","year":"1990","unstructured":"Falin, G. I. (1990). A survey of retrial queue. Queueing Systems, 7, 127\u2013167.","journal-title":"Queueing Systems"},{"key":"2005_CR21","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0377-2217(97)00170-7","volume":"108","author":"GI Falin","year":"1998","unstructured":"Falin, G. I., & Artalejo, J. R. (1998). A finite source retrial queue. European Journal of Operational Research, 108, 409\u2013424.","journal-title":"European Journal of Operational Research"},{"key":"2005_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-2977-8","volume-title":"Retrial queues","author":"GI Falin","year":"1997","unstructured":"Falin, G. I., & Templeton, J. G. C. (1997). Retrial queues. London: Chapman and Hall."},{"key":"2005_CR23","first-page":"245","volume-title":"Teletraffic analysis and computer performance evaluation","author":"G Fayolle","year":"1986","unstructured":"Fayolle, G. (1986). A simple telephone exchange with delayed feedbacks. In O. J. Boxma, J. W. Cohen, & H. C. Tijms (Eds.), Teletraffic analysis and computer performance evaluation (Vol. 7, pp. 245\u2013253). Amsterdam: Elsevier."},{"issue":"3","key":"2005_CR24","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/321406.321407","volume":"14","author":"DP Gaver","year":"1967","unstructured":"Gaver, D. P. (1967). Probability models for multiprogramming computer systems. Journal of ACM, 14(3), 423\u2013438.","journal-title":"Journal of ACM"},{"key":"2005_CR25","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF00265765","volume":"7","author":"DP Gaver","year":"1976","unstructured":"Gaver, D. P., & Humfeld, G. (1976). Multitype multiprogramming models. Acta Informatica, 7, 111\u2013121.","journal-title":"Acta Informatica"},{"issue":"2","key":"2005_CR26","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1287\/opre.21.2.569","volume":"21","author":"DP Gaver","year":"1973","unstructured":"Gaver, D. P., & Shedler, G. S. (1973). Processor utilization in multiprogramming systems via diffusion approximations. Operations Research, 21(2), 569\u2013576.","journal-title":"Operations Research"},{"key":"2005_CR27","doi-asserted-by":"crossref","DOI":"10.1142\/p643","volume-title":"Analysis and synthesis of computer systems","author":"E Gelenbe","year":"2010","unstructured":"Gelenbe, E., & Mitrani, I. (2010). Analysis and synthesis of computer systems (2nd ed.). London: Imperial College Press.","edition":"2"},{"issue":"2","key":"2005_CR28","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF00975883","volume":"7","author":"M Hofri","year":"1978","unstructured":"Hofri, M. (1978). A generating-function analysis of multiprogramming queues. International Journal of Computer Information Sciences, 7(2), 121\u2013155.","journal-title":"International Journal of Computer Information Sciences"},{"issue":"1","key":"2005_CR29","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/6306.6310","volume":"4","author":"H Kameda","year":"1986","unstructured":"Kameda, H. (1986). Effects of job loading policies for multiprogramming systems in processing a job stream. ACM Transactions on Computer Systems, 4(1), 71\u2013106.","journal-title":"ACM Transactions on Computer Systems"},{"issue":"2","key":"2005_CR30","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1145\/321941.321952","volume":"23","author":"AG Konheim","year":"1976","unstructured":"Konheim, A. G., & Reiser, M. (1976). A Queuing model with finite waiting room and blocking. Journal of ACM, 23(2), 328\u2013341.","journal-title":"Journal of ACM"},{"issue":"2","key":"2005_CR31","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0207019","volume":"7","author":"AG Konheim","year":"1978","unstructured":"Konheim, A. G., & Reiser, M. (1978). Finite capacity queuing systems with applications in computer modeling. SIAM Journal of Computing, 7(2), 210\u2013229.","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"2005_CR32","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10479-006-5300-1","volume":"141","author":"B Krishna Kumar","year":"2006","unstructured":"Krishna Kumar, B., & Raja, J. (2006). On multiserver feedback retrial queues with balking and control retrial rate. Annals of Operations Research, 141(1), 211\u2013232.","journal-title":"Annals of Operations Research"},{"key":"2005_CR33","first-page":"19","volume-title":"Frontiers in queueing: Models and applications in science and engineering","author":"VG Kulkarni","year":"1997","unstructured":"Kulkarni, V. G., & Liang, H. M. (1997). Retrial queues revisited. In J. H. Dshalalow (Ed.), Frontiers in queueing: Models and applications in science and engineering (pp. 19\u201334). New York, Boca Raton: CRC Press."},{"issue":"4","key":"2005_CR34","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1145\/322276.322279","volume":"28","author":"G Latouche","year":"1981","unstructured":"Latouche, G. (1981). Algorithmic analysis of a multiprogramming-multiprocessor computer system. Journal of ACM, 28(4), 662\u2013679.","journal-title":"Journal of ACM"},{"key":"2005_CR35","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719734","volume-title":"Introduction to matrix analytic method in stochastic modelling","author":"G Latouche","year":"1999","unstructured":"Latouche, G., & Ramaswami, V. (1999). Introduction to matrix analytic method in stochastic modelling. Philadelphia: ASA-SIAM."},{"issue":"2","key":"2005_CR36","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/321637.321642","volume":"18","author":"PVW Lewis","year":"1971","unstructured":"Lewis, P. V. W., & Shedler, G. S. (1971). A cycle-queue model of system overhead in multiprogrammed computer systems. Journal of ACM, 18(2), 199\u2013220.","journal-title":"Journal of ACM"},{"key":"2005_CR37","volume-title":"Matrix-geometric solutions in stochastic models: An algorithmic approach","author":"MF Neuts","year":"1981","unstructured":"Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models: An algorithmic approach. Baltimore: John Hopkins University Press."},{"key":"2005_CR38","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1080\/15326349808807463","volume":"14","author":"MF Ramalhoto","year":"1998","unstructured":"Ramalhoto, M. F., & Gomez-Corral, A. (1998). Some decomposition formulae for M\/M\/r\/r+d queues with constant retrial rate. Stochastic Models, 14, 123\u2013145.","journal-title":"Stochastic Models"},{"key":"2005_CR39","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1002\/j.1538-7305.1985.tb00456.x","volume":"64","author":"KM Rege","year":"1985","unstructured":"Rege, K. M., & Sengupta, B. (1985). Sojourn time distribution in a multiprogrammed computer system. AT & T Tech Journal, 64, 1077\u20131090.","journal-title":"AT & T Tech Journal"},{"issue":"6","key":"2005_CR40","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/65.885670","volume":"14","author":"S Verma","year":"2000","unstructured":"Verma, S., Chaskar, H., & Ravikanth, R. (2000). Optical burst switching: A viable solution for terabit IP backbone. IEEE Network, 14(6), 48\u201353.","journal-title":"IEEE Network"},{"key":"2005_CR41","doi-asserted-by":"crossref","first-page":"2817","DOI":"10.1109\/JLT.2009.2017211","volume":"27","author":"EWM Wong","year":"2009","unstructured":"Wong, E. W. M., Andrew, L. L. H., Cui, T., Moran, B., Zalesky, A., Tucker, R. S., et al. (2009). Towards a buffer less optical internet. Journal of Lightwave Technology, 27, 2817\u20132833.","journal-title":"Journal of Lightwave Technology"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2005-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2005-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2005-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2005-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:10:03Z","timestamp":1559153403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2005-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,7]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["2005"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2005-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,7]]}}}