Average slowdown competitive analysis of the AAIMD algorithm

MaRDI QIDQ5322646zbMATH OpenFDO

Authors Zhiying Yang

Publication date 22 July 2009

zbMATH Keywords

average slowdownflow timeonline schedulingslowdown

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms (68W40)

Recommendations

• On the competitiveness of AIMD-TCP within a general network
• LATIN 2004: Theoretical Informatics
• Asymptotic analysis of a nonlinear AIMD algorithm
• TCP is competitive with resource augmentation
• Loss strategies for competing AIMD flows

Cited in

(1)

• On the competitiveness of AIMD-TCP within a general network

This page was built for publication: Average slowdown competitive analysis of the AAIMD algorithm

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