Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
From MaRDI portal
Publication:4734745
DOI10.1016/0169-7552(89)90019-6zbMath0684.68016OpenAlexW2158700277WikidataQ63071306 ScholiaQ63071306MaRDI QIDQ4734745
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
fairnessresource managementcomputer networkflow controlcongestion controlnetwork performanceCongestion avoidance
Related Items (45)
Fairness in academic course timetabling ⋮ Per-stream loss behavior of \(\Sigma \)MAP/M/1/K queuing system with a random early detection mechanism ⋮ Max-min fairness in multi-commodity flows ⋮ An algorithm for reducing loss rate of high-speed TCP ⋮ TCP-friendly source adaptation for multimedia appliations over the Internet ⋮ Critical Scale for a Continuous AIMD Model ⋮ Learning Intelligent Controls in High Speed Networks: Synergies of Computational Intelligence with Control and Q-Learning Theories ⋮ A modified resource distribution fairness measure ⋮ Modelling TCP congestion control dynamics in drop-tail environments ⋮ Smart procurement of naturally generated energy (SPONGE) for PHEVs ⋮ Network sharing fairness function with consideration of priority levels ⋮ Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback ⋮ Exploiting energy-saving potential in heterogeneous networks ⋮ End-to-end maxmin fairness in multihop wireless networks: theory and protocol ⋮ Competitive interaction model with Holling type and application to IP network data packets forwarding ⋮ Deterministic and stochastic convergence properties of AIMD algorithms with nonlinear back-off functions ⋮ Modeling conflict processes on the Internet ⋮ Allocating network resources by weight between TCP traffics ⋮ Distributed bandwidth allocation based on alternating evolution algorithm ⋮ An ergodic AIMD algorithm with application to high-speed networks ⋮ The effect of delayed feedback information on network performance ⋮ Fluid modelling of packet switching networks: perspectives for congestion control ⋮ Dead−time and feed−forward disturbance compensation for congestion control in data networks ⋮ On the competitiveness of AIMD-TCP within a general network ⋮ Estimation of the variances of TCP/RED using stochastic differential equation ⋮ Bit rate optimization with MMSE detector for multicast LP-OFDM systems ⋮ Adaptive mechanism-based congestion control for networked systems ⋮ A flexible distributed framework for realising electric and plug-in hybrid vehicle charging policies ⋮ Window-games between TCP flows ⋮ Analysis of a Feedback Fluid Model for Heterogeneous TCP Sources ⋮ TCP is competitive with resource augmentation ⋮ Operator context scanning to support high segmentation rates for real time license plate recognition ⋮ CW-HSTCP: fair TCP in high-speed networks ⋮ Switching control analysis and design in queue networks ⋮ Window-Games between TCP Flows ⋮ A result on second order nonlinear operators arising in high-speed networking applications ⋮ Resource pricing and the evolution of congestion control ⋮ Probabilistic model of the algorithms of distributed control protocol in the internet network ⋮ A decentralized adaptive algorithm for fair allocation of a shared resource ⋮ Stability and performance analysis of rate-based feedback flow controlled ATM networks ⋮ A Perron-Frobenius type result for integer maps and applications ⋮ Optimal real-time distributed V2G and G2V management of electric vehicles ⋮ Fair optimization and networks: a survey ⋮ A new measurement for network sharing fairness ⋮ Self-organized critical traffic in parallel computer networks
This page was built for publication: Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
