Karn's algorithm
id:
karn-s-algorithm-193-13046411
title:
Karn's algorithm
text:
Karn's algorithm addresses the problem of getting accurate estimates of the round-trip time for messages when using the Transmission Control Protocol (TCP) in computer networking. The algorithm, also sometimes termed as the Karn-Partridge algorithm was proposed in a paper by Phil Karn and Craig Partridge in 1987. Accurate round trip estimates in TCP can be difficult to calculate because of an ambiguity created by retransmitted segments. The round trip time is estimated as the difference between
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Karn%27s_algorithm
date created:
date modified:
2023-01-16T19:51:22Z
main entity:
{"identifier":"Q2835797","url":"https://www.wikidata.org/entity/Q2835797"}
image:
fields total:
13
integrity:
13