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/c 2) in the case of that objective function.
This research has been supported by the Hungarian National Foundation for Scientific Research, Grant F048587.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albers, S., Bals, H.: Dynamic TCP acknowledgement: Penalizing long delays. SIAM J. Discrete Math. 19(4), 938–951 (2005)
Allulli, L., Ausiello, G., Laura, L.: On the power of lookahead in on-line vehicle routing problems. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 728–736. Springer, Heidelberg (2005)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Dooly, D.R., Goldman, S.A., Scott, S.D.: On-line analysis of the TCP acknowledgment delay problem. J. ACM 48(2), 243–273 (2001)
Epstein, L., Kesselman, A.: On the remote server problem or more about TCP acknowledgments. Theoretical Computer Science 369(1-3), 285–299 (2006)
Frederiksen, J.S., Larsen, K.S., Noga, J., Uthaisombut, P.: Dynamic TCP acknowledgment in the LogP model. Journal of Algorithms 48(2), 407–428 (2003)
Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP acknowledgement and other stories about e/(e-1). Algorithmica 36, 209–224 (2003)
Noga, J., Seiden, S.S., Woeginger, G.J.: A faster off-line algorithm for the TCP acknowledgement problem. Information Processing Letters 81(2), 71–73 (2002)
Seiden, S.S.: A guessing game and randomized online algorithms. In: Proceedings of STOC, pp. 592–601 (2000)
Stevens, W.R.: TCP/IP Illustrated. In: The protocols, vol. 1, Addison Wesley, Reading (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Imreh, C., Németh, T. (2007). On Time Lookahead Algorithms for the Online Data Acknowledgement Problem. In: Kučera, L., Kučera, A. (eds) Mathematical Foundations of Computer Science 2007. MFCS 2007. Lecture Notes in Computer Science, vol 4708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-74456-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74455-9
Online ISBN: 978-3-540-74456-6
eBook Packages: Computer ScienceComputer Science (R0)