Cited By
View all- Serwadda APhoha V(2015)When Mice devour the ElephantsComputers and Security10.1016/j.cose.2015.04.01453:C(31-43)Online publication date: 1-Sep-2015
Upgrading mice to elephants: effects and end-point solutions
Pages 367 - 378
Abstract
Short TCP flows may suffer significant response-time performance degradations during network congestion. Unfortunately, this creates an incentive for misbehavior by clients of interactive applications (e.g., gaming, telnet, web): to send "dummy" packets into the network at a TCP-fair rate even when they have no data to send, thus improving their performance in moments when they do have data to send. Even though no "law" is violated in this way, a large-scale deployment of such an approach has the potential to seriously jeopardize one of the core Internet's principles-- statistical multiplexing. We quantify, by means of analytical modeling and simulation, gains achievable by the above misbehavior. Our research indicates that easy-to-implement application-level techniques are capable of dramatically reducing incentives for conducting the above transgressions, still without compromising the idea of statistical multiplexing.
References
[1]
A. Mondal and A. Kuzmanovic, "When TCP friendliness becomes harmful," in Proc. IEEE INFOCOM, Anchorage, AK, May 2007, pp. 152-160.
[2]
L. Guo and I. Matta, "The war between mice and elephants," in Proc. IEEE ICNP, Riverside, CA, Nov. 2001, pp. 180-188.
[3]
V. Paxson and M. Allman, "Computing TCP's retransmission timer," Internet RFC 2988, 2000.
[4]
L. Le, J. Aikat, K. Jeffay, and F. Smith, "Differential congestion notification: Taming the elephants," in Proc. IEEE ICNP, Berlin, Germany, Oct. 2004, pp. 118-128.
[5]
W. Noureddine and F. Tobagi, "Improving the performance of interactive TCP applications using service differentiation," in Proc. IEEE INFOCOM, New York, Jun. 2002, vol. 1, pp. 31-40.
[6]
"Which ports are used by computer games?," {Online}. Available: http://www.u.arizona.edu/ trw/games/ports.htm
[7]
R. Fielding, J. Gettys, J. Mogul, H. Frystyk, L. Masinter, P. Leach, and T. Berners-Lee, "Hypertext transfer protocol--HTTP/1.1," Internet RFC 2616, 1999.
[8]
M. Handley, J. Padhye, and S. Floyd, "TCP congestion window validation," Internet RFC 2861, 2000.
[9]
P. Dinda, G. Memik, R. Dick, B. Lin, A. Mallik, A. Gupta, and S. Rossoff, "The user in experimental computer systems research," in Proc. Workshop ExpCS, Jun. 2007, Article No. 10.
[10]
S. McCreary and K. Claffy, "Trends in wide area IP traffic patterns--A viewfrom Ames Internet exchange," in Proc. 13th ITC Special Seminar Internet Traffic Meas. Model., 2000 {Online}. Available: http://www. caida.org/publications/papers/2000/AIX0005/
[11]
T. Karagiannis, K. Papagiannaki, and M. Faloutsos, "BLINC: Multilevel traffic classification in the dark," in Proc. ACM SIGCOMM, Philadelphia, PA, Aug. 2005, pp. 229-240.
[12]
P. Patel, A. Whitaker, D. Wetherall, J. Lepreau, and T. Stack, "Upgrading transport protocols with untrusted mobile code," in Proc. ACM SOSP, Bolton Landing, NY, Oct. 2003, pp. 1-14.
[13]
R. Mahajan, S. Floyd, and D. Wetherall, "Controlling high-bandwidth flows at the congested router," in Proc. IEEE ICNP, Riverside, CA, Nov. 2001, pp. 192-201.
[14]
A. Kuzmanovic and E. Knightly, "A performance vs. trust perspective in the design of end-point congestion control protocols," in Proc. IEEE ICNP, Berlin, Germany, Oct. 2004, pp. 96-107.
[15]
E. Brosh, G. Lubetzky-Sharon, and Y. Shavitt, "Spatial-temporal analysis of passive TCP measurements," in Proc. IEEE INFOCOM, Miami, FL, Mar. 2005, vol. 2, pp. 949-959.
[16]
N. Cardwell, S. Savage, and T. Anderson, "Modeling TCP latency," in Proc. IEEE INFOCOM, Tel Aviv, Israel, Mar. 2000, vol. 3, pp. 1742-1751.
[17]
B. Kim and J. Lee, "Retransmission loss recovery by duplicate acknowledgement counting," IEEE Commun. Lett., vol. 8, no. 1, pp. 69-71, Jan. 2004.
[18]
J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, "Modeling TCP Reno performance: A simple model and its empirical validation," IEEE/ACM Trans. Netw., vol. 8, no. 2, pp. 133-145, Apr. 2000.
[19]
M. Allman and V. Paxson, "On estimating end-to-end network path properties," in Proc. ACM SIGCOMM, Vancouver, British Columbia, Sep. 1999, pp. 263-274.
[20]
L. Le, J. Aikat, K. Jeffay, and F. Smith, "The effects of active queue management on Web performance," in Proc. ACM SIGCOMM, Karlsruhe, Germany, Aug. 2003, pp. 265-276.
[21]
A. Kuzmanovic, "The power of explicit congestion notification," in Proc. ACM SIGCOMM, Philadelphia, PA, Aug. 2005, pp. 61-72.
[22]
R. Morris, "TCP behavior with many flows," in Proc. IEEE ICNP, Atlanta, GA, Oct. 1997, pp. 205-211.
[23]
F. Smith, F. Campos, K. Jeffay, and D. Ott, "What TCP/IP protocol headers can tell us about the Web," in Proc. ACM SIGMETRICS, Cambridge, MA, Jun. 2001, pp. 245-256.
[24]
J. Farber, "Network game traffic modeling," in Proc. NetGames, Braunschweig, Germany, Apr. 2002, pp. 53-57.
[25]
P. Danzig and S. Jamin, "tcplib: A Library of Internetwork Traffic Characteristics," USC Comput. Sci. Dept., USC Tech. Rep. CS-SYS-91-01, 1991.
[26]
V. Jacobson, "Congestion avoidance and control," in Proc. ACM SIGCOMM, Stanford, CA, Aug. 1988, pp. 314-329.
[27]
M. Allman, S. Floyd, and C. Partridge, "Increasing TCP's initial window," Internet RFC 3390, 2002.
[28]
M. Mellia, M. Meo, and C. Casetti, "TCP smart framing: a segmentation algorithm to reduce TCP latency," IEEE/ACM Trans. Netw., vol. 13, no. 2, pp. 316-329, Apr. 2005.
[29]
W. Eddy and M. Allman, "A comparison of RED's byte and packet modes," Comput. Netw., vol. 42, no. 2, pp. 261-280, Jun. 2003.
[30]
V. Paxson, "End-to-end Internet packet dynamics," IEEE/ACM Trans. Netw., vol. 7, no. 3, pp. 277-292, Jun. 1999.
[31]
M. Allman, H. Balakrishnan, and S. Floyd, "Enhancing TCP's loss recovery using limited retransmit," Internet RFC 3042, 2001.
[32]
M. Allman, K. Avrachenkov, U. Ayesta, and J. Blanton, "Early retransmit for TCP and STCP," IETF Internet Draft, 2006.
[33]
V. Padmanabhan, "Addressing the challenges of Web data transport," Ph.D. dissertation, Univ. Calif., Berkeley, 1998.
[34]
S. Yang and G. de Veciana, "Size-based adaptive bandwidth allocation: Optimizing the average QoS for elastic flows," in Proc. IEEE INFOCOM, New York, Jun. 2002, vol. 2, pp. 657-666.
[35]
S. Savage, N. Cardwell, and T. Anderson, "The case for informed transport protocols," in Proc. HotOS, Rio Rico, AZ, Mar. 1999, p. 58.
[36]
T. Anderson, A. Collins, A. Krishnamurthy, and J. Zahorjan, "PCP: Efficient endpoint congestion control," in Proc. NSDI, San Jose, CA, May 2006, p. 15.
Index Terms
- Upgrading mice to elephants: effects and end-point solutions
Recommendations
TCP with sender-based delay control
This paper describes a congestion control method for TCP that adjusts the transmission rate of a TCP connection by changing not only the congestion window size as in normal TCP, but also by delaying the transmission of packets at the sender. We refer to ...
Techniques for Enhancing TCP Performance in Wireless Networks
ICDCSW '12: Proceedings of the 2012 32nd International Conference on Distributed Computing Systems WorkshopsTransmission Control Protocol (TCP) carries the maximum Internet traffic, so performance of TCP largely affects the performance of Internet. However, end-to-end throughput in TCP degrades notably when operated in wireless networks, since random packet ...
On the properties of an adaptive TCP Minimum RTO
The Internet Engineering Task Force (IETF) specified in RFC 2988 the Minimum TCP-RTO and recommended that the TCP Retransmission Timeout (RTO) should not be smaller than 1s. According to RFC 2988, there are two main limitations that call for a lower ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
IEEE Press
Publication History
Published: 01 April 2010
Revised: 29 October 2007
Received: 02 May 2007
Published in TON Volume 18, Issue 2
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 286Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Nov 2024
Other Metrics
Citations
Cited By
View all- Serwadda APhoha V(2015)When Mice devour the ElephantsComputers and Security10.1016/j.cose.2015.04.01453:C(31-43)Online publication date: 1-Sep-2015
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in