A faster off-line algorithm for the TCP acknowledgement problem.

DOI10.1016/S0020-0190(01)00199-5MaRDI QIDQ1603523zbMATH OpenOpenAlexFDO

Authors S. S. Seiden, Gerhard J. Woeginger, J. Noga

Publication date 14 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(01)00199-5

zbMATH Keywords

Dynamic programmingNetworksTCP acknowledgementTransmission Control Protocol

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• scientific article; zbMATH DE number 1775424
• On the remote server problem or more about TCP acknowledgments
• On-line analysis of the TCP acknowledgment delay problem
• scientific article; zbMATH DE number 2079320
• Dynamic TCP Acknowledgment: Penalizing Long Delays

Cites work

• Geometric applications of a matrix-searching algorithm
• scientific article; zbMATH DE number 1775424 (Why is no real title available?)
• Sequence comparison with mixed convex and concave costs
• The concave least-weight subsequence problem revisited

Cited in

(5)

• Dynamic TCP acknowledgment with sliding window
• Parameter learning algorithm for the online data acknowledgment problem
• On-line analysis of the TCP acknowledgment delay problem
• scientific article; zbMATH DE number 1775424 (Why is no real title available?)
• Dynamic TCP acknowledgement and other stories about e/(e-1)

This page was built for publication: A faster off-line algorithm for the TCP acknowledgement problem.

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