Dynamic TCP acknowledgment in the LogP model
From MaRDI portal
Publication:4458887
DOI10.1016/S0196-6774(03)00058-0zbMath1091.68011MaRDI 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
On-line algorithms; Competitive ratio; Randomized algorithm; Flow-time; Deterministic algorithm; Dynamic TCP acknowledgement; Packet bundling
68W05: Nonnumerical algorithms
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W20: Randomized algorithms
Related Items
Online Algorithms for Multilevel Aggregation, Optimally competitive list batching, Dynamic TCP acknowledgment with sliding window, Parameter learning algorithm for the online data acknowledgment problem