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