论文信息 - Dynamic TCP Acknowledgment and Other Stories about e/(e - 1)

Dynamic TCP Acknowledgment and Other Stories about e/(e - 1)

AbstractWe present the first optimal randomized online algorithms for the TCP acknowledgment problem [3] and the Bahncard problem [5]. These problems are well known to be generalizations of the classical online ski-rental problem, however, they appeared to be harder. In this paper we demonstrate that a number of online algorithms which have optimal competitive ratios of e/(e-1) , including these, are fundamentally no more complex than ski rental. Our results also suggest a clear paradigm for solving ski-rental-like problems.

Claire Mathieu | Anna R. Karlin | Dana Randall | Dana Randall | Claire Mathieu

[1] Anna R. Karlin,et al. Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.

[2] Jirí Sgall. A Lower Bound for Randomized On-Line Multiprocessor Scheduling , 1997, Inf. Process. Lett..

[3] Gerhard J. Woeginger,et al. A Lower Bound for Randomized On-Line Scheduling Algorithms , 1994, Information Processing Letters.

[4] Susanne Albers,et al. Better bounds for online scheduling , 1997, STOC '97.

[5] David R. Karger,et al. A better algorithm for an ancient scheduling problem , 1994, SODA '94.

[6] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[7] Rudolf Fleischer. On the Bahncard problem , 2001, Theor. Comput. Sci..

[8] Sally A. Goldman,et al. On-line analysis of the TCP acknowledgment delay problem , 2001, JACM.

[9] Allan Borodin,et al. Online computation and competitive analysis , 1998 .

[10] Steven S. Seiden,et al. A guessing game and randomized online algorithms , 2000, STOC '00.

[11] Sally A. Goldman,et al. TCP Dynamic Acknowledgment Delay: Theory and Practice , 1998, STOC 1998.

[12] Rajeev Motwani,et al. Approximation techniques for average completion time scheduling , 1997, SODA '97.