Analysis of MIMD congestion control algorithm for high speed networks

DOI10.1016/J.COMNET.2004.11.025MaRDI QIDQ2485601zbMATH OpenOpenAlexFDO

Authors Eitan Altman, Chadi Barakat, Konstantin Avrachenkov, Arzad A. Kherani, Balakrishna Prabhu

Publication date 5 August 2005

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2004.11.025

zbMATH Keywords

Laplace-Stieltjes transformDiscrete time queuesMIMD congestion controlRandom lossesScalable TCP

Mathematics Subject Classification ID

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

Recommendations

• An ergodic AIMD algorithm with application to high-speed networks
• Design of active queue management system for Scalable TCP in high speed networks
• Distributed Computing – IWDC 2005
• Analysis and design of AIMD congestion control algorithms in communication networks
• Performance evaluation of TCP-BIAD in high-speed, long-distance networks

Cited in

(11)

• Transient Moments of the TCP Window Size Process
• An ergodic AIMD algorithm with application to high-speed networks
• Performance evaluation of TCP-BIAD in high-speed, long-distance networks
• Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm
• Design of active queue management system for Scalable TCP in high speed networks
• An extension of the square root law of TCP
• Rate of convergence for the `square root formula' in the Internet transmission control protocol
• Hitting times and the running maximum of Markovian growth-collapse processes
• A Markovian growth-collapse model
• TCP and iso-stationary transformations
• scientific article; zbMATH DE number 2088134 (Why is no real title available?)

This page was built for publication: Analysis of MIMD congestion control algorithm for high speed networks

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