{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:58:55Z","timestamp":1782835135206,"version":"3.54.5"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T00:00:00Z","timestamp":1326672000000},"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":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2012,1,16]]},"abstract":"<jats:p>Internet traffic has Zipf-like properties at multiple aggregation levels. These properties suggest the possibility of offloading most of the traffic from a complex controller (e.g., a software router) to a simple forwarder (e.g., a commodity switch), by letting the forwarder handle a very limited set of flows; the heavy hitters. As the volume of traffic from a set of flows is highly dynamic, maintaining a reliable set of heavy hitters over time is challenging. This is especially true when we face a volume limit in the non-offloaded traffic in combination with a constraint in the size of the heavy hitter set or its rate of change. We propose a set selection strategy that takes advantage of the properties of heavy hitters at different time scales. Based on real Internet traffic traces, we show that our strategy is able to offload most of the traffic while limiting the rate of change of the heavy hitter set, suggesting the feasibility of alternative router designs.<\/jats:p>","DOI":"10.1145\/2096149.2096152","type":"journal-article","created":{"date-parts":[[2012,1,17]],"date-time":"2012-01-17T17:21:44Z","timestamp":1326820904000},"page":"16-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":105,"title":["Leveraging Zipf's law for traffic offloading"],"prefix":"10.1145","volume":"42","author":[{"given":"Nadi","family":"Sarrar","sequence":"first","affiliation":[{"name":"TU Berlin \/ T-Labs, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steve","family":"Uhlig","sequence":"additional","affiliation":[{"name":"TU Berlin \/ T-Labs, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anja","family":"Feldmann","sequence":"additional","affiliation":[{"name":"TU Berlin \/ T-Labs, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rob","family":"Sherwood","sequence":"additional","affiliation":[{"name":"Big Switch Networks, Palo Alto, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[{"name":"Deutsche Telekom Inc. R&amp;D Lab, Los Altos, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,1,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005724"},{"key":"e_1_2_1_2_1","unstructured":"AdvancedTCA Specifications for Next Generation Telecommunications Equipment. www.advancedtca.org.  AdvancedTCA Specifications for Next Generation Telecommunications Equipment. www.advancedtca.org."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039865"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298344"},{"key":"e_1_2_1_5_1","volume-title":"VLDB","author":"CORMODE G.","year":"2003","unstructured":"CORMODE , G. , KORN , F. , MUTHUKRISHNAN , S. , AND SRIVASTAVA , D. Finding hierarchical heavy hitters in data streams . In VLDB ( 2003 ). CORMODE, G., KORN, F., MUTHUKRISHNAN, S., AND SRIVASTAVA, D. Finding hierarchical heavy hitters in data streams. In VLDB (2003)."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629578"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015495"},{"key":"e_1_2_1_8_1","volume-title":"Inter-as traffic patterns and their implications","author":"FANG W.","year":"1999","unstructured":"FANG , W. , AND PETERSON , L. Inter-as traffic patterns and their implications . In IEEE Global Internet ( 1999 ). FANG, W., AND PETERSON, L. Inter-as traffic patterns and their implications. In IEEE Global Internet (1999)."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851207"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637232"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7552(90)90106-3"},{"key":"e_1_2_1_12_1","volume-title":"USENIX ATC, Freenix track","author":"CHO K. M.","year":"2000","unstructured":"K. CHO , K. M. , AND KATO , A. Traffic data repository at the wide project . In USENIX ATC, Freenix track ( 2000 ). K. CHO, K. M., AND KATO, A. Traffic data repository at the wide project. In USENIX ATC, Freenix track (2000)."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1532940.1532942"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232919.1232927"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/263105.263151"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSE.2007.69"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_2_1_18_1","volume-title":"www.oecd.org\/sti\/ict\/broadband","author":"OECD","year":"2008","unstructured":"OECD . Broadband Portal. www.oecd.org\/sti\/ict\/broadband , 2008 . OECD. Broadband Portal. www.oecd.org\/sti\/ict\/broadband, 2008."},{"key":"e_1_2_1_19_1","volume-title":"Impact of flow dynamics on traffic engineering design principles","author":"PAPAGIANNAKI K.","year":"2004","unstructured":"PAPAGIANNAKI , K. , TAFT , N. , AND DIOT , C. Impact of flow dynamics on traffic engineering design principles . In IEEE INFOCOM ( 2004 ). PAPAGIANNAKI, K., TAFT, N., AND DIOT, C. Impact of flow dynamics on traffic engineering design principles. In IEEE INFOCOM (2004)."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921206.1921209"},{"key":"e_1_2_1_21_1","volume-title":"Can the production network be the test-bed? In OSDI","author":"SHERWOOD R.","year":"2010","unstructured":"SHERWOOD , R. , GIBB , G. , YAPA , K. , CASSADO , M. , APPENZELLER , G. , MCKEOWN , N. , AND PARULKAR , G. Can the production network be the test-bed? In OSDI ( 2010 ). SHERWOOD, R., GIBB, G., YAPA, K., CASSADO, M., APPENZELLER, G., MCKEOWN, N., AND PARULKAR, G. Can the production network be the test-bed? In OSDI (2010)."},{"key":"e_1_2_1_22_1","volume-title":"Efficiency analyses on routing cache replacement algorithms","author":"SHYU W.","year":"2002","unstructured":"SHYU , W. , WU , C. , AND HOU , T. Efficiency analyses on routing cache replacement algorithms . In IEEE ICC ( 2002 ). SHYU, W., WU, C., AND HOU, T. Efficiency analyses on routing cache replacement algorithms. In IEEE ICC (2002)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064413.1064417"},{"key":"e_1_2_1_24_1","volume-title":"Capturing the variability of internet flows across time","author":"WALLERICH J.","year":"2006","unstructured":"WALLERICH , J. , AND FELDMANN , A. Capturing the variability of internet flows across time . In IEEE Global Internet ( 2006 ). WALLERICH, J., AND FELDMANN, A. Capturing the variability of internet flows across time. In IEEE Global Internet (2006)."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637231"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633055"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028802"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2096149.2096152","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2096149.2096152","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:34Z","timestamp":1750240474000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2096149.2096152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,16]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1,16]]}},"alternative-id":["10.1145\/2096149.2096152"],"URL":"https:\/\/doi.org\/10.1145\/2096149.2096152","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1,16]]},"assertion":[{"value":"2012-01-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}