Dynamic TCP acknowledgment in the LogP model

DOI10.1016/S0196-6774(03)00058-0zbMath1091.68011OpenAlexW2166602185MaRDI QIDQ4458887

John Noga, Kim S. Larsen, Patchrawat Uthaisombut, Jens S. Frederiksen

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

On-line algorithmsCompetitive ratioRandomized algorithmFlow-timeDeterministic algorithmDynamic TCP acknowledgementPacket bundling

Mathematics Subject Classification ID

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

Related Items (4)

Optimally competitive list batching ⋮ Online Algorithms for Multilevel Aggregation ⋮ Dynamic TCP acknowledgment with sliding window ⋮ Parameter learning algorithm for the online data acknowledgment problem

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