scientific article; zbMATH DE number 2079320

MaRDI QIDQ4471273zbMATH OpenFDO

Authors Susanne Albers, Helge Bals

Publication date 28 July 2004

zbMATH Keywords

randomized online algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)

Recommendations

• Dynamic TCP Acknowledgment: Penalizing Long Delays
• On-line analysis of the TCP acknowledgment delay problem
• scientific article; zbMATH DE number 1775424
• On the remote server problem or more about TCP acknowledgments
• Dynamic TCP acknowledgement and other stories about e/(e-1)

Cited in

(16)

• Dynamic TCP acknowledgment with sliding window
• Dynamic TCP acknowledgment and other stories about e/(e-1)
• A faster off-line algorithm for the TCP acknowledgement problem.
• Competitive analysis for the on-line truck transportation problem
• On randomizing the sending times in TCP and other window based algorithms
• scientific article; zbMATH DE number 2084344 (Why is no real title available?)
• On-line analysis of the TCP acknowledgment delay problem
• On Time Lookahead Algorithms for the Online Data Acknowledgement Problem
• Dynamic TCP Acknowledgment with Sliding Window
• Dynamic TCP acknowledgment in the LogP model
• scientific article; zbMATH DE number 1775424 (Why is no real title available?)
• scientific article; zbMATH DE number 2119708 (Why is no real title available?)
• Dynamic TCP acknowledgement and other stories about e/(e-1)
• Dynamic TCP Acknowledgment: Penalizing Long Delays
• Optimally competitive list batching
• On the remote server problem or more about TCP acknowledgments

This page was built for publication:

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