<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Model Predictive Congestion Control for TCP Endpoints · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2002.09825/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2002.09825/feed.xml" rel="self" type="application/rss+xml" /><item><title>Model Predictive Congestion Control for TCP Endpoints — mentioned by lambda-11235</title><link>https://news.ycombinator.com/item?id=22756982</link><guid isPermaLink="false">urn:hackerpapers:mention:2002.09825:22756982</guid><pubDate>Thu, 02 Apr 2020 07:40:46 GMT</pubDate><description>&lt;p&gt;This is an interesting point. I was recently working on research for how to apply model predictive control theory to TCP congestion control. We basically wanted to minimize latency while maximizing throughput. One of the challenges was that, while we could match latency and throughput set-points if known apriori, actually determining what the set-points should be was very difficult. Here&amp;#x27;s an early paper on it https://arxiv.org/abs/2002.09825. Note that if some of our control theory concepts seem a bit screwy, it&amp;#x27;s because we come from networking, not control theory :).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2002.09825/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NI</category></item></channel></rss>
