Analytical methods for network congestion control

DOI10.2200/S00778ED1V01Y201705CNT018MaRDI QIDQ5357976zbMATH OpenOpenAlexFDO

Authors Steven H. Low

Publication date 18 September 2017

Published in Synthesis Lectures on Communication Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2200/s00778ed1v01y201705cnt018

zbMATH Keywords

Internet scalingnetwork congestion controlstability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Internet topics (68M11) Research exposition (monographs, survey articles) pertaining to systems and control theory (93-02) Large-scale systems (93A15) Feedback control (93B52) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05)

Recommendations

• The mathematics of internet congestion control
• A mathematical framework for designing a low-loss, low-delay internet
• scientific article; zbMATH DE number 2050727
• Congestion control in computer networks
• scientific article; zbMATH DE number 42185

Cited in

(10)

• The mathematics of internet congestion control
• Statistical approach for congestion control in gateway routers
• An analytical model for loss estimation in network traffic analysis systems
• Congestion control in computer networks
• Phase-plane analysis of switching dynamics of TCP flow control algorithms
• scientific article; zbMATH DE number 42185 (Why is no real title available?)
• scientific article; zbMATH DE number 2040821 (Why is no real title available?)
• scientific article; zbMATH DE number 2050727 (Why is no real title available?)
• Duality-based TCP congestion control with error analysis
• Two-sided Kirszbraun theorem

This page was built for publication: Analytical methods for network congestion control

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