On-line analysis of the TCP acknowledgment delay problem

DOI10.1145/375827.375843zbMath1323.68023OpenAlexW1992365371MaRDI QIDQ3196616

Stephen D. Scott, Sally A. Goldman, Daniel R. Dooly

Publication date: 30 October 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/375827.375843

zbMATH Keywords

competitive analysislookaheadtransmission control protocol (TCP)acknowledgment delay probleminternet traffic simulations

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12) Internet topics (68M11)

Related Items (14)

Optimally competitive list batching ⋮ On the remote server problem or more about TCP acknowledgments ⋮ Online data clustering algorithms in an RTLS system ⋮ Nearly optimal strategies for special cases of on-line capital investment. ⋮ Competitive analysis of organization networks or multicast acknowledgment: how much to wait? ⋮ Online Algorithms for Multilevel Aggregation ⋮ On bin packing with clustering and bin packing with delays ⋮ Price Fluctuations: To Buy or to Rent ⋮ New results on multi-level aggregation ⋮ A new model for the linear 1-dimensional online clustering problem ⋮ TCP is competitive with resource augmentation ⋮ Dynamic TCP acknowledgment with sliding window ⋮ Data aggregation in sensor networks: Balancing communication and delay costs ⋮ Parameter learning algorithm for the online data acknowledgment problem

This page was built for publication: On-line analysis of the TCP acknowledgment delay problem