Dynamic TCP acknowledgment in the LogP model

DOI10.1016/S0196-6774(03)00058-0MaRDI QIDQ4458887zbMATH OpenOpenAlexFDO

Authors Jens S. Frederiksen, Kim S. Larsen, J. Noga, Patchrawat Uthaisombut

Publication date 14 March 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0196-6774(03)00058-0

zbMATH Keywords

Competitive ratioOn-line algorithmsRandomized algorithmFlow-timeDeterministic algorithmDynamic TCP acknowledgementPacket bundling

Mathematics Subject Classification ID

Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1775424
• Dynamic TCP acknowledgement and other stories about e/(e-1)
• Dynamic TCP Acknowledgment: Penalizing Long Delays
• On-line analysis of the TCP acknowledgment delay problem
• scientific article; zbMATH DE number 2079320

Cited in

(7)

• Dynamic TCP acknowledgment with sliding window
• Dynamic TCP Acknowledgment with Sliding Window
• scientific article; zbMATH DE number 1775424 (Why is no real title available?)
• Dynamic TCP acknowledgement and other stories about e/(e-1)
• Online Algorithms for Multilevel Aggregation
• Parameter learning algorithm for the online data acknowledgment problem
• Optimally competitive list batching

This page was built for publication: Dynamic TCP acknowledgment in the LogP model

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