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

DOI10.1016/S0020-0190(01)00199-5zbMath1050.68012OpenAlexW2093202670MaRDI QIDQ1603523

Gerhard J. Woeginger, Steve Seiden, John 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)

Related Items

Dynamic TCP acknowledgment with sliding window ⋮ Parameter learning algorithm for the online data acknowledgment problem

Cites Work

• Geometric applications of a matrix-searching algorithm
• Sequence comparison with mixed convex and concave costs
• The concave least-weight subsequence problem revisited
• Unnamed Item

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