Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Introduction to algorithms
Observing TCP dynamics in real networks
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
The case for persistent-connection HTTP
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
End-to-end Internet packet dynamics
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Eliminating receive livelock in an interrupt-driven kernel
ACM Transactions on Computer Systems (TOCS)
Modeling the performance of HTTP over several transport protocols
IEEE/ACM Transactions on Networking (TON)
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The changing nature of network traffic: scaling phenomena
ACM SIGCOMM Computer Communication Review
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Dynamics of IP traffic: a study of the role of variability and the impact of control
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On achievable service differentiation with token bucket marking for TCP
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Connection-level analysis and modeling of network traffic
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Inferring client response time at the web server
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Flash crowds and denial of service attacks: characterization and implications for CDNs and web sites
Proceedings of the 11th international conference on World Wide Web
Discrete Mathematics
Controlling high bandwidth aggregates in the network
ACM SIGCOMM Computer Communication Review
The BLUE active queue management algorithms
IEEE/ACM Transactions on Networking (TON)
Resisting SYN flood DoS attacks with a SYN cache
BSDC'02 Proceedings of the BSD Conference 2002 on BSD Conference
Taming IP packet flooding attacks
ACM SIGCOMM Computer Communication Review
Resynchronization and controllability of bursty service requests
IEEE/ACM Transactions on Networking (TON)
Defending Against Flash Crowds and Malicious Traffic Attacks with An Auction-Based Method
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Flash crowd mitigation via adaptive admission control based on application-level observations
ACM Transactions on Internet Technology (TOIT)
Understanding the management of client perceived response time
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
On the role and controllability of persistent clients in traffic aggregates
IEEE/ACM Transactions on Networking (TON)
Acceptable strategies for improving web server performance
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Botz-4-sale: surviving organized DDoS attacks that mimic flash crowds
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Comparing the performance of web server architectures
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Towards user-centric metrics for denial-of-service measurement
Proceedings of the 2007 workshop on Experimental computer science
A user-centric metric for denial-of-service measurement
ecs'07 Experimental computer science on Experimental computer science
FatVAP: aggregating AP backhaul capacity to maximize throughput
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Eve: a measurement-centric emulation environment for adaptive internet servers
SpringSim '07 Proceedings of the 2007 spring simulaiton multiconference - Volume 1
Quality assurance for evidence collection in network forensics
WISA'06 Proceedings of the 7th international conference on Information security applications: PartI
Quality assurance evidence collection model for MSN forensics
Journal of Intelligent Manufacturing
Hi-index | 0.00 |
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 building a coherent model of 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.