{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:09:34Z","timestamp":1761401374949,"version":"3.41.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"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":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2007,9]]},"abstract":"<jats:p>The particular statistical properties found in network measurements, namely self-similarity and long-range dependence, cannot be ignored in modeling network and Internet traffic. Thus, despite their mathematical tractability, traditional Markov models are not appropriate for this purpose, since their memoryless nature contradicts the burstiness of transmitted packets. However, it is desirable to find a similarly tractable model which is, at the same time, rigorous at capturing the features of network traffic.<\/jats:p>\n          <jats:p>\n            This work presents\n            <jats:italic>discrete-time heavy-tailed chains<\/jats:italic>\n            , a tractable approach to characterize network traffic as a superposition of discrete-time \u201con\/off\u201d sources. This is a particular case of the generic \u201con\/off\u201d heavy-tailed model, thus shows the same statistical features as the former, particularly self-similarity and long-range dependence, when the number of aggregated sources approaches infinity.\n          <\/jats:p>\n          <jats:p>The model is then applicable to characterize a number of discrete-time communication systems, for instance, ATM and optical packet switching, to further derive meaningful performance metrics such as average burst duration and the number of active sources in a random instant.<\/jats:p>","DOI":"10.1145\/1276927.1276930","type":"journal-article","created":{"date-parts":[[2007,9,26]],"date-time":"2007-09-26T17:18:32Z","timestamp":1190827112000},"page":"17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Discrete-time heavy-tailed chains, and their properties in modeling network traffic"],"prefix":"10.1145","volume":"17","author":[{"given":"Jos\u00e9 Alberto","family":"Hern\u00e1ndez","sequence":"first","affiliation":[{"name":"Loughborough University, Leicestershire, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iain W.","family":"Phillips","sequence":"additional","affiliation":[{"name":"Loughborough University, Leicestershire, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Aracil","sequence":"additional","affiliation":[{"name":"Universidad Aut\u00f3noma de Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/35.601746"},{"volume-title":"Statistics for Long-Memory Processes","author":"Beran J.","key":"e_1_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1201\/9780203738481"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.380206"},{"edition":"3","volume-title":"Probability and Measure","author":"Billingsley P.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.650143"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/285243.285256"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/279345.279346"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/774763.774767"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/35.267444"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/50.736580"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176343247"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.1986.1146410"},{"key":"e_1_2_1_13_1","unstructured":"Karagiannis T. Faloutsos M. and Riedi R. 2002. Long-Range dependence: Now you see it now you don't&excl; In Global Internet Symposium (in IEEE GLOBECOM). Taipei Taiwan.  Karagiannis T. Faloutsos M. and Riedi R. 2002. Long-Range dependence: Now you see it now you don't&excl; In Global Internet Symposium (in IEEE GLOBECOM). Taipei Taiwan."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.282603"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/364996.365004"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.400651"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/35.910600"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.392383"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1069362376"},{"edition":"2","volume-title":"Stochastic Processes","author":"Ross S.","key":"e_1_2_1_20_1"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/263876.263879"},{"key":"e_1_2_1_22_1","first-page":"8","article-title":"Where mathematics meets the Internet","volume":"45","author":"Willinger W.","year":"1998","journal-title":"Not. Amer. Math. Soc."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.554723"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276927.1276930","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1276927.1276930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:04Z","timestamp":1750258684000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1276927.1276930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["10.1145\/1276927.1276930"],"URL":"https:\/\/doi.org\/10.1145\/1276927.1276930","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"type":"print","value":"1049-3301"},{"type":"electronic","value":"1558-1195"}],"subject":[],"published":{"date-parts":[[2007,9]]},"assertion":[{"value":"2007-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}