Stability Analysis of a Window-Based High-Speed Hierarchical Rate Allocation Algorithm

Providing the stability of any rate allocation algorithm is a challenging issue in current high-speednetworks. some researchers, such as kelly, massoulie, vinnicombe and johari, have shownthe stability of their rate-based rate allocation algorithms using different approaches. someother researchers have investigated the stability of the second-order, rate-based, rate allocationalgorithms under some simplifying constraints. mo et al. have proved the stability of .the firstorder,window-based rate allocation algorithms, using control theory concepts, for a wide rangeof fairness criteria. in the current work, the stability property of a second-order, high-speedand window-based rate allocation strategy has been investigated using the lyapunov approach.simulation results verify the stability of the proposed method under a general network scenario.