arXiv (All)
open access
Simultaneous Competitive and Regret Guarantees for TCP Acknowledgment
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 tha
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Dynamic TCP pacing for Delay Intolerant Cloud Communications#955880
- Online TCP Acknowledgment Under General Delays / Sujoy Bhore, Michał Pawłowski, Seeun William Umboh#1188600
- Dynamic Content Caching with Waiting Costs via Restless Multi-Armed Bandits#1064865
- Improving TCP's Robustness to Blind In-Window Attacks#501310
- Adding Acknowledgement Congestion Control to TCP#220702
Record · ID 1297923
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive