{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:21Z","timestamp":1750308081944,"version":"3.41.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2004,10,1]],"date-time":"2004-10-01T00:00:00Z","timestamp":1096588800000},"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":["SIGMOBILE Mob. Comput. Commun. Rev."],"published-print":{"date-parts":[[2004,10]]},"abstract":"<jats:p>In this paper, we provide statistics on large-scale traffic measurements that have been made in a live cellular GPRS network. We show that the current GPRS traffic is dominated by HTTP- and WAP-based applications, and further show in what direction (uplink and\/or downlink) the ensuing traffic is transmitted as well as statistics on the length of the flows on a per application basis. We find that the results differ compared to those found in similar measurement studies that have been carried out in the fixed Internet. In particular, our results suggest that flows are shorter in cellular networks, and that the so-called mice and elephant effect, whereby a small part of the flows make up a majority of the bytes transferred, is not prevalent in GPRS networks. Instead, extremely short flows account for the majority of the total flows and bytes transferred. We also discuss the impact of this finding on future research on TCP loss recovery.<\/jats:p>","DOI":"10.1145\/1052871.1052874","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"37-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Searching for mobile mice and elephants in GPRS networks"],"prefix":"10.1145","volume":"8","author":[{"given":"Roger","family":"Kalden","sequence":"first","affiliation":[{"name":"Ericsson Research, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannes","family":"Ekstr\u00f6m","sequence":"additional","affiliation":[{"name":"Ericsson Research, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,10]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"3GPP TS 03.60 \"General Packet Radio Service (GPRS); Service description; Stage 2 (Release 1998)]]  3GPP TS 03.60 \"General Packet Radio Service (GPRS); Service description; Stage 2 (Release 1998)]]"},{"key":"e_1_2_1_2_1","unstructured":"Apache HTTP Server (http:\/\/httpd.apache.org\/) description (http:\/\/httpd.apache.org\/docs\/keepalive.html)]]  Apache HTTP Server (http:\/\/httpd.apache.org\/) description (http:\/\/httpd.apache.org\/docs\/keepalive.html)]]"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"M. Allman H. Balakrishnan S. Floyd \"Enhancing TCP's Loss Recovery Using Limited Transmit\" RFC 3042 January 2001]]   M. Allman H. Balakrishnan S. Floyd \"Enhancing TCP's Loss Recovery Using Limited Transmit\" RFC 3042 January 2001]]","DOI":"10.17487\/rfc3042"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"M. Allman V. Paxon W. Stevens \"TCP Congestion Control\" RFC 2581 April 1999]]  M. Allman V. Paxon W. Stevens \"TCP Congestion Control\" RFC 2581 April 1999]]","DOI":"10.17487\/rfc2581"},{"key":"e_1_2_1_5_1","unstructured":"U. Ayesta K. Avrachenkov \"On reducing the number of TimeOuts for short-lived TCP connections\" IETF Internet Draft October 2002 (Work in Progress)]]  U. Ayesta K. Avrachenkov \"On reducing the number of TimeOuts for short-lived TCP connections\" IETF Internet Draft October 2002 (Work in Progress)]]"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"E. Blanton M. Allman K. Fall L. Wang \"A Conservative Selective Acknowledgement (SACK)-based Loss Recovery Algorithm for TCP\" RFC 3517 April 2003]]   E. Blanton M. Allman K. Fall L. Wang \"A Conservative Selective Acknowledgement (SACK)-based Loss Recovery Algorithm for TCP\" RFC 3517 April 2003]]","DOI":"10.17487\/rfc3517"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.464717"},{"key":"e_1_2_1_8_1","unstructured":"H. Ekstr\u00f6m R. Ludwig \"The Peak-Hopper: A New End-2-End Retransmission Timer for Reliable Unicast Transport\" In proceedings of IEEE Infocom 2004]]  H. Ekstr\u00f6m R. Ludwig \"The Peak-Hopper: A New End-2-End Retransmission Timer for Reliable Unicast Transport\" In proceedings of IEEE Infocom 2004]]"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2616"},{"key":"e_1_2_1_11_1","volume-title":"A survey of Mice in Elephant Shoes\", under submission","author":"Iyengar J. R.","year":"2003","unstructured":"J. R. Iyengar , A. L. Caro , P. D. Amer , \"Dealing with Short TCP Flows : A survey of Mice in Elephant Shoes\", under submission , 2003 ]] J. R. Iyengar, A. L. Caro, P. D. Amer, \"Dealing with Short TCP Flows: A survey of Mice in Elephant Shoes\", under submission, 2003]]"},{"key":"e_1_2_1_12_1","unstructured":"K. C. Lan J. Heidemann \"On the correlation of Internet flow characteristics\" under submission 2003]]  K. C. Lan J. Heidemann \"On the correlation of Internet flow characteristics\" under submission 2003]]"},{"volume-title":"RFC 2018","author":"Mathis M.","key":"e_1_2_1_13_1","unstructured":"M. Mathis , J. Mahdavi , S. Floyd , A. Romanov , \" TCP Selective ACKOptions\" , RFC 2018 , October 1996]] M. Mathis, J. Mahdavi, S. Floyd, A. Romanov, \"TCP Selective ACKOptions\", RFC 2018, October 1996]]"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"H. F. Nielsen J. Gettys A. Baird-Smith etal June 1997 \"Network Performance Effects of HTTP 1.1 CSS1 and PNG\" http:\/\/www.w3.org\/TR\/NOTE-pipelining]]  H. F. Nielsen J. Gettys A. Baird-Smith et al. June 1997 \"Network Performance Effects of HTTP 1.1 CSS1 and PNG\" http:\/\/www.w3.org\/TR\/NOTE-pipelining]]","DOI":"10.1145\/263105.263157"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"V. Paxon M. Allman \"Computing TCP's Retransmission Timer\" RFC 2988 November 2000]]   V. Paxon M. Allman \"Computing TCP's Retransmission Timer\" RFC 2988 November 2000]]","DOI":"10.17487\/rfc2988"},{"key":"e_1_2_1_16_1","unstructured":"J. C. Mogul \"The Case for Persistent-Connection HTTP\" DIGITIAL Western Research Laboratory Research Report 95\/4]]  J. C. Mogul \"The Case for Persistent-Connection HTTP\" DIGITIAL Western Research Laboratory Research Report 95\/4]]"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.642356"},{"key":"e_1_2_1_18_1","unstructured":"WAP-224-WTP-\"Wireless Transaction Protocol\" URL: http:\/\/www.wapforum.org\/]]  WAP-224-WTP-\"Wireless Transaction Protocol\" URL: http:\/\/www.wapforum.org\/]]"},{"key":"e_1_2_1_19_1","unstructured":"WAP-225-TCP- \"Wireless Profiled TCP\" URL: http:\/\/www.wapforum.org\/]]  WAP-225-TCP- \"Wireless Profiled TCP\" URL: http:\/\/www.wapforum.org\/]]"},{"key":"e_1_2_1_20_1","unstructured":"WAP-229-HTTP-\" Wireless Profiled HTTP\" URL:http:\/\/www.wapforum.org\/]]  WAP-229-HTTP-\" Wireless Profiled HTTP\" URL:http:\/\/www.wapforum.org\/]]"},{"key":"e_1_2_1_21_1","unstructured":"WAP-230-WSP \"Wireless Session Protocol Specification\" URL:http:\/\/www.wapforum.org\/]]  WAP-230-WSP \"Wireless Session Protocol Specification\" URL:http:\/\/www.wapforum.org\/]]"},{"key":"e_1_2_1_22_1","unstructured":"WAP 2.0 \"Technical White Paper\" URL:http:\/\/www.wapforum.org\/]]  WAP 2.0 \"Technical White Paper\" URL:http:\/\/www.wapforum.org\/]]"}],"container-title":["ACM SIGMOBILE Mobile Computing and Communications Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1052871.1052874","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1052871.1052874","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:43Z","timestamp":1750262863000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1052871.1052874"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,10]]}},"alternative-id":["10.1145\/1052871.1052874"],"URL":"https:\/\/doi.org\/10.1145\/1052871.1052874","relation":{},"ISSN":["1559-1662","1931-1222"],"issn-type":[{"type":"print","value":"1559-1662"},{"type":"electronic","value":"1931-1222"}],"subject":[],"published":{"date-parts":[[2004,10]]},"assertion":[{"value":"2004-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}