skip to main content
article

On the role and controllability of persistent clients in traffic aggregates

Published: 01 April 2006 Publication History

Abstract

Flash crowd events (FCEs) present a real threat to the stability of routers and end-servers. Such events are characterized by a large and sustained spike in client arrival rates, usually to the point of service failure. Traditional rate-based drop policies, such as Random Early Drop (RED), become ineffective in such situations since clients tend to be persistent, in the sense that they make multiple retransmission attempts before aborting their connection. As it is built into TCP's congestion control, this persistence is very widespread, making it a major stumbling block to providing responsive aggregate traffic controls. This paper focuses on analyzing and modeling the effects of client persistence on the controllability of aggregate traffic. Based on this model, we propose a new drop strategy called persistent dropping to regulate the arrival of SYN packets and achieves three important goals: 1) it allows routers and end-servers to quickly converge to their control targets without sacrificing fairness; 2) it minimizes the portion of client delay that is attributed to the applied controls; and 3) it is both easily implementable and computationally tractable. Using a real implementation of this controller in the Linux kernel, we demonstrate its efficacy, up to 60% delay reduction for drop probabilities less than 0.5.

References

[1]
{1} H. Balakrishnan, V. N. Padmanabhan, S. Seshan, M. Stemm, and R. Katz, "TCP behavior of a busy Internet server: analysis and improvements," in Proc. IEEE INFOCOM, Mar. 1998, pp. 252-262.
[2]
{2} P. Barford and M. Crovella, "Generating representative web workloads for network and server performance evaluation," in Proc. Performance'98/ACM Sigmetrics'98, May 1998, pp. 151-160.
[3]
{3} N. L. Biggs, Discrete Mathematics. New York: Oxford Univ. Press, 1989.
[4]
{4} B. Braden et al., "Recommendations on queue management and congestion avoidance in the Internet," RFC 2309, 1998.
[5]
{5} N. Cardwell, S. Savage, and T. Anderson, "Modeling TCP latency," in Proc. IEEE INFOCOM, 2000, pp. 1742-1751.
[6]
{6} W. C. Feng, D. Kandlur, D. Saha, and K. G. Shin, "The BLUE active queue management algorithms," IEEE/ACM Trans. Netw., vol. 10, no. 4, pp. 67-85, Sep. 2002.
[7]
{7} S. D. Committee, SPECweb Tech. Rep., Apr. 1999. {Online}. Available: http://www.specbench.org/osg/web/
[8]
{8} T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms . Cambridge, MA: The MIT Press, 1990.
[9]
{9} A. Feldmann, Characteristics of TCP Connection Arrivals, ser. Self-Similar Network Traffic and Performance Evaluation. New York: Wiley, 2000, ch. 15, pp. 367-399.
[10]
{10} A. Feldmann, A. Gilbert, W. Willinger, and T. Kurtz, "The changing nature of network traffic: scaling phenomena," ACM Comput. Commun. Rev., vol. 28, no. 2, pp. 5-29, Apr. 1998.
[11]
{11} A. Feldmann, A. C. Gilbert, P. Haung, and W. Willinger, "Dynamics of IP traffic: a study of the role of variability and impact of control," in Proc. ACM SIGCOMM, 1999, pp. 301-313.
[12]
{12} S. Floyd, "TCP and explicit congestion notification," ACM Comput. Commun. Rev., vol. 24, no. 5, pp. 10-23, 1994.
[13]
{13} S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Trans. Netw., vol. 1, no. 4, pp. 397-417, Aug. 1993.
[14]
{14} S. Floyd and V. Jacobson, "Link-sharing and resource management models for packet networks," IEEE/ACM Trans. Netw., vol. 3, no. 4, pp. 365-386, Aug. 1995.
[15]
{15} S. Floyd, M. Handley, J. Padhye, and J. Widmer, "Equation-based congestion control for unicast applications," in Proc. ACM SIGCOMM, Aug. 2000, pp. 43-56.
[16]
{16} C. Hollot, V. Misra, D. Towsley, and W. Gong, "A control theoretic analysis of RED," in Proc. IEEE INFOCOM, 2001, vol. 3, pp. 1510-1519.
[17]
{17} V. Jacobson, "Congestion avoidance and control," in Proc. ACM SIGCOMM , Aug. 1988, pp. 314-329.
[18]
{18} H. Jamjoom, P. Pillai, and K. G. Shin, "Resynchronization and controllability of bursty service requests," IEEE/ACM Trans. Netw., vol. 12, no. 4, pp. 582-594, Aug. 2004.
[19]
{19} H. Jamjoom and K. G. Shin, "Persistent dropping: an efficient control of traffic aggregates," in Proc. ACM SIGCOMM, Karlsruhe, Germany, Aug. 2003, pp. 287-298.
[20]
{20} J. Jung, B. Krishnamurthy, and M. Rabinovich, "Flash crowds and denial of service attacks: characterization and implications for CDNs and web sites," in Proc. 11th Int. World Wide Web Conf., Honolulu, HI, May 2002, pp. 252-262.
[21]
{21} J. Lemon, "Resisting SYN flood DoS attacks with a SYN cache," presented at the BSDCon 2002, San Francisco, CA, Feb. 2002.
[22]
{22} R. Mahajan, S. M. Bellovin, S. Floyd, J. Ioannidis, V. Paxson, and S. Shenker, "Controlling high bandwidth aggregates in the network," ACM SIGCOMM Comput. Commun. Rev., vol. 32, no. 3, pp. 62-73, Jul. 2002.
[23]
{23} F. Marie, Netfilter Extensions HOWTO. {Online}. Available: http:// www.netfilter.org.
[24]
{24} R. Morris and D. Lin, "Variance of aggregated web traffic," in Proc. IEEE INFOCOM, 2000, vol. 1, pp. 360-366.
[25]
{25} D. Mosberger and T. Jin, "httperf: a tool for measuring web server performance," Perform. Eval. Rev., vol. 26, no. 3, pp. 31-37, Dec. 1998.
[26]
{26} J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, "Modeling TCP throughput: a simple model and its empirical validation," in Proc. ACM SIGCOMM, 1998, pp. 303-314.
[27]
{27} J. Pahdye and S. Floyd, "On inferring TCP behavior," in Proc. 2001 Conf. Applications, Technologies, Architectures, and Protocols for Computer Communications, 2001, pp. 287-298.
[28]
{28} V. Paxon, "End-to-end Internet packet dynamics," in Proc. ACM SIGCOMM , 1997, pp. 139-152.
[29]
{29} J. Reumann, H. Jamjoom, and K. Shin, "Adaptive packet filters," in Proc. IEEE GLOBECOM, Nov. 2001, pp. 2331-2335.
[30]
{30} S. Sahu, P. Nain, C. Diot, V. Firoiu, and D. F. Towsley, "On achievable service differentiation with token bucket marking for TCP," in Proc. Measurement and Modeling of Computer Systems, 2000, pp. 23-33.
[31]
{31} S. Sarvotham, R. Riedi, and R. Baraniuk, "Connection-level analysis and modeling of network traffic," in Proc. ACM SIGCOMM Internet Measurment Workshop, Nov. 2001, pp. 99-103.
[32]
{32} H. Zhang and D. Ferrari, "Rate-controlled static priority queueing," in Proc. IEEE INFOCOM, San Francisco, CA, 1993, pp. 227-236.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking  Volume 14, Issue 2
April 2006
217 pages

Publisher

IEEE Press

Publication History

Published: 01 April 2006
Published in TON Volume 14, Issue 2

Author Tags

  1. active queue management
  2. aggregate traffic control
  3. flash crowds
  4. persistent dropping

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 172
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 12 Feb 2025

Other Metrics

Citations

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media