Simultaneous Competitive and Regret Guarantees for TCP Acknowledgment

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 deterministic online algorithm achieves a competitive ratio better than 2. Given k randomized online experts and 00 is necessary for sublinear regret.

Source: arXiv cs.LG | 2026-10-12