Dynamic TCP acknowledgement and other stories about e/(e - 1)

Algorithmica (New York)

Volumn 36, Issue 3, 2003, Pages 209-224

  Karlin, Anna R ^a   Kenyon, Claire ^b   Randall, Dana ^c  

^a University of Washington   (United States)

^b ÉCOLE POLYTECHNIQUE   (France)

^c Georgia Institute of Technology   (United States)

Author keywords

Basis inputs; Online algorithms; Ski rental; TCP acknowledgment

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); COSTS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; ONLINE SYSTEMS; PACKET SWITCHING; PROBABILITY DENSITY FUNCTION; PURCHASING; RANDOM PROCESSES; THEOREM PROVING;

BASIS INPUTS; ONLINE ALGORIHTM; RANDOMIZED ALGORITHM; SKI RENTAL PROBLEM;

ALGORITHMS;

EID: 0942268508     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1013-x     Document Type: Article

References (12)

1. S. Albers. Better bounds for online scheduling. SIAM Journal on Computing, 29: 459-473, 1999. Preliminary version in Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC 97), pp. 130-139, 1997.
2. A. Borodin and R. El Yaniv. Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, 1998. ISBN: 0521563925
3. D. R. Dooly, S. A. Goldman and S. D. Scott. TCP dynamic acknowledgment delay: theory and practice. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (STOC), Dallas, TX, pp. 389-398, 1998.
4. D. R. Dooly, S. A. Goldman and S. D. Scott. On-line analysis of the TCP acknowledgment delay problem. Journal of the ACM, 48: 243-273, 2001.
5. R. Fleischer. On the Bahncard problem. Theoretical Computer Science, 268: 161-174, 2001. Preliminary version appeared in Proceedings of the 4th Annual International Computing and Combinatorics Conference (COCOON-98), Taipei, August 12-14, 1998, pp. 65-74. LNCS 1449. Springer-Verlag, Berlin, 1998.
6. R. L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45: 1563-1581, 1966.
7. A. R. Karlin, M. S. Manasse, L. A. McGeoch, and S. Owicki. Competitive randomized algorithms for non-uniform problems. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 22-24 January 1990, pp. 301-309.
8. Algorithmica, 11(6): 542-571, 1994.
9. A. R. Karlin, M. Manasse, L. Rudolph and D. Sleator. Competitive snoopy caching. Algorithmica, 3(1): 79-119, 1988.
10. J. Noga. Private communication, 2000.
11. J. Noga and S. S. Seiden. Private communication, 2000.
12. S. S. Seiden. A guessing game and randomized online algorithms. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing (STOC), Portland, OR, pp. 592-601, 2000.