Multicast scheduling with resource fairness constraints

Integration of multicast and unicast data in future radio access networks will be necessary in order to improve the resource efficiency and provide new services. Such integration requires new and efficient resource sharing mechanisms. These mechanisms need to be optimized to provide the best possible trade-off between resource efficiency and fairness. In this article, we consider a case where streaming multicast users are multiplexed together with elastic unicast users on a common time-slotted channel. We derive a system model to study the performance of various resource allocations strategies under proportional and resource fairness constraints. Fairness is directly defined in terms of the users’ utilities rather than of the throughputs they are assigned to. We also describe an extension of the well-known unicast proportional fair scheduler to the multicast scenario. Through extensive simulations we demonstrate the performance of this scheduler for various traffic loads and multicast group sizes.

[1]  Min Song,et al.  Integration of unicast and multicast scheduling in input-queued packet switches , 2006, Comput. Networks.

[2]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[3]  Bob Briscoe,et al.  Flow rate fairness: dismantling a religion , 2007, CCRV.

[4]  Yao Wang,et al.  Optimal coding rate and power allocation for the streaming of scalably encoded video over a wireless link , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  Rajeev Agrawal,et al.  Optimality of Certain Channel Aware Scheduling Policies , 2002 .

[6]  S. Vassiliadis,et al.  Integrating uni- and multicast scheduling in buffered crossbar switches , 2006, 2006 Workshop on High Performance Switching and Routing.

[7]  Ahmed Helmy,et al.  The IMPORTANT framework for analyzing the Impact of Mobility on Performance Of RouTing protocols for Adhoc NeTworks , 2003, Ad Hoc Networks.

[8]  Sem C. Borst,et al.  How mobility impacts the flow-level performance of wireless data systems , 2004, IEEE INFOCOM 2004.

[9]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[10]  Alexander L. Stolyar,et al.  On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation , 2005, Oper. Res..

[11]  Jonathan Ling,et al.  On some properties of the proportional fair scheduling policy , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[12]  Walid Dabbous,et al.  Fair bandwidth sharing between unicast and multicast flows in best-effort networks , 2004, Comput. Commun..

[13]  Cyriel Minkenberg Integrating unicast and multicast traffic scheduling in a combined input- and output-queued packet-switching system , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[14]  Jean-Yves Le Boudec,et al.  Rate adaptation, Congestion Control and Fairness: A Tutorial , 2000 .

[15]  Guowang Miao,et al.  Bandwidth Management for Mixed Unicast and Multicast Multimedia Flows with Perception Based QoS Differentiation , 2006, 2006 IEEE International Conference on Communications.

[16]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.