English(EN) Simultaneous Competitive and Regret Guarantees for TCP Acknowledgment

新算法为TCP确认提供竞争和遗憾保证

作者 PulseAugur 编辑部 · [1 个来源] · 2026-10-12 04:00

一篇新发表在arXiv上的研究论文详细介绍了一种随机在线算法，旨在优化传输控制协议（TCP）确认。该算法通过平衡竞争保证和遗憾来最小化总确认和等待成本。它实现了最多为离线最优成本 $2+\varepsilon$ 倍的竞争比，并提供了一个期望遗憾界限 $O(\sqrt{\mathrm{OPT}\log(k+1)}+\log(1/\varepsilon))$，其中 $\varepsilon$ 是一个介于0和1之间的参数。 AI

影响这项研究可能带来更高效的网络通信协议，从而间接惠及依赖于可靠数据传输的AI应用。

排序理由该条目是一篇发表在arXiv上的研究论文，详细介绍了一种新算法。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 4 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该条目是一篇发表在arXiv上的研究论文，详细介绍了一种新算法。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: Standard; On-topic for AI-industry coverage; kept in the public index.
Story freshness: Same-day; Cluster formed today. Ranking reflects the current source set at time of score.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv cs.LG TIER_1 English(EN) · Tsubasa Harada, Yasushi Kawase, Hanna Sumita · 2026-10-12 04:00

TCP 确认的同步竞争和遗憾保证

arXiv:2610.13571v1 Announce Type: new Abstract: We study simultaneous competitive and regret guarantees for TCP acknowledgment. Each acknowledgment serves all pending packets, and the objective is to minimize the total acknowledgment and waiting costs. It is well known that no de…

本文如何被排名

报道来源 [1]

TCP 确认的同步竞争和遗憾保证

相关实体

相关话题