On Time Lookahead Algorithms for the Online Data Acknowledgement Problem

DOI10.1007/978-3-540-74456-6_27MaRDI QIDQ3525577zbMATH OpenOpenAlexFDO

Authors Tamás Németh, Csanád Imreh

Publication date 17 September 2008

Published in Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74456-6_27

zbMATH Keywords

online algorithmslookaheaddata acknowledgement

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• On-line analysis of the TCP acknowledgment delay problem
• scientific article; zbMATH DE number 2079320
• Dynamic TCP Acknowledgment: Penalizing Long Delays
• scientific article; zbMATH DE number 1775424
• Online scheduling of packets with agreeable deadlines

Cited in

(3)

• A new model for the linear 1-dimensional online clustering problem
• Exact distributional analysis of online algorithms with lookahead
• Parameter learning algorithm for the online data acknowledgment problem

This page was built for publication: On Time Lookahead Algorithms for the Online Data Acknowledgement Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525577)