ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computer Networks
Volume 51, Issue 13, 12 September 2007, Pages 3864-3877
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (448 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comnet.2007.04.006    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Protecting bursty applications against traffic aggressiveness

Anat Bremler-Barra, Corresponding Author Contact Information, E-mail The Corresponding Author, Nir Halachmia, E-mail The Corresponding Author and Hanoch Levyb, E-mail The Corresponding Author

aSchool of Computer Science, The Interdisciplinary Center, Herzliya, Israel bSchool of Computer Science, Tel-Aviv University, Israel

Received 14 October 2006; 
revised 25 March 2007; 
accepted 5 April 2007. 
Responsible Editor: I.F. Akyildiz. 
Available online 21 April 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Aggressive use of networks, in particular the Internet, either by malicious or innocent users, threatens the service availability and quality of polite applications. Common queueing mechanisms which supposedly solve the problem, are shown in this work to be ineffective for bursty applications, including Web applications. This can be exploited by malicious users to conduct a new kind of Denial of Service attacks.

We propose a new traffic control mechanism called Aggressiveness Protective Queuing (APQ) which is based on attributing importance weights to the users and which solves this problem by dynamically decreasing the weight of the aggressive users. The actual weight used for a flow is a dynamically varying parameter reflecting the past bandwidth usage of the flow. We show that under heavy load (deterministic model), APQ significantly restricts the amount of traffic an aggressive user can send and bounds it, at most, to twice the amount of traffic sent by a polite (regular) user. Simulation results demonstrate the effectiveness of APQ under a stochastic environment.

Keywords: Security; Quality of Service; Denial of Service; Queuing

Article Outline

1. Introduction
2. Related work
3. WFQ: unfair service to bursty flows in the presence of aggressive users
3.1. Can a rate-limiter (in front of WFQ) resolve the problem?
4. Aggressiveness Protective Queuing (APQ)
5. Analysis of APQ
5.1. Queueing model
5.2. Vulnerability factor
5.3. Polite users
5.4. Naive aggressive users
5.5. Sophisticated aggressive users
5.6. Summary of analysis results
6. Stochastic environment: simulation results
7. Practical considerations
8. Concluding remarks
References
Vitae





Computer Networks
Volume 51, Issue 13, 12 September 2007, Pages 3864-3877
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.