The performance of two previously proposed asymptotically stable unicast flow control algorithms for high-speed networks is compared. We extend one of them to the multicast case. The multicast algorithm is modeled by a set of delay-differential equations. Despite the difficulties in analyzing the second order system with multiple different delays, the algorithm is analytically proven to be stable, and this is supported by extensive simulations. This work should prove useful in the design of multicast flow control algorithms.

There is an urgent need for effective multicast congestion control algorithms which enable reasonably fair share of network resources between multicast and unicast TCP traffic under the current Internet infrastructure. In this paper, we propose a quantitative definition of a type of bounded fairness between multicast and unicast best-effort traffic, termed "essentially fair". We also propose a window-based Random Listening Algorithm (RLA) for multicast congestion control. The algorithm is proven to be essentially fair to TCP connections under a restricted topology with equal round-trip times and with phase effects eliminated. The algorithm is also fair to multiple multicast sessions. This paper provides the theoretical proofs and some simulation results to demonstrate that the RLA achieves good performance under various network topologies. These include the performance of a generalization of the RLA algorithm for topologies with different round-trip times.

A multipoint flow control framework for data traffic traversing both a wired and mobile wireless network is proposed. A Markov modulated fluid model is used for the receiver to capture the dynamics of the wireless links. We discover that the phase difference of the instantaneous throughput of the receivers is a distinctive feature of multicast connections. The objectives of the multicast flow control algorithms are to cope with the receiver phase difference cost-effectively in addition to the general goals such as maximizing throughput and minimizing delay. Three ad hoc algorithms have been studied: listen to slowest request (LSQ), source estimation (SE), and open loop control. A fluid analysis technique is applied to study the effect of receiver phase difference assuming zero delay. The effect of propagation delay is then discussed. Simulation results are presented to verify the analysis for the zero delay case and to compare the performance of the algorithms under non-negligible delay.

A multicast flow control framework for data traffic traversing both a wired and wireless network is proposed. Markov-modulated fluid (MMF) models are used for the receivers to capture the dynamics of the wireless links. Our study shows that the phase differences of the instantaneous throughput capabilities of the receivers are a distinctive feature of multicast connections. The objectives of the multicast flow control algorithms are to cope with the receiver phase differences (RPDs) cost effectively in addition to the general goals such as maximizing throughput and minimizing delay. Three ad hoc algorithms have been studied: listen to slowest request (LSQ), source estimation (SE), and open-loop control. A fluid-flow analysis technique is applied to study the effect of receiver phase differences assuming zero propagation delay. The effect of propagation delay in multicast connections is then discussed. Simulation results are presented to verify the analysis for the zero-delay case and to compare the performance of the algorithms under nonnegligible delays. It turns out that the zero-delay case reveals the characteristics of the multicast algorithms and provides good performance bounds for the cases with nonnegligible propagation delays.