{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T04:12:41Z","timestamp":1773461561776,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030925109","type":"print"},{"value":"9783030925116","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92511-6_2","type":"book-chapter","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T14:05:12Z","timestamp":1638885912000},"page":"22-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Two-Step Fitting Approach of\u00a0Batch Markovian Arrival Processes for\u00a0Teletraffic Data"],"prefix":"10.1007","author":[{"given":"Gang","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaoyu","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,8]]},"reference":[{"key":"2_CR1","unstructured":"Breuer, L.: Parameter estimation for a class of BMAPs. In: Latouche, G., Taylor, P. (eds.) Advances in Algorithmic Methods for Stochastic Models: Proceedings of the 3rd International Conference on Matrix Analytic Methods, pp. 87\u201397. Notable Publications, Neshanic Station, New Jersey, USA, July 2000"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/A:1020981005544","volume":"112","author":"L Breuer","year":"2002","unstructured":"Breuer, L.: An EM algorithm for batch Markovian arrival processes and its comparison to a simpler estimation procedure. Ann. Oper. Res. 112(1), 123\u2013138 (2002)","journal-title":"Ann. Oper. Res."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-45232-4_14","volume-title":"Computer Performance Evaluation. Modelling Techniques and Tools","author":"P Buchholz","year":"2003","unstructured":"Buchholz, P.: An EM-algorithm for MAP fitting from real traffic data. In: Kemper, P., Sanders, W.H. (eds.) TOOLS 2003. LNCS, vol. 2794, pp. 218\u2013236. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45232-4_14"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Buchholz, P., Kriege, J.: A heuristic approach for fitting MAPs to moments and joint moments. In: 2009 Sixth International Conference on the Quantitative Evaluation of Systems, pp. 53\u201362. IEEE (2009)","DOI":"10.1109\/QEST.2009.36"},{"key":"2_CR5","series-title":"SpringerBriefs in Mathematics","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-06674-5_7","volume-title":"Input Modeling with Phase-Type Distributions and Markov Models","author":"P Buchholz","year":"2014","unstructured":"Buchholz, P., Kriege, J., Felko, I.: Software tools. In: Input Modeling with Phase-Type Distributions and Markov Models. SM, pp. 111\u2013114. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06674-5_7"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-540-30182-0_23","volume-title":"Computer and Information Sciences - ISCIS 2004","author":"P Buchholz","year":"2004","unstructured":"Buchholz, P., Panchenko, A.: A two-step EM algorithm for MAP fitting. In: Aykanat, C., Dayar, T., K\u00f6rpeo\u011flu, \u0130 (eds.) ISCIS 2004. LNCS, vol. 3280, pp. 217\u2013227. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30182-0_23"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Casale, G., Zhang, E.Z., Smirni, E.: KPC-toolbox: simple yet effective trace fitting using Markovian arrival processes. In: 2008 Fifth International Conference on Quantitative Evaluation of Systems, pp. 83\u201392. IEEE (2008)","DOI":"10.1109\/QEST.2008.33"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Fiondella, L., Puliafito, A.: Principles of Performance and Reliability Modeling and Evaluation. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-30599-8","DOI":"10.1007\/978-3-319-30599-8"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-5316(93)90035-S","volume":"18","author":"W Fischer","year":"1993","unstructured":"Fischer, W., Meier-Hellstern, K.: The Markov-modulated Poisson process (MMPP) cookbook. Performance Eval. 18(2), 149\u2013171 (1993)","journal-title":"Performance Eval."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Heindl, A., Horvath, G., Gross, K.: Explicit inverse characterizations of acyclic MAPs of second order. Formal methods, pp. 108\u2013122 (2006)","DOI":"10.1007\/11777830_8"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Horvath, G., Buchholz, P., Telek, M.: A MAP fitting approach with independent approximation of the inter-arrival time distribution and the lag correlation, pp. 124\u2013133 (2005)","DOI":"10.1109\/QEST.2005.1"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, G., Telek, M.: BuTools 2: a rich toolbox for Markovian performance evaluation. In: VALUETOOLS (2016)","DOI":"10.4108\/eai.25-10-2016.2266400"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-5316(03)00067-1","volume":"54","author":"A Klemm","year":"2003","unstructured":"Klemm, A., Lindemann, C., Lohmann, M.: Modeling IP traffic using the batch Markovian arrival process. Perform. Eval. 54(2), 149\u2013173 (2003)","journal-title":"Perform. Eval."},{"issue":"452","key":"2_CR14","first-page":"1379","volume":"95","author":"G Latouche","year":"1999","unstructured":"Latouche, G., Ramaswami, V.: Introduction to matrix analytic methods in stochastic modeling. J. Am. Stat. Assoc. 95(452), 1379 (1999)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"2_CR15","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/505680.505682","volume":"30","author":"S Ledesma","year":"2000","unstructured":"Ledesma, S., Liu, D.: Synthesis of fractional Gaussian noise using linear approximation for generating self-similar network traffic. ACM SIGCOMM Comput. Commun. Rev. 30(2), 4\u201317 (2000)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Lucantoni, D.M.: New results on the single server queue with a batch Markovian arrival process. Commun. Stat. Stochas. Mod. 7(1), 1\u201346 (1991)","DOI":"10.1080\/15326349108807174"},{"issue":"4","key":"2_CR17","doi-asserted-by":"publisher","first-page":"764","DOI":"10.2307\/3213143","volume":"16","author":"MF Neuts","year":"1979","unstructured":"Neuts, M.F.: A versatile Markovian point process. J. Appl. Probab. 16(4), 764\u2013779 (1979)","journal-title":"J. Appl. Probab."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Okamura, H., Dohi, T.: Faster maximum likelihood estimation algorithms for Markovian arrival processes, pp. 73\u201382, September 2009","DOI":"10.1109\/QEST.2009.28"},{"key":"2_CR19","series-title":"Springer Series in Reliability Engineering","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-30599-8_3","volume-title":"Principles of Performance and Reliability Modeling and Evaluation","author":"H Okamura","year":"2016","unstructured":"Okamura, H., Dohi, T.: Fitting phase-type distributions and Markovian arrival processes: algorithms and tools. In: Fiondella, L., Puliafito, A. (eds.) Principles of Performance and Reliability Modeling and Evaluation. SSRE, pp. 49\u201375. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30599-8_3"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11009-014-9401-z","volume":"18","author":"J Rodriguez","year":"2016","unstructured":"Rodriguez, J., Lillo, R.E., Ramirezcobo, P.: Nonidentifiability of the two-state BMAP. Methodol. Comput. Appl. Probab. 18(1), 81\u2013106 (2016)","journal-title":"Methodol. Comput. Appl. Probab."},{"issue":"3","key":"2_CR21","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.comnet.2003.10.004","volume":"44","author":"P Salvador","year":"2004","unstructured":"Salvador, P., Pacheco, A., Valadas, R.: Modeling IP traffic: joint characterization of packet arrivals and packet sizes using BMAPs. Comput. Netw. 44(3), 335\u2013352 (2004)","journal-title":"Comput. Netw."},{"issue":"9","key":"2_CR22","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1016\/j.peva.2007.06.001","volume":"64","author":"M Telek","year":"2007","unstructured":"Telek, M., Horvath, G.: A minimal representation of Markov arrival processes and a moments matching method. Perform. Eval. 64(9), 1153\u20131168 (2007)","journal-title":"Perform. Eval."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Thummler, A., Buchholz, P., Telek, M.: A novel approach for fitting probability distributions to real trace data with the EM algorithm. In: 2005 International Conference on Dependable Systems and Networks (DSN 2005), pp. 712\u2013721. IEEE (2005)","DOI":"10.1109\/DSN.2005.11"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Performance Evaluation Methodologies and Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92511-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T23:01:55Z","timestamp":1726268515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92511-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030925109","9783030925116"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92511-6_2","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"value":"1867-8211","type":"print"},{"value":"1867-822X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VALUETOOLS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EAI International Conference on Performance Evaluation Methodologies and Tools","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"valuetools2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}