A competitive analysis for retransmission timeout

DOI10.1002/(SICI)1097-0037(199908)34:1%3C73::AID-NET8%3E3.0.CO;2-3MaRDI QIDQ4262699zbMATH OpenOpenAlexFDO

Authors Shlomi Dolev, Michael Kate, Jennifer L. Welch

Publication date 23 November 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199908)34:1%3C73::aid-net8%3E3.0.co;2-3

zbMATH Keywords

competitive analysisnetworkreliable communicationretransmission timeout

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• On-line analysis of the TCP acknowledgment delay problem
• scientific article; zbMATH DE number 1775424
• TCP is competitive with resource augmentation
• New lower and upper bounds for the competitive ratio of transmission protocols

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On-line load balancing with applications to machine scheduling and virtual circuit routing

Cited in

(5)

• An algorithm to detect TCP spurious timeouts and its application to operational UMTS/GPRS networks
• scientific article; zbMATH DE number 3866332 (Why is no real title available?)
• Distribution of the number of retransmissions of bounded documents
• scientific article; zbMATH DE number 6469200 (Why is no real title available?)
• Why TCP timers (still) don't work well

This page was built for publication: A competitive analysis for retransmission timeout

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