Departmental Papers (ESE)


We study fairness in a multicast network. We assume that different receivers of the same session can receive information at different 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 modeled as a nonlinear optimization problem. However, nonlinear optimization techniques do not terminate in a finite number of iterations in general. We present an algorithm for computing a fair utility allocation. Using specific fairness properties, we show that this algorithm attains global convergence and yields a fair allocation in polynomial number of iterations.

Document Type

Journal Article

Date of this Version

June 2002


Copyright 2002 IEEE. Reprinted from IEEE Transactions on Automatic Control, Volume 47, Issue 6, June 2002, pages 931-944.
Publisher URL: Number=21741&puNumber=9

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to By choosing to view this document, you agree to all provisions of the copyright laws protecting it.


computational complexity, decision theory, iterative methods, multicast communication, optimisation, resource allocation, telecommunication congestion control, congestion control, fair utility allocation, global convergence, multicast communication network, multirate networks, nonlinear optimization, polynomial complexity, utility function



Date Posted: 15 November 2004

This document has been peer reviewed.