scientific article; zbMATH DE number 1775424
From MaRDI portal
Publication:4542557
Recommendations
Cited in
(26)- Dynamic TCP acknowledgment with sliding window
- Delay-based TCP congestion avoidance: A network calculus interpretation and performance improvements
- Dynamic TCP acknowledgment and other stories about e/(e-1)
- A faster off-line algorithm for the TCP acknowledgement problem.
- Online strategies for backups
- Optimal sliding-window strategies in networks with long round-trip delays
- Minimizing the waiting time for a one-way shuttle service
- 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
- A competitive analysis for retransmission timeout
- Dynamic TCP acknowledgment in the LogP model
- scientific article; zbMATH DE number 2079320 (Why is no real title available?)
- Dynamic TCP acknowledgement and other stories about e/(e-1)
- Dynamic TCP Acknowledgment: Penalizing Long Delays
- scientific article; zbMATH DE number 7651147 (Why is no real title available?)
- On the power of lookahead in online lot-sizing
- Improved and deterministic online service with deadlines or delay
- On the competitiveness of AIMD-TCP within a general network
- MPMD on two sources with lookahead
- Nearly-optimal algorithm for non-clairvoyant service with delay
- A tight lower bound for online service with deadlines and lazy server
- Combinatorics of TCP reordering
- 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 Q4542557)
