{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T05:51:47Z","timestamp":1747806707007},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1007\/bf01158875","type":"journal-article","created":{"date-parts":[[2005,2,16]],"date-time":"2005-02-16T18:10:46Z","timestamp":1108577446000},"page":"385-411","source":"Crossref","is-referenced-by-count":9,"title":["Blocking probability, throughput and waiting time in finite capacity polling systems"],"prefix":"10.1007","volume":"14","author":[{"given":"D.","family":"Kofman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.2307\/1427754","volume":"23","author":"H. Takagi","year":"1991","unstructured":"H. Takagi, Analysis of finite-capacity polling systems, Adv. Appl. Prob. 23 (1991) 373?387.","journal-title":"Adv. Appl. Prob."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/62058.62059","volume":"20","author":"H. Takagi","year":"1988","unstructured":"H. Takagi, Queueing analysis of polling models, ACM Comp. Surveys 20 (1988) 5?28.","journal-title":"ACM Comp. Surveys"},{"key":"CR3","first-page":"267","volume-title":"Stochastic Analysis of Computer and Communication Systems","author":"H. Takagi","year":"1990","unstructured":"H. Takagi, Queueing analysis of polling models: An update,Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (Elsevier, Amsterdam, 1990) pp. 267?318."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-5316(89)90025-4","volume":"9","author":"T.T. Lee","year":"1989","unstructured":"T.T. Lee, M\/G\/1\/N queue with vacation time and limited service discipline, Performance Evaluation 9 (1989) 181?190.","journal-title":"Performance Evaluation"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1287\/opre.32.4.774","volume":"32","author":"T.T. Lee","year":"1984","unstructured":"T.T. Lee, M\/G\/1\/N queue with vacation time and exhaustive service discipline, Oper. Res. 32 (1984)774?784.","journal-title":"Oper. Res."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01149327","volume":"1","author":"B.T. Doshi","year":"1986","unstructured":"B.T. Doshi, Queueing systems with vacations ? a survey, Queueing Systems 1 (1986) 29?66.","journal-title":"Queueing Systems"},{"key":"CR7","first-page":"217","volume-title":"Stochastic Analysis of Computer and Communication Systems","author":"B.T. Doshi","year":"1990","unstructured":"B.T. Doshi, Single-server queues with vacation,Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (Elsevier, Amsterdam, 1990) pp. 217?265."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/1007771.55599","volume":"16","author":"A. Ganz","year":"1988","unstructured":"A. Ganz and I. Chlamtac, Queueing analysis of finite buffer token networks, Performance Evaluation Rev. 16 (1988) 30?36.","journal-title":"Performance Evaluation Rev."},{"key":"CR9","unstructured":"T. Takine, Y. Takahashi and T. Hasegawa, M\/G\/1\/N queues with vacation and gated k-limited service, Technical report, Department of Appl. Math, and Phys. Kyoto University (1989)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-5316(88)90021-1","volume":"9","author":"P. Tran-Gia","year":"1988","unstructured":"P. Tran-Gia and T. Raith, Performance analysis of finite capacity polling systems with nonexhaustive service, Performance Evaluation 9 (1988) 1?16.","journal-title":"Performance Evaluation"},{"key":"CR11","volume-title":"MAPLE Reference Manual","author":"B.W. Char","year":"1988","unstructured":"B.W. Char, K.O. Geddes, G.H. Gonnet, M.B. Monagan and S.M. Watt,MAPLE Reference Manual, 5th ed., Symbolic Computation Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada (1988).","edition":"5th ed."},{"key":"CR12","first-page":"164","volume-title":"Queueing Systems, Vol. 1 Theory","author":"L. Kleinrock","year":"1975","unstructured":"L. Kleinrock,Queueing Systems, Vol. 1 Theory (Wiley, New York, 1975) pp. 164?172."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01158875.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01158875\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01158875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:17:42Z","timestamp":1556626662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01158875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":12,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF01158875"],"URL":"https:\/\/doi.org\/10.1007\/bf01158875","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}