{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T20:34:47Z","timestamp":1718138087127},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005,1]]},"DOI":"10.1007\/s11134-004-5556-6","type":"journal-article","created":{"date-parts":[[2005,2,15]],"date-time":"2005-02-15T11:21:11Z","timestamp":1108466471000},"page":"73-84","source":"Crossref","is-referenced-by-count":3,"title":["Services within a Busy Period of an M\/M\/1 Queue and Dyck Paths"],"prefix":"10.1007","volume":"49","author":[{"given":"Moez","family":"Draief","sequence":"first","affiliation":[]},{"given":"Jean","family":"Mairesse","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Combinatorial Species and Tree-Like Structures","author":"F. Bergeron","year":"1998","unstructured":"F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures (Cambridge Univ. Press, Cambridge, 1998)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.4.6.699","volume":"4","author":"P. Burke","year":"1956","unstructured":"P. Burke, The output of a queueing system, Oper. Res. 4 (1956) 699?704.","journal-title":"Oper. Res."},{"key":"CR3","volume-title":"The Single Server Queue","author":"J.W. Cohen","year":"1982","unstructured":"J.W. Cohen, The Single Server Queue, 2nd ed. (North-Holland, Amsterdam, 1982).","edition":"2"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1239\/aap\/1013540243","volume":"32","author":"P. Flajolet","year":"2000","unstructured":"P. Flajolet and F. Guillemin, The formal theory of birth-and-death processes, lattice path combinatorics, and continued fractions, Adv. in Appl. Probab. 32 (2000) 750?778.","journal-title":"Adv. in Appl. Probab."},{"key":"CR5","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"R. Graham","year":"1994","unstructured":"R. Graham, D. Knuth and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, 2nd ed. (Addison-Wesley, Reading, MA, 1994).","edition":"2"},{"issue":"2?4","key":"CR6","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1023\/A:1019100617896","volume":"29","author":"F. Guillemin","year":"1998","unstructured":"F. Guillemin and D. Pinchon, On the area swept under the occupation process of an M\/M\/1 queue in a busy period, Queueing Systems 29(2?4) (1998) 383?398.","journal-title":"Queueing Systems"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1214\/aoms\/1177706889","volume":"28","author":"E. Reich","year":"1957","unstructured":"E. Reich, Waiting times when queues are in tandem, Ann. Math. Statist. 28 (1957) 527?530.","journal-title":"Ann. Math. Statist."},{"key":"CR8","volume-title":"Math\u00e9matiques & Applications, Vol. 35","author":"P. Robert","year":"2000","unstructured":"P. Robert, R\u00e9seaux et files d?attente: M\u00e9thodes probabilistes, in: Math\u00e9matiques & Applications, Vol. 35 (Springer, Paris, 2000)."},{"key":"CR9","volume-title":"Large Deviations for Performance Analysis. Queues, Communications, and Computing","author":"A. Schwartz","year":"1995","unstructured":"A. Schwartz and A. Weiss, Large Deviations for Performance Analysis. Queues, Communications, and Computing (Chapman & Hall, London, 1995)."},{"key":"CR10","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative Combinatorics, Vol. 2","author":"R. Stanley","year":"1999","unstructured":"R. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge Studies in Advanced Mathematics, Vol. 62 (Cambridge Univ. Press, Cambridge, 1999)."},{"key":"CR11","series-title":"University Texts in the Mathematical Sciences","volume-title":"Introduction to the Theory of Queues","author":"L. Tak\u00e1cs","year":"1962","unstructured":"L. Tak\u00e1cs, Introduction to the Theory of Queues, University Texts in the Mathematical Sciences (Oxford Univ. Press, Oxford, 1962)."},{"key":"CR12","series-title":"Probability and Stochastics Series","first-page":"45","volume-title":"Queueing Methods in the Theory of Random Graphs","author":"L. Tak\u00e1cs","year":"1995","unstructured":"L. Tak\u00e1cs, Queueing Methods in the Theory of Random Graphs, Probability and Stochastics Series (CRC Press, Boca Raton, FL, 1995) 45?78."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-004-5556-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-004-5556-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-004-5556-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:44:35Z","timestamp":1559360675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-004-5556-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["5385556"],"URL":"https:\/\/doi.org\/10.1007\/s11134-004-5556-6","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}