Analysis of the increase and decrease algorithms for congestion avoidance in computer networks

DOI10.1016/0169-7552(89)90019-6zbMATH Open0684.68016OpenAlexW2158700277WikidataQ63071306 ScholiaQ63071306MaRDI QIDQ4734745FDOQ4734745

Authors: Dah-Ming Chiu, Raj Jain 

Publication date: 1989

Published in: Computer Networks and ISDN Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0169-7552(89)90019-6

Recommendations

• Congestion control in computer networks
• An ergodic AIMD algorithm with application to high-speed networks
• A New Flow Control Algorithm for High Speed Computer Network
• Analysis and design of AIMD congestion control algorithms in communication networks
• Exploiting the efficiency and fairness potential of AIMD-based congestion avoidance and control.

zbMATH Keywords

fairnessresource managementflow controlcongestion controlnetwork performancecomputer networkCongestion avoidance

Mathematics Subject Classification ID

Theory of software (68N99)

Cited In (47)

• Competitive interaction model with Holling type and application to IP network data packets forwarding
• A Perron-Frobenius type result for integer maps and applications
• An ergodic AIMD algorithm with application to high-speed networks
• Exploiting energy-saving potential in heterogeneous networks
• Switching control analysis and design in queue networks
• On the competitiveness of AIMD-TCP within a general network
• CW-HSTCP: fair TCP in high-speed networks
• Estimation of the variances of TCP/RED using stochastic differential equation
• Bit rate optimization with MMSE detector for multicast LP-OFDM systems
• A new measurement for network sharing fairness
• Fairness in academic course timetabling
• Learning intelligent controls in high speed networks: synergies of computational intelligence with control and Q-learning theories
• Window-games between TCP flows
• TCP is competitive with resource augmentation
• Critical Scale for a Continuous AIMD Model
• TCP-friendly source adaptation for multimedia appliations over the Internet
• Operator context scanning to support high segmentation rates for real time license plate recognition
• End-to-end maxmin fairness in multihop wireless networks: theory and protocol
• Allocating network resources by weight between TCP traffics
• Dead−time and feed−forward disturbance compensation for congestion control in data networks
• On unique ergodicity of coupled AIMD flows
• Deterministic and stochastic convergence properties of AIMD algorithms with nonlinear back-off functions
• Per-stream loss behavior of \(\Sigma \)MAP/M/1/K queuing system with a random early detection mechanism
• An algorithm for reducing loss rate of high-speed TCP
• Resource pricing and the evolution of congestion control
• Optimal real-time distributed V2G and G2V management of electric vehicles
• Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback
• A flexible distributed framework for realising electric and plug-in hybrid vehicle charging policies
• Window-Games between TCP Flows
• Modelling TCP congestion control dynamics in drop-tail environments
• Smart procurement of naturally generated energy (SPONGE) for PHEVs
• A result on second order nonlinear operators arising in high-speed networking applications
• Modeling conflict processes on the Internet
• Adaptive mechanism-based congestion control for networked systems
• Network sharing fairness function with consideration of priority levels
• Probabilistic model of the algorithms of distributed control protocol in the internet network
• Fluid modelling of packet switching networks: perspectives for congestion control
• A modified resource distribution fairness measure
• Self-organized critical traffic in parallel computer networks
• The effect of delayed feedback information on network performance
• Stability and performance analysis of rate-based feedback flow controlled ATM networks
• A loosely self-stabilizing protocol for randomized congestion control with logarithmic memory
• Analysis of a Feedback Fluid Model for Heterogeneous TCP Sources
• Fair optimization and networks: a survey
• Max-min fairness in multi-commodity flows
• Distributed bandwidth allocation based on alternating evolution algorithm
• A decentralized adaptive algorithm for fair allocation of a shared resource

This page was built for publication: Analysis of the increase and decrease algorithms for congestion avoidance in computer networks

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