On-line analysis of the TCP acknowledgment delay problem
From MaRDI portal
competitive analysislookaheadtransmission control protocol (TCP)acknowledgment delay probleminternet traffic simulations
Deterministic network models in operations research (90B10) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Internet topics (68M11) Network protocols (68M12)
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
(26)- scientific article; zbMATH DE number 2079320 (Why is no real title available?)
- Online data clustering algorithms in an RTLS system
- Dynamic TCP Acknowledgment: Penalizing Long Delays
- MPMD on two sources with lookahead
- Optimally competitive list batching
- On the remote server problem or more about TCP acknowledgments
- New results on multi-level aggregation
- TCP is competitive with resource augmentation
- Dynamic TCP acknowledgement and other stories about e/(e-1)
- Dynamic TCP acknowledgment with sliding window
- Data aggregation in sensor networks: Balancing communication and delay costs
- scientific article; zbMATH DE number 1775424 (Why is no real title available?)
- Nearly optimal strategies for special cases of on-line capital investment.
- A new model for the linear 1-dimensional online clustering problem
- A faster off-line algorithm for the TCP acknowledgement problem.
- Price fluctuations: to buy or to rent
- Universal optimization for non-clairvoyant subadditive joint replenishment
- Dynamic batching of online arrivals to leverage economies of scale
- Parameter learning algorithm for the online data acknowledgment problem
- On bin packing with clustering and bin packing with delays
- Online Algorithms for Multilevel Aggregation
- Online multi-level aggregation with delays and stochastic arrivals
- Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
- On Time Lookahead Algorithms for the Online Data Acknowledgement Problem
- Dynamic TCP acknowledgment in the LogP model
- Universal optimization for non-clairvoyant subadditive joint replenishment
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)
