TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

RACK: a time-based fast loss detection algorithm for TCP (2018)

36 pointsby Cieplakover 6 years ago

4 comments

keithwinsteinover 6 years ago
This is a great way to detect non-tail losses, and should definitely be a part of TCP implementations. I hope this gets turned into an RFC and pushed through the standards process and widely deployed.<p>I do hesitate a bit about Google calling it a &quot;new loss detection algorithm&quot; and talking about how &quot;the key innovation in RACK is to use a per-packet transmission timestamp.&quot; The same approach was previously described by Sprout in 2013, and I&#x27;d bet by a lot of other people before that. (&quot;The assumption underlying this method is that while the network may reorder packets, it will not reorder two packets that were sent more than 10 ms apart. Thus, once the receiver actually gets a packet from the sender, it can mark all bytes (up to the sequence number of the first packet sent within 10 ms) as received or lost, and only keep track of more recent packets.&quot; <a href="https:&#x2F;&#x2F;www.usenix.org&#x2F;system&#x2F;files&#x2F;conference&#x2F;nsdi13&#x2F;nsdi13-final113.pdf" rel="nofollow">https:&#x2F;&#x2F;www.usenix.org&#x2F;system&#x2F;files&#x2F;conference&#x2F;nsdi13&#x2F;nsdi13...</a>) The IRTF awarded this one of their Applied Networking Research Prizes that year, so it&#x27;s not like it was totally just on the academic plane.<p>Which is not to say Google isn&#x27;t making 90% of the important contribution by measuring and documenting how valuable this is in real life, defining and implementing it in the context of TCP, standardizing it, getting an RFC, etc. It&#x27;s just not quite as new as the I-D seems to suggest.
评论 #18944749 未加载
评论 #18945912 未加载
peter_d_shermanover 6 years ago
&quot;The main idea behind RACK is that if a packet has been delivered out of order, then the packets sent chronologically before that were either lost or reordered. This concept is not fundamentally different from [RFC5681][RFC3517][FACK]. But the key innovation in RACK is to use a per-packet transmission timestamp and widely deployed SACK options to conduct time-based inferences instead of inferring losses with packet or sequence counting approaches.&quot;<p>Conjecture: This, at scale, plus machine learning, might grant some insights (or at least variables that statistically strongly correlate to different conditions) about network segments that were previously not known or understood...
londons_exploreover 6 years ago
I feel like the days of &quot;we hand-crafted this algorithm to solve this issue as well as we could&quot; like this RFC are over.<p>Instead, simply give the issue to a neural network whose loss function is to find the best strategy for timing packets to minimize retransmissions and delay. Then train that on the real internet, and preload the resulting mini neural networks in operating systems.<p>For extra bonus points, implement the trainer too, so the networks behaviour can be auto-tweaked at runtime to improve performance based on local scenarios.
ggmover 6 years ago
Solves different problem to BBR but I wonder how it stacks up against BBR in e2e performance on the Long haul?
评论 #18945462 未加载