Is it possible to achieve the optimum throughput and fairness simultaneously in a MIMO Broadcast Channel?

In this paper, a MIMO Broadcast Channel (MIMO-BC) with large (K) number of users is considered. It is assumed that all users have a hard delay constraint D. We propose a scheduling algorithm for maximizing the throughput of the system, while satisfying the delay constraint for all users. It is proved that by using the proposed algorithm, it is possible to achieve the maximum throughput and maximum fairness in the network, simultaneously, in the asymptotic case of K rarr infin. We introduce a new performance metric in the network, called "minimum average throughput", and prove that the proposed algorithm is capable of maximizing the minimum average throughput in a MIMO-BC, in the asymptotic case of K rarr infin. Finally, it is established that the proposed algorithm reaches the boundaries of the capacity region and stability region of the network, simultaneously, in the asymptotic case of K rarr infin.