DocumentCode
2719279
Title
Protecting Bursty Applications Against Traffic Aggressiveness
Author
Bremler-Barr, Anat ; Halachmi, Nir ; Levy, Hanoch
Author_Institution
Interdisciplinary Center, Efi Arazi Sch. of Comput. Sci., Herzliya
fYear
23006
fDate
19-21 June 23006
Firstpage
272
Lastpage
273
Abstract
In this paper a new mechanism called aggressiveness protective queuing (APQ), is described to control traffic in network devices. The method is based on the principles of the WFQ scheme and which uses dynamic weights for its operation. APQ uses a simple mechanism for tracking the resource usage by the flows and uses this accounting to properly and dynamically control the weights of WFQ. Also analytic results and simulation results are provided to demonstrate the effectiveness of APQ in controlling bursty traffic
Keywords
queueing theory; telecommunication control; telecommunication traffic; APQ mechanism; WFQ scheme; aggressiveness protective queuing; bursty traffic; waited fair queuing; Bandwidth; Computer crime; Computer science; Network servers; Protection; Telecommunication traffic; Time measurement; Traffic control; Web pages; Web server;
fLanguage
English
Publisher
ieee
Conference_Titel
Quality of Service, 2006. IWQoS 2006. 14th IEEE International Workshop on
Conference_Location
New Haven, CT
ISSN
1548-615X
Print_ISBN
1-4244-0476-2
Electronic_ISBN
1548-615X
Type
conf
DOI
10.1109/IWQOS.2006.250479
Filename
4015762
Link To Document