Amortized efficiency of list update and paging rules
Communications of the ACM
Introduction to algorithms
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 2): the implementation
TCP/IP illustrated (vol. 2): the implementation
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Computer networks (3rd ed.)
Measurements and analysis of end-to-end Internet dynamics
Measurements and analysis of end-to-end Internet dynamics
Redesigning the BSD timer facilities
Software—Practice & Experience
Online bin packing with lookahead
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
Dynamic Programming
Dynamic TCP acknowledgement: penalizing long delays
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Control Message Aggregation in Group Communication Protocols
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Nearly optimal strategies for special cases of on-line capital investment
Theoretical Computer Science
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic TCP acknowledgment in the LogP model
Journal of Algorithms
On the remote server problem or more about TCP acknowledgments
Theoretical Computer Science
Energy-efficient algorithms for flow time minimization
ACM Transactions on Algorithms (TALG)
Tight bounds for delay-sensitive aggregation
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Dynamic TCP acknowledgment with sliding window
Theoretical Computer Science
Data aggregation in sensor networks: Balancing communication and delay costs
Theoretical Computer Science
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Optimally competitive list batching
Theoretical Computer Science
Data aggregation in sensor networks: balancing communication and delay costs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Energy-Efficient algorithms for flow time minimization
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Online function tracking with generalized penalties
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On time lookahead algorithms for the online data acknowledgement problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Dynamic tcp acknowledgment with sliding window
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Online control message aggregation in chain networks
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
ACM SIGACT News
Hi-index | 0.01 |
We study an on-line problem that is motivated by the networking problem of dynamically adjusting of acknowledgments in the Transmission Control Protocol (TCP). We provide a theoretical model for this problem in which the goal is to send acks at a time that minimize a linear combination of the cost for the number of acknowledgments sent and the cost for the additional latency introduced by delaying acknowledgments. To study the usefulness of applying packet arrival time prediction to this problem, we assume there is an oracle that provides the algorithm with the times of the next L arrivals, for some L ≥ 0.We give two different objective functions for measuring the cost of a solution, each with its own measure of latency cost. For each objective function we first give an O(n2)-time dynamic programming algorithm for optimally solving the off-line problem. Then we describe an on-line algorithm that greedily acknowledges exactly when the cost for an acknowledgment is less than the latency cost incurred by not acknowledging. We show that for this algorithm there is a sequence of n packet arrivals for which it is &OHgr; (***)-competitive for the first objective function, 2-competitive for the second function for L = 0, and 1-competitivefor the second function for L = 1. Next we present a second on-line algorithm which is a slight modification of the first, and we prove that it is 2-competitive for both objective functions for all L. We also give lower bounds on the competitive ratio for any deterministic on-line algorithm. These results show that for each objective function, at least one of our algorithms is optimal.Finally, we give some initial empirical results using arrival sequences from real network traffic where we compare the two methods used in TCP for acknowledgment delay with our two on-line algorithms. In all cases we examine performance with L = 0 and L = 1.