Hopf bifurcation analysis in a dual model of Internet congestion control algorithm with communication delay

This paper focuses on the delay induced Hopf bifurcation in a dual model of Internet congestion control algorithms which can be modeled as a time-delay system described by a one-order delay differential equation (DDE). By choosing communication delay as the bifurcation parameter, we demonstrate that the system loses its stability and a Hopf bifurcation occurs when communication delay passes through a critical value. Moreover, the bifurcating periodic solution of system is calculated by means of perturbation methods. Discussion of stability of the periodic solutions involves the computation of Floquet exponents by considering the corresponding Poincare -Lindstedt series expansion. Finally, numerical simulations for verify the theoretical analysis are provided.

💡 Research Summary

The paper investigates delay‑induced Hopf bifurcation in a dual formulation of Internet congestion control, modeling the dynamics with a single‑state first‑order delay differential equation (DDE). The authors treat the communication delay τ as the bifurcation parameter. Linearizing around the equilibrium yields the characteristic equation λ + a e^{‑λτ}=0 (a > 0), from which they derive the critical delay τ_c at which a pair of complex conjugate eigenvalues crosses the imaginary axis. When τ exceeds τ_c the equilibrium loses stability and a Hopf bifurcation occurs, giving rise to a small‑amplitude periodic orbit.

To approximate the emerging periodic solution, the authors employ the Poincaré‑Lindstedt perturbation method. Introducing ε = τ − τ_c as a small parameter, they expand the state variable and the phase as series in ε. The first‑order term determines the Hopf frequency ω, while higher‑order terms capture the nonlinear interaction between the delayed feedback and the system’s intrinsic dynamics. The resulting approximation has the form x(t) ≈ x_0 + A(ε) cos(ωt + ψ(ε)), where the amplitude A(ε) and phase correction ψ(ε) are explicit polynomial functions of ε.

Stability of the bifurcating limit cycle is assessed via Floquet theory. Linearizing the DDE about the periodic orbit and applying the same perturbation expansion yields the Floquet exponent μ = ε μ_1 + O(ε²). The sign of μ_1 determines whether the limit cycle is attracting (μ_1 < 0) or repelling (μ_1 > 0). The authors compute μ_1 analytically for the chosen nonlinear function f(x) (e.g., f(x)=C/(1+x)) and show that, depending on the system parameters, the Hopf‑generated oscillation can be stable even when τ slightly exceeds τ_c.

Numerical simulations corroborate the analytical predictions. Using representative parameters (a = 1, C = 1, τ_c ≈ π/2), the authors simulate the DDE for τ = τ_c + 0.1 and τ = τ_c + 0.3. The simulations display the onset of sustained oscillations at τ ≈ τ_c, with amplitudes and periods matching the perturbation results. Moreover, the computed Floquet exponents correctly predict whether the observed oscillations converge to a stable limit cycle or diverge, confirming the theoretical stability analysis.

The study provides practical insights for network engineers. By quantifying the critical delay τ_c, designers can set buffer sizes, routing policies, and controller gains to keep the effective communication delay below this threshold, thereby avoiding undesirable periodic congestion. In scenarios where τ inevitably exceeds τ_c (e.g., satellite links, high‑latency IoT networks), the derived expressions for amplitude, frequency, and stability enable informed tuning of the congestion control algorithm to mitigate oscillatory behavior. Overall, the paper offers a rigorous mathematical framework for understanding and managing delay‑driven dynamics in modern congestion control protocols.