On time lookahead algorithms for the online data acknowledgement problem

Authors:
Csanád Imreh;Tamás Németh
Affiliations:
Department of Informatics, University of Szeged, Szeged, Hungary;Móra Ferenc Highschool, Szeged, Hungary
Venue:
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Year:
2007

Citing 9
Cited 0

TCP/IP illustrated (vol. 1): the protocols

TCP/IP illustrated (vol. 1): the protocols
Online computation and competitive analysis

Online computation and competitive analysis
A guessing game and randomized online algorithms

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On-line analysis of the TCP acknowledgment delay problem

Journal of the ACM (JACM)
A faster off-line algorithm for the TCP acknowledgement problem

Information Processing Letters
Dynamic TCP acknowledgment in the LogP model

Journal of Algorithms
Dynamic TCP Acknowledgment: Penalizing Long Delays

SIAM Journal on Discrete Mathematics
On the remote server problem or more about TCP acknowledgments

Theoretical Computer Science
On the power of lookahead in on-line vehicle routing problems

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we investigate such online algorithms for the data acknowledgement problem, which have extra information about the arrival time of the packets in the following time interval of length c. We present an algorithm with the smallest possible competitive ratio for the maximum of delay type objective function. In the case of the sum of delay type objective function we present an 1+O(1/c)-competitive algorithm. Moreover we show that no algorithm may have smaller competitive ratio than 1 + Ω(1/c2) in the case of that objective function.