Dynamic TCP Acknowledgment: Penalizing Long Delays
From MaRDI portal
Recommendations
Cited in
(20)- Dynamic TCP acknowledgment with sliding window
- Data aggregation in sensor networks: Balancing communication and delay costs
- Dynamic TCP acknowledgment and other stories about e/(e-1)
- A faster off-line algorithm for the TCP acknowledgement problem.
- On bin packing with clustering and bin packing with delays
- A new model for the linear 1-dimensional online clustering problem
- On randomizing the sending times in TCP and other window based algorithms
- scientific article; zbMATH DE number 2084344 (Why is no real title available?)
- Parameter learning algorithm for the online data acknowledgment problem
- On-line analysis of the TCP acknowledgment delay problem
- On Time Lookahead Algorithms for the Online Data Acknowledgement Problem
- Dynamic TCP Acknowledgment with Sliding Window
- Online data clustering algorithms in an RTLS system
- 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?)
- scientific article; zbMATH DE number 2119708 (Why is no real title available?)
- Online Algorithms for Multilevel Aggregation
- Dynamic TCP acknowledgement and other stories about e/(e-1)
- On the remote server problem or more about TCP acknowledgments
This page was built for publication: Dynamic TCP Acknowledgment: Penalizing Long Delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470802)