|
Abstract : |
We study fairness in a multicast network. We assume that dierent receivers of the same session can receive information at dierent rates. We study fair allocation of utilities, where utility of a bandwidth is an arbitrary function of the bandwidth. The utility function is not strictly increasing, nor continuous in general. We discuss fairness issues in this general context. Fair allocation of utilities can be modelled as a nonlinear optimization problem. However, nonlinear optimization techniques do not terminate in nite number of iterations in general. We present an algorithm for computing a fair utility allocation. Using specic fairness properties, we show that this algorithm attains global convergence and yields a fair allocation in polynomial number of iterations. 1, |
