About: Additive increase/multiplicative decrease     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Rule106652242, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FAdditive_increase%2Fmultiplicative_decrease&invfp=IFP_OFF&sas=SAME_AS_OFF

The additive-increase/multiplicative-decrease (AIMD) algorithm is a feedback control algorithm best known for its use in TCP congestion control. AIMD combines linear growth of the congestion window when there is no congestion with an exponential reduction when congestion is detected. Multiple flows using AIMD congestion control will eventually converge to an equal usage of a shared link. The related schemes of multiplicative-increase/multiplicative-decrease (MIMD) and additive-increase/additive-decrease (AIAD) do not reach stability.

AttributesValues
rdf:type
rdfs:label
  • الزيادة الخطية/النقصان الضربي (ar)
  • Additive increase/multiplicative decrease (en)
  • AIMD (it)
  • AIMD (fr)
  • 和性增长/乘性降低 (zh)
rdfs:comment
  • الزيادة الخطية/النقصان الضربي (AIMD) هي خوارزمية للتحكم في اختناق الشبكة في بروتوكول التي سي بي. يقوم الخوارزم بزيادة الخطية لنافذة الاختناق (بإضافة 1) طالما لا يوجد اختناق. عند اكتشاف اختناق (مثل وصول ثلاث طرود تأكيد مكررة) تقوم الخوارزمية بإنقاص ضربي نافذة الاختناق (بالضرب في 1\2). من مزايا هذه الخوارزمية العدالة في توزيع السعة بين الوصلات المتنافسة. (ar)
  • The additive-increase/multiplicative-decrease (AIMD) algorithm is a feedback control algorithm best known for its use in TCP congestion control. AIMD combines linear growth of the congestion window when there is no congestion with an exponential reduction when congestion is detected. Multiple flows using AIMD congestion control will eventually converge to an equal usage of a shared link. The related schemes of multiplicative-increase/multiplicative-decrease (MIMD) and additive-increase/additive-decrease (AIAD) do not reach stability. (en)
  • La méthode augmentation additive/retrait multiplicatif (AIMD en anglais, pour additive increase/multiplicative decrease) est un algorithme utilisé par TCP pour éviter la congestion. Il alterne des phases de croissance linéaire de la vitesse de transmission et de brusques réductions en cas de congestion. (fr)
  • 和性增长/乘性降低(英語:additive-increase/multiplicative-decrease、AIMD)算法是一个反馈控制算法,最广为人知的用途是在TCP拥塞控制。AIMD将拥塞窗口的线性增长与监测到拥塞时的指数降低相结合。使用AIMD拥塞控制的多个流将最终收敛到使用等量的共享链路。乘性增长/乘性降低(MIMD)和加性增长/加性降低(AIAD)的相关方案无法达到稳定。 (zh)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • الزيادة الخطية/النقصان الضربي (AIMD) هي خوارزمية للتحكم في اختناق الشبكة في بروتوكول التي سي بي. يقوم الخوارزم بزيادة الخطية لنافذة الاختناق (بإضافة 1) طالما لا يوجد اختناق. عند اكتشاف اختناق (مثل وصول ثلاث طرود تأكيد مكررة) تقوم الخوارزمية بإنقاص ضربي نافذة الاختناق (بالضرب في 1\2). من مزايا هذه الخوارزمية العدالة في توزيع السعة بين الوصلات المتنافسة. (ar)
  • The additive-increase/multiplicative-decrease (AIMD) algorithm is a feedback control algorithm best known for its use in TCP congestion control. AIMD combines linear growth of the congestion window when there is no congestion with an exponential reduction when congestion is detected. Multiple flows using AIMD congestion control will eventually converge to an equal usage of a shared link. The related schemes of multiplicative-increase/multiplicative-decrease (MIMD) and additive-increase/additive-decrease (AIAD) do not reach stability. (en)
  • La méthode augmentation additive/retrait multiplicatif (AIMD en anglais, pour additive increase/multiplicative decrease) est un algorithme utilisé par TCP pour éviter la congestion. Il alterne des phases de croissance linéaire de la vitesse de transmission et de brusques réductions en cas de congestion. (fr)
  • 和性增长/乘性降低(英語:additive-increase/multiplicative-decrease、AIMD)算法是一个反馈控制算法,最广为人知的用途是在TCP拥塞控制。AIMD将拥塞窗口的线性增长与监测到拥塞时的指数降低相结合。使用AIMD拥塞控制的多个流将最终收敛到使用等量的共享链路。乘性增长/乘性降低(MIMD)和加性增长/加性降低(AIAD)的相关方案无法达到稳定。 (zh)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software