On the remote server problem or more about TCP acknowledgments

DOI10.1016/J.TCS.2006.09.003MaRDI QIDQ861268zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Alex 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

zbMATH Keywords

on-line algorithmsTCP acknowledgement

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• On-line analysis of the TCP acknowledgment delay problem
• scientific article; zbMATH DE number 1775424
• The online set aggregation problem
• Dynamic TCP Acknowledgment: Penalizing Long Delays
• scientific article; zbMATH DE number 2079320

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A guessing game and randomized online algorithms
• Combining request scheduling with web caching
• Competitive algorithms for server problems
• Dynamic TCP Acknowledgment: Penalizing Long Delays
• Dynamic TCP acknowledgment and other stories about e/(e-1)
• Nearly optimal strategies for special cases of on-line capital investment.
• On capital investment.
• On the k -server conjecture
• On the Bahncard problem
• On-line analysis of the TCP acknowledgment delay problem
• The \(k\)-client problem

Cited in

(5)

• scientific article; zbMATH DE number 2079320 (Why is no real title available?)
• Dynamic TCP Acknowledgment: Penalizing Long Delays
• Optimally competitive list batching
• A faster off-line algorithm for the TCP acknowledgement problem.
• Parameter learning algorithm for the online data acknowledgment problem

This page was built for publication: On the remote server problem or more about TCP acknowledgments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861268)