Construct · 1 fields · 1 citations

Karn's algorithm: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Karn'salgorithm1 CONSTRUCTKarn's algorithmKARN · COMPUTER NETWORKING

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computer networking

the rule that round-trip time samples from retransmitted segments are discarded and the retransmission timer is backed off until an unambiguous sample arrives.

In computer networking, Karn's algorithm refers to the rule that round-trip time samples from retransmitted segments are discarded and the retransmission timer is backed off until an unambiguous sample arrives. This meaning comes from Karn (1987) in ACM SIGCOMM Computer Communication Review.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Karn's algorithm sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

latency4 fields · 4 citationsjingle · one word, four constructssample3 fields · 3 citationsjingle · one word, three constructs

References

  1. Karn, P., & Partridge, C. (1987). Improving round-trip time estimates in reliable transport protocols. ACM SIGCOMM Computer Communication Review, 17(5), 2-7. https://doi.org/10.1145/55483.55484

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct