Analysis of MIMD congestion control algorithm for high speed networks
From MaRDI portal
Publication:2485601
DOI10.1016/j.comnet.2004.11.025zbMath1075.68556OpenAlexW2023779901MaRDI QIDQ2485601
Eitan Altman, Chadi Barakat, Konstantin E. Avrachenkov, Arzad A. Kherani, Balakrishna J. 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
Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (7)
An extension of the square root law of TCP ⋮ Hitting Times and the Running Maximum of Markovian Growth-Collapse Processes ⋮ TCP and iso-stationary transformations ⋮ Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm ⋮ Transient Moments of the TCP Window Size Process ⋮ A Markovian growth-collapse model ⋮ Rate of convergence for the `square root formula' in the Internet transmission control protocol
This page was built for publication: Analysis of MIMD congestion control algorithm for high speed networks