On the remote server problem or more about TCP acknowledgments
From MaRDI portal
Publication:861268
DOI10.1016/j.tcs.2006.09.003zbMath1140.68551OpenAlexW1988135010MaRDI QIDQ861268
Leah Epstein, Alexander Kesselman
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.003
Analysis of algorithms (68W40) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items
Optimally competitive list batching ⋮ Parameter learning algorithm for the online data acknowledgment problem
Cites Work
- Unnamed Item
- Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
- Nearly optimal strategies for special cases of on-line capital investment.
- On capital investment.
- Combining request scheduling with web caching
- The k-Client Problem
- A guessing game and randomized online algorithms
- On-line analysis of the TCP acknowledgment delay problem
- Competitive algorithms for server problems
- On the k -server conjecture
- Dynamic TCP Acknowledgment: Penalizing Long Delays
- On the Bahncard problem