This HTML5 document contains 38 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n4http://sites.google.com/site/cwzhangres/home/posts/
n16https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Robust_random_early_detection
rdf:type
yago:Abstraction100002137 yago:Attack100972621 yago:PsychologicalFeature100023100 yago:WikicatDenial-of-serviceAttacks yago:Act100030358 yago:YagoPermanentlyLocatedEntity yago:Operation100955060 yago:Event100029378 yago:Activity100407535
rdfs:label
Robust random early detection
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.
dcterms:subject
dbc:Computer_network_security dbc:Network_performance dbc:Packets_(information_technology) dbc:Denial-of-service_attacks
dbo:wikiPageID
31989670
dbo:wikiPageRevisionID
1061189858
dbo:wikiPageWikiLink
dbr:Active_queue_management dbc:Denial-of-service_attacks dbr:Network_scheduler dbc:Network_performance dbc:Computer_network_security dbc:Packets_(information_technology) dbr:Random_early_detection dbr:Denial-of-service_attack
dbo:wikiPageExternalLink
n4:recentpublicationsinlow-ratedosattacks n4:recentpublicationsinrandomearlydetectionredschemes n4:aqmdossimulationplatform n4:recentpublicationsinactivequeuemanagementaqmschemes
owl:sameAs
wikidata:Q7353542 n16:4udHb yago-res:Robust_random_early_detection freebase:m.0gvv5gd
dbp:wikiPageUsesTemplate
dbt:Reflist
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.
prov:wasDerivedFrom
wikipedia-en:Robust_random_early_detection?oldid=1061189858&ns=0
dbo:wikiPageLength
4745
foaf:isPrimaryTopicOf
wikipedia-en:Robust_random_early_detection