{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:40Z","timestamp":1750307680245,"version":"3.41.0"},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2008,8,31]],"date-time":"2008-08-31T00:00:00Z","timestamp":1220140800000},"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":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2008,8,31]]},"abstract":"<jats:p>\n            We present the KPC-Toolbox, a set of MATLAB scripts for fitting workload traces into Markovian Arrival Processes (MAPs) in an automatic way. Given that the MAP parameterization space can be very large, we focus on first determining the order of the smallest MAP that can fit the trace well using the Bayesian Information Criterion (\n            <jats:italic>BIC<\/jats:italic>\n            ). Having determined the order of the target MAP, the KPC-Toolbox automatically derives a MAP that captures accurately the moments and temporal dependence of the trace. We present experiments showing the effectiveness of the KPC-Toolbox in fitting traces that are well-documented in the literature as very challenging ones to fit.\n          <\/jats:p>","DOI":"10.1145\/1453175.1453189","type":"journal-article","created":{"date-parts":[[2008,10,22]],"date-time":"2008-10-22T12:25:40Z","timestamp":1224678340000},"page":"75-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["KPC-Toolbox"],"prefix":"10.1145","volume":"36","author":[{"given":"Eddy Zheng","family":"Zhang","sequence":"first","affiliation":[{"name":"College of William &amp; Mary, Williamsburg, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuliano","family":"Casale","sequence":"additional","affiliation":[{"name":"College of William &amp; Mary, Williamsburg, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evgenia","family":"Smirni","sequence":"additional","affiliation":[{"name":"College of William &amp; Mary, Williamsburg, VA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,8,31]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.700908"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.10015"},{"key":"e_1_2_1_3_1","volume-title":"Kronecker products and matrix calculus in system theory","author":"Brewer J.","year":"1978","unstructured":"J. Brewer . Kronecker products and matrix calculus in system theory . IEEE T. Circ. and Sys ., 25(9), 1978 . J. Brewer. Kronecker products and matrix calculus in system theory. IEEE T. Circ. and Sys., 25(9), 1978."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375460"},{"key":"e_1_2_1_5_1","volume-title":"Under Submission","author":"Casale G.","year":"2007","unstructured":"G. Casale , E. Z. Zhang , and E. Smirni . Interarrival times characterization and fitting for Markovian traffic analysis . Under Submission , 2007 . G. Casale, E. Z. Zhang, and E. Smirni. Interarrival times characterization and fitting for Markovian traffic analysis. Under Submission, 2007."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2008.33"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019165221472"},{"key":"e_1_2_1_8_1","volume-title":"Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002 Tutorial Lectures, 405--434, LNCS 2459-Springer","author":"Horv\u00e1th A.","year":"2002","unstructured":"A. Horv\u00e1th and M. Telek . Markovian modeling of real data traffic: Heuristic phase type and map fitting of heavy tailed and fractal like samples . In Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002 Tutorial Lectures, 405--434, LNCS 2459-Springer , 2002 . A. Horv\u00e1th and M. Telek. Markovian modeling of real data traffic: Heuristic phase type and map fitting of heavy tailed and fractal like samples. In Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002 Tutorial Lectures, 405--434, LNCS 2459-Springer, 2002."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2005.1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2007.06.016"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2006.27"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2007.06.001"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1453175.1453189","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1453175.1453189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:45Z","timestamp":1750253385000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1453175.1453189"}},"subtitle":["best recipes toward automatization of workload fitting"],"short-title":[],"issued":{"date-parts":[[2008,8,31]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8,31]]}},"alternative-id":["10.1145\/1453175.1453189"],"URL":"https:\/\/doi.org\/10.1145\/1453175.1453189","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2008,8,31]]},"assertion":[{"value":"2008-08-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}