ACM Home Page
Please provide us with feedback. Feedback
On the role and controllability of persistent clients in traffic aggregates
Full text PdfPdf (948 KB)
Source IEEE/ACM Transactions on Networking (TON) archive
Volume 14 ,  Issue 2  (April 2006) table of contents
Pages: 410 - 423  
Year of Publication: 2006
ISSN:1063-6692
Authors
Hani Jamjoom  IBM, T. J. Watson Research Center, Hawthorne, NY
Kang G. Shin  Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 29,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1109/TNET.2006.872547

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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
 
3
 
4
 
5
[5] N. Cardwell, S. Savage, and T. Anderson, "Modeling TCP latency," in Proc. IEEE INFOCOM, 2000, pp. 1742-1751.
 
6
 
7
[7] S. D. Committee, SPECweb Tech. Rep., Apr. 1999. [Online]. Available: http://www.specbench.org/osg/web/
 
8
 
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
11
12
 
13
 
14
15
 
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
 
18
19
20
 
21
22
 
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
26
27
28
 
29
[29] J. Reumann, H. Jamjoom, and K. Shin, "Adaptive packet filters," in Proc. IEEE GLOBECOM, Nov. 2001, pp. 2331-2335.
30
31
 
32
[32] H. Zhang and D. Ferrari, "Rate-controlled static priority queueing," in Proc. IEEE INFOCOM, San Francisco, CA, 1993, pp. 227-236.

Collaborative Colleagues:
Hani Jamjoom: colleagues
Kang G. Shin: colleagues