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/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n13https://global.dbpedia.org/id/
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/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
n17http://c3lab.poliba.it/

Statements

Subject Item
dbr:TCP_Westwood
rdf:type
dbo:VideoGame
rdfs:label
TCP Westwood
rdfs:comment
TCP Westwood (TCPW) is a sender-side-only modification to TCP New Reno that is intended to better handle large bandwidth-delay product paths (large pipes), with potential packet loss due to transmission or other errors (leaky pipes), and with dynamic load (dynamic pipes).
dcterms:subject
dbc:TCP_congestion_control
dbo:wikiPageID
2256504
dbo:wikiPageRevisionID
1109248250
dbo:wikiPageWikiLink
dbr:Bandwidth-delay_product dbr:University_of_California,_Los_Angeles dbc:TCP_congestion_control dbr:Bandwidth_(computing) dbr:Westwood,_Los_Angeles dbr:Wireless_network dbr:TCP_congestion_control dbr:TCP_New_Reno dbr:Saverio_Mascolo dbr:Transmission_Control_Protocol dbr:Aliasing dbr:Low-pass_filter dbr:Protocol_stack dbr:Congestion_control dbr:TCP_congestion_avoidance_algorithm dbr:TCP_Reno dbr:Italy dbr:Congestion_window dbr:Larry_L._Peterson dbr:Linux
dbo:wikiPageExternalLink
n17:index.php%3Ftitle=Westwood
owl:sameAs
n13:4vtnW wikidata:Q7669752 freebase:m.06zqbr
dbp:wikiPageUsesTemplate
dbt:Short_description dbt:Reflist dbt:TOC_right
dbo:abstract
TCP Westwood (TCPW) is a sender-side-only modification to TCP New Reno that is intended to better handle large bandwidth-delay product paths (large pipes), with potential packet loss due to transmission or other errors (leaky pipes), and with dynamic load (dynamic pipes). TCP Westwood relies on mining the ACK stream for information to help it better set the congestion control parameters: Slow Start Threshold (ssthresh), and Congestion Window (cwin). In TCP Westwood, an "Eligible Rate" is estimated and used by the sender to update ssthresh and cwin upon loss indication, or during its "Agile Probing" phase, a proposed modification to the well-known slow start phase. In addition, a scheme called Persistent Non Congestion Detection (PNCD) has been devised to detect persistent lack of congestion and induce an Agile Probing phase to expeditiously utilize large dynamic bandwidth. The resultant performance gains in efficiency, without undue sacrifice of fairness, friendliness, and stability have been reported in numerous papers that can be found on The TCP WESTWOOD Home Page. Significant efficiency gains can be obtained for large leaky dynamic pipes, while maintaining fairness. Under a more appropriate criterion for friendliness, i.e. "opportunistic friendliness", TCP Westwood is shown to have good, and controllable, friendliness.
gold:hypernym
dbr:Modification
prov:wasDerivedFrom
wikipedia-en:TCP_Westwood?oldid=1109248250&ns=0
dbo:wikiPageLength
5102
foaf:isPrimaryTopicOf
wikipedia-en:TCP_Westwood