{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:22Z","timestamp":1772163922155,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T00:00:00Z","timestamp":1151280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,6,26]]},"DOI":"10.1145\/1140277.1140299","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T12:53:01Z","timestamp":1153745581000},"page":"181-190","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Transient analysis of tree-Like processes and its application to random access systems"],"prefix":"10.1145","author":[{"given":"J.","family":"Van Velthoven","sequence":"first","affiliation":[{"name":"University of Antwerp, Antwerp, Belgium"}]},{"given":"B.","family":"Van Houdt","sequence":"additional","affiliation":[{"name":"University of Antwerp, Antwerp, Belgium"}]},{"given":"C.","family":"Blondia","sequence":"additional","affiliation":[{"name":"University of Antwerp, Antwerp, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2006,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2002.1002507"},{"key":"e_1_3_2_1_2_1","first-page":"419","article-title":"Fitting phase-type distributions via the EM algorithm","volume":"23","author":"Asmussen S.","year":"1996","unstructured":"S. Asmussen , O. Nerman , and M. Olsson . Fitting phase-type distributions via the EM algorithm . Scandinavian Journal of Statistics , 23 : 419 -- 441 , 1996 . S. Asmussen, O. Nerman, and M. Olsson. Fitting phase-type distributions via the EM algorithm. Scandinavian Journal of Statistics, 23:419--441, 1996.","journal-title":"Scandinavian Journal of Statistics"},{"key":"e_1_3_2_1_3_1","volume-title":"Data Networks","author":"Bertsekas D.","year":"1992","unstructured":"D. Bertsekas and R. Gallager . Data Networks . Prentice-Hall Int., Inc. , 1992 . D. Bertsekas and R. Gallager. Data Networks. Prentice-Hall Int., Inc., 1992."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(02)00593-1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198527688.001.0001","volume-title":"Numerical methods for structured Markov chains","author":"Bini D. A.","year":"2005","unstructured":"D. A. Bini , G. Latouche , and B. Meini . Numerical methods for structured Markov chains . Oxford University Press , 2005 . D. A. Bini, G. Latouche, and B. Meini. Numerical methods for structured Markov chains. Oxford University Press, 2005."},{"key":"e_1_3_2_1_6_1","volume-title":"A discrete-time batch markovian arrival process as B-ISDN traffic model. Belgian Journal of Operations Research, Statistics and Computer Science, 32(3,4):3--23","author":"Blondia C.","year":"1993","unstructured":"C. Blondia . A discrete-time batch markovian arrival process as B-ISDN traffic model. Belgian Journal of Operations Research, Statistics and Computer Science, 32(3,4):3--23 , 1993 . C. Blondia. A discrete-time batch markovian arrival process as B-ISDN traffic model. Belgian Journal of Operations Research, Statistics and Computer Science, 32(3,4):3--23, 1993."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(03)00044-0"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(03)00061-0"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057014"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.1999.5340508"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019140332008"},{"key":"e_1_3_2_1_14_1","first-page":"167","volume-title":"Proc. of the 3rd Int. Conf. on Matrix Analytic Methods","author":"He Q.","year":"2000","unstructured":"Q. He and A.S. Alfa . The discrete time MMAP{K}\/PH{K}\/1\/LCFS-GPR queue and its variants . In Proc. of the 3rd Int. Conf. on Matrix Analytic Methods , pages 167 -- 190 , Leuven (Belgium) , 2000 . Q. He and A.S. Alfa. The discrete time MMAP{K}\/PH{K}\/1\/LCFS-GPR queue and its variants. In Proc. of the 3rd Int. Conf. on Matrix Analytic Methods, pages 167--190, Leuven (Belgium), 2000."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2005.1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.868486"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719734","volume-title":"Introduction to Matrix Analytic Methods and stochastic modeling","author":"Latouche G.","year":"1999","unstructured":"G. Latouche and V. Ramaswami . Introduction to Matrix Analytic Methods and stochastic modeling . SIAM , Philadelphia , 1999 . G. Latouche and V. Ramaswami. Introduction to Matrix Analytic Methods and stochastic modeling. SIAM, Philadelphia, 1999."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1214\/105051605000000494"},{"key":"e_1_3_2_1_21_1","volume-title":"Conflict resolution algorithms and their performance analysis. Technical report","author":"Molle M. L.","year":"1993","unstructured":"M. L. Molle and G.C. Polyzos . Conflict resolution algorithms and their performance analysis. Technical report , University of Toronto , CS93-300, 1993 . M. L. Molle and G.C. Polyzos. Conflict resolution algorithms and their performance analysis. Technical report, University of Toronto, CS93-300, 1993."},{"key":"e_1_3_2_1_22_1","volume-title":"An Algorithmic Approach","author":"Neuts M.F.","year":"1981","unstructured":"M.F. Neuts . Matrix-Geometric Solutions in Stochastic Models , An Algorithmic Approach . John Hopkins University Press , 1981 . M.F. Neuts. Matrix-Geometric Solutions in Stochastic Models, An Algorithmic Approach. John Hopkins University Press, 1981."},{"key":"e_1_3_2_1_23_1","volume-title":"Structured Stochastic Matrices of M\/G\/1 type and their applications","author":"Neuts M.F.","year":"1989","unstructured":"M.F. Neuts . Structured Stochastic Matrices of M\/G\/1 type and their applications . Marcel Dekker, Inc. , New York and Basel, 1989 . M.F. Neuts. Structured Stochastic Matrices of M\/G\/1 type and their applications. Marcel Dekker, Inc., New York and Basel, 1989."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v27:2"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964800000036"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208700"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/15326349508807353"},{"issue":"4","key":"e_1_3_2_1_28_1","first-page":"32","article-title":"Free synchronous packet access in a broadcast channel with feedback","volume":"14","author":"Tsybakov B. S.","year":"1978","unstructured":"B. S. Tsybakov and V.A. Mikhailov . Free synchronous packet access in a broadcast channel with feedback . Problemy Peredachi Inform , 14 ( 4 ): 32 -- 59 , 1978 . B. S. Tsybakov and V.A. Mikhailov. Free synchronous packet access in a broadcast channel with feedback. Problemy Peredachi Inform, 14(4):32--59, 1978.","journal-title":"Problemy Peredachi Inform"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1081\/STM-100002273"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1081\/STM-120025400"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2004.01.002"},{"key":"e_1_3_2_1_32_1","volume-title":"Analyzing priority queues with 3 classes using tree-like processes. Submitted for publication","author":"Van Houdt B.","year":"2005","unstructured":"B. Van Houdt and C. Blondia . Analyzing priority queues with 3 classes using tree-like processes. Submitted for publication , 2005 . B. Van Houdt and C. Blondia. Analyzing priority queues with 3 classes using tree-like processes. Submitted for publication, 2005."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2005.30"},{"key":"e_1_3_2_1_34_1","volume-title":"Throughput of Q-ary splitting algorithms for contention resolution in communication networks. Communications in information and systems, 4(2):135--164","author":"Van Houdt B.","year":"2005","unstructured":"B. Van Houdt and C. Blondia . Throughput of Q-ary splitting algorithms for contention resolution in communication networks. Communications in information and systems, 4(2):135--164 , 2005 . B. Van Houdt and C. Blondia. Throughput of Q-ary splitting algorithms for contention resolution in communication networks. Communications in information and systems, 4(2):135--164, 2005."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1080\/15326349908807556"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.2307\/1427900"}],"event":{"name":"SIGMETRICS06: 2006 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","location":"Saint Malo France","acronym":"SIGMETRICS06","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the joint international conference on Measurement and modeling of computer systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1140277.1140299","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1140277.1140299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:24Z","timestamp":1750244784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1140277.1140299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,26]]},"references-count":33,"alternative-id":["10.1145\/1140277.1140299","10.1145\/1140277"],"URL":"https:\/\/doi.org\/10.1145\/1140277.1140299","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1140103.1140299","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2006,6,26]]},"assertion":[{"value":"2006-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}