{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:07:40Z","timestamp":1761401260614},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2005,4]]},"abstract":"<jats:p>We focus in this paper on Internet flows, consider their contributions to the overall traffic per time unit or bin, and perform a multi-scale and multi-protocol analysis to explore the persistency properties of those flows that contribute the most (also known as \"heavy hitters\" or \"elephants\"). Knowing the persistency features (or a lack thereof) of the heavy hitters and understanding their underlying causes is crucial when developing traffic engineering tools that focus primarily on optimizing system performance for elephant flows.The main difficulty when studying the persistency properties of flows is that the available measurements are either too fine-grained to perform large-scale studies (i.e., packet-level traces) or too coarse-grained to extract the detailed information necessary for the purpose at hand (i.e., Netflow traces, SNMP). We deal with this problem by assuming that flows have constant throughput through their lifetime. We then check the validity of this assumption by comparing our Netflow-derived findings against those obtained from directly studying the corresponding detailed packet-level traces. By considering different time aggregations (e.g., bin sizes between 1--10 minutes) and flow abstractions (e.g., raw IP flows, pre-fix flows), varying the definition of what constitutes an \"elephant\", and slicing by different protocols and applications, we present a methodology for studying persistency aspects exhibited by Internet flows. For example, we find that raw IP flows that are elephant flows for at least once (i.e., one bin or time unit) in their lifetimes tend to show a remarkable persistence to be elephants for much of their lifetimes, but certain aggregate flows exhibit more intricate persistency properties.<\/jats:p>","DOI":"10.1145\/1064413.1064417","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T19:28:32Z","timestamp":1131391712000},"page":"23-36","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["A methodology for studying persistency aspects of internet flows"],"prefix":"10.1145","volume":"35","author":[{"given":"J\u00f6rg","family":"Wallerich","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger","family":"Dreger","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anja","family":"Feldmann","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balachander","family":"Krishnamurthy","sequence":"additional","affiliation":[{"name":"AT&amp;T Labs Research, Florham Park, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Willinger","sequence":"additional","affiliation":[{"name":"AT&amp;T Labs Research, Florham Park, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633055"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505215"},{"key":"e_1_2_1_4_1","volume-title":"Addison-Wesley","author":"Zipf G.","year":"1949"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"M. Mitzenmacher \"A brief history of generative models for power law and lognormal distributions. \" Internet Mathematics 2003.  M. Mitzenmacher \"A brief history of generative models for power law and lognormal distributions. \" Internet Mathematics 2003.","DOI":"10.1080\/15427951.2004.10129088"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511485"},{"key":"e_1_2_1_8_1","unstructured":"W. Fang and L. Peterson \"Inter-AS traffic patterns and their implications \" in Proc. of the 4th Global Internet Symposium 1999.  W. Fang and L. Peterson \"Inter-AS traffic patterns and their implications \" in Proc. of the 4th Global Internet Symposium 1999."},{"key":"e_1_2_1_9_1","unstructured":"L. Guo and I. Matta \"The war between mice and elephants \" in Proceedings of ICNP 2001.   L. Guo and I. Matta \"The war between mice and elephants \" in Proceedings of ICNP 2001."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347554"},{"key":"e_1_2_1_11_1","unstructured":"K. C. Claffy and N. Brownlee \"Understanding Internet traffic streams: Dragonflies and Tortoises. \" IEEE Communications 2002.  K. C. Claffy and N. Brownlee \"Understanding Internet traffic streams: Dragonflies and Tortoises. \" IEEE Communications 2002."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637242"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637227"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.464717"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.642356"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/263105.263135"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.748081"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.664261"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"W. Stallings SNMP SNMPv2 SNMPv3 and RMON 1 and 2. Addison-Wesley 1999.   W. Stallings SNMP SNMPv2 SNMPv3 and RMON 1 and 2. Addison-Wesley 1999.","DOI":"10.1109\/COMST.1998.5340405"},{"key":"e_1_2_1_20_1","unstructured":"Cisco Netflow. http:\/\/www.cisco.com\/warp\/public\/732\/netflow\/index.html .  Cisco Netflow. http:\/\/www.cisco.com\/warp\/public\/732\/netflow\/index.html ."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637226"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637206"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1064413.1064417","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T13:37:11Z","timestamp":1672234631000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064413.1064417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["10.1145\/1064413.1064417"],"URL":"https:\/\/doi.org\/10.1145\/1064413.1064417","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2005,4]]},"assertion":[{"value":"2005-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}