About: Robust random early detection

An Entity of Type: Abstraction100002137, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Robust random early detection (RRED) is a queueing disclipine for a network scheduler. The existing random early detection (RED) algorithm and its variants are found vulnerable to emerging attacks, especially the Low-rate Denial-of-Service attacks (LDoS). Experiments have confirmed that the existing RED-like algorithms are notably vulnerable under LDoS attacks due to the oscillating TCP queue size caused by the attacks.

Property	Value
dbo:abstract	Robust random early detection (RRED) is a queueing disclipine for a network scheduler. The existing random early detection (RED) algorithm and its variants are found vulnerable to emerging attacks, especially the Low-rate Denial-of-Service attacks (LDoS). Experiments have confirmed that the existing RED-like algorithms are notably vulnerable under LDoS attacks due to the oscillating TCP queue size caused by the attacks. The Robust RED (RRED) algorithm was proposed to improve the TCP throughput against LDoS attacks. The basic idea behind the RRED is to detect and filter out attack packets before a normal RED algorithm is applied to incoming flows. RRED algorithm can significantly improve the performance of TCP under Low-rate denial-of-service attacks. (en)
dbo:wikiPageExternalLink	http://sites.google.com/site/cwzhangres/home/posts/aqmdossimulationplatform http://sites.google.com/site/cwzhangres/home/posts/recentpublicationsinactivequeuemanagementaqmschemes http://sites.google.com/site/cwzhangres/home/posts/recentpublicationsinlow-ratedosattacks http://sites.google.com/site/cwzhangres/home/posts/recentpublicationsinrandomearlydetectionredschemes
dbo:wikiPageID	31989670 (xsd:integer)
dbo:wikiPageLength	4745 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1061189858 (xsd:integer)
dbo:wikiPageWikiLink	dbr:Denial-of-service_attack dbr:Active_queue_management dbc:Packets_(information_technology) dbc:Computer_network_security dbr:Random_early_detection dbc:Network_performance dbc:Denial-of-service_attacks dbr:Network_scheduler
dbp:wikiPageUsesTemplate	dbt:Reflist
dcterms:subject	dbc:Packets_(information_technology) dbc:Computer_network_security dbc:Network_performance dbc:Denial-of-service_attacks
rdf:type	yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Attack100972621 yago:Event100029378 yago:Operation100955060 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:WikicatDenial-of-serviceAttacks
rdfs:comment	Robust random early detection (RRED) is a queueing disclipine for a network scheduler. The existing random early detection (RED) algorithm and its variants are found vulnerable to emerging attacks, especially the Low-rate Denial-of-Service attacks (LDoS). Experiments have confirmed that the existing RED-like algorithms are notably vulnerable under LDoS attacks due to the oscillating TCP queue size caused by the attacks. (en)
rdfs:label	Robust random early detection (en)
owl:sameAs	freebase:Robust random early detection yago-res:Robust random early detection wikidata:Robust random early detection https://global.dbpedia.org/id/4udHb
prov:wasDerivedFrom	wikipedia-en:Robust_random_early_detection?oldid=1061189858&ns=0
foaf:isPrimaryTopicOf	wikipedia-en:Robust_random_early_detection
is dbo:wikiPageRedirects of	dbr:RRED dbr:Robust_Random_Early_Detection dbr:Robust_red
is dbo:wikiPageWikiLink of	dbr:Active_queue_management dbr:Network_congestion dbr:Network_scheduler dbr:RRED dbr:Robust_Random_Early_Detection dbr:Robust_red
is foaf:primaryTopic of	wikipedia-en:Robust_random_early_detection