On-line analysis of the TCP acknowledgment delay problem
From MaRDI portal
acknowledgment delay problemcompetitive analysisinternet traffic simulationslookaheadtransmission control protocol (TCP)
Internet topics (68M11) Network protocols (68M12) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic network models in operations research (90B10) Dynamic programming (90C39)
Recommendations
- scientific article; zbMATH DE number 1775424
- A faster off-line algorithm for the TCP acknowledgement problem.
- Dynamic TCP Acknowledgment: Penalizing Long Delays
- scientific article; zbMATH DE number 2079320
- Delay-based TCP congestion avoidance: A network calculus interpretation and performance improvements
- Towards more complete models of TCP latency and throughput
- Dynamic TCP acknowledgement and other stories about e/(e-1)
- Dynamic TCP acknowledgment and other stories about e/(e-1)
Cited in
(28)- Dynamic TCP acknowledgment with sliding window
- Data aggregation in sensor networks: Balancing communication and delay costs
- Nearly optimal strategies for special cases of on-line capital investment.
- A faster off-line algorithm for the TCP acknowledgement problem.
- Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
- New results on multi-level aggregation
- On bin packing with clustering and bin packing with delays
- A new model for the linear 1-dimensional online clustering problem
- Parameter learning algorithm for the online data acknowledgment problem
- On Time Lookahead Algorithms for the Online Data Acknowledgement Problem
- Price fluctuations: to buy or to rent
- Online data clustering algorithms in an RTLS system
- A competitive analysis for retransmission timeout
- Dynamic TCP acknowledgment in the LogP model
- scientific article; zbMATH DE number 2079320 (Why is no real title available?)
- scientific article; zbMATH DE number 1775424 (Why is no real title available?)
- Online Algorithms for Multilevel Aggregation
- Dynamic TCP acknowledgement and other stories about e/(e-1)
- Dynamic TCP Acknowledgment: Penalizing Long Delays
- Dynamic batching of online arrivals to leverage economies of scale
- Universal optimization for non-clairvoyant subadditive joint replenishment
- MPMD on two sources with lookahead
- Universal optimization for non-clairvoyant subadditive joint replenishment
- Online multi-level aggregation with delays and stochastic arrivals
- Online matching with delays and size-based costs
- Optimally competitive list batching
- On the remote server problem or more about TCP acknowledgments
- TCP is competitive with resource augmentation
This page was built for publication: On-line analysis of the TCP acknowledgment delay problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196616)
