TCP dynamic acknowledgment delay (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

TCP dynamic acknowledgment delay (extended abstract): theory and practice

Full text

Pdf (1.44 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the thirtieth annual ACM symposium on Theory of computing table of contents

Dallas, Texas, United States

Pages: 389 - 398

Year of Publication: 1998

ISBN:0-89791-962-9

Authors

Daniel R. Dooly	Dept. of Computer Science, Washington University, St. Louis, MO
Sally A. Goldman	Dept. of Computer Science, Washington University, St. Louis, MO
Stephen D. Scott	Dept. of Computer Science, Washington University, St. Louis, MO

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 25, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/276698.276792 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Allan Borodin , Nathan Linial , Michael E. Saks, An optimal on-line algorithm for metrical task system, Journal of the ACM (JACM), v.39 n.4, p.745-763, Oct. 1992 [doi>10.1145/146585.146588]
	2	D. D. Clark. Window and aclmowledgment strategy in TOP. Internet Request for Comments 813, July 1982. http://v~, cis. ohio-state, edu/htbin/rf c/ rfcS1S.html.
	3	A. Costello and G. Varghese. Redesigning the BSD ca!lout and timer facilities. Technical Report WUCS-95-23, Washington University in St. Louis, November 1995. http://~,r~, cs. wastl, edu/cs/re chrep orts/ 1995 / wacs-95-23.ps, gz.
	4	R. Braden (Editor). Requirements for Internet hostscommunication layers. Internet Request for Comments 1122, Oct. 1989. http://www, cis. ohio-stato, edu/ htbin/xf c/rfcl122, html.
	5	Anna R. Karlin , Mark S. Manasse , Lyle A. McGeoch , Susan Owicki, Competitive randomized algorithms for non-uniform problems, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.301-309, January 22-24, 1990, San Francisco, California, United States
	6	A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator. Competitive snoopy caching. In Proceedings of the ~Tth Annual Symposium on Foundations of Com. purer Science, pages 244-254, 1986.
	7	A. R. Karlin, M. $. Manasse, L. Rudolph, and D. D. $1eator. Competitive snoopy caching. Algorithmica, 3(1):79-119, 1988.
	8	P. Krishnan, Philip M. Long, and Jeffrey Scott Vitter. Learning to make rent-to-buy decisions with systems applications. In Pros. i~th International Conference on Machine Learning, pages 322-330. Morgan Kaufmann, 1995.
	9	Vern Edward Paxson, Measurements and analysis of end-to-end Internet dynamics, University of California at Berkeley, Berkeley, CA, 1998
	10	Vern Paxson , Sally Floyd, Wide area traffic: the failure of Poisson modeling, IEEE/ACM Transactions on Networking (TON), v.3 n.3, p.226-244, June 1995 [doi>10.1109/90.392383]
	11	Daniel D. Sleator , Robert E. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, v.28 n.2, p.202-208, Feb. 1985 [doi>10.1145/2786.2793]
	12	W. Richard Stevens, TCP/IP illustrated (vol. 1): the protocols, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1993
	13	Tzuoo-Hawn Yeh , Cheng-Ming Kuo , Chin-Laung Lei , Hsu-Chun Yen, Competitive Analysis of On-Line Disk Scheduling, Proceedings of the 7th International Symposium on Algorithms and Computation, p.356-365, December 16-18, 1996

CITED BY 7

	Anna R. Karlin , Claire Kenyon , Dana Randall, Dynamic TCP acknowledgement and other stories about e/(e-1), Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.502-509, July 2001, Hersonissos, Greece
	Steven S. Seiden, A guessing game and randomized online algorithms, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.592-601, May 21-23, 2000, Portland, Oregon, United States
	Jeff Edmonds , Suprakash Datta , Patrick Dymond, TCP is competitive against a limited adversary, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, June 07-09, 2003, San Diego, California, USA
	John Noga , Steve Seiden , Gerhard J. Woeginger, A faster off-line algorithm for the TCP acknowledgement problem, Information Processing Letters, v.81 n.2, p.71-73, 31 January 2002
	Susanne Albers , Helge Bals, Dynamic TCP acknowledgement: penalizing long delays, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland
	Jens S. Frederiksen , Kim S. Larsen , John Noga , Patchrawat Uthaisombut, Dynamic TCP acknowledgment in the LogP model, Journal of Algorithms, v.48 n.2, p.407-428, September 2003
	N. Buchbinder , T. Kimbrelt , R. Levi , K. Makarychev , M. Sviridenko, Online make-to-order joint replenishment model: primal dual competitive algorithms, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, p.952-961, January 20-22, 2008, San Francisco, California