University of Mary Washington
Multi-rate multicasting, where the receivers of a multicast group can receive service at different rates, is an efficient mode of data delivery for many real-time applications. In this paper, the authors address the problem of achieving rates that maximize the total receiver utility for multi-rate multicast sessions. This problem not only takes into account the heterogeneity in user requirements, but also provides a unified framework for diverse fairness objectives. They propose two algorithms and prove that they converge to the optimal rates for this problem. The algorithms are distributed and scalable, and do not require the network to know the receiver utilities. They discuss how these algorithms can be implemented in a real network, and also demonstrate their convergence through simulation experiments.