Interactive multiview video scheduling through bargaining
This paper proposes a multiview video scheduling scheme through asymmetric Nash bargaining for a tradeoff between user satisfaction and view fairness. The interactions of view streams queueing at the scheduler are modeled as a bargaining problem, where packets of different views share the transmission opportunities via negotiation. A utility function based upon the viewing angle is defined to indicate whether a view is desired by a user, then a network utility maximization problem is solved by the Nash bargaining solution (NBS). The impacts of the bargaining powers on both network performance and view fairness are analytically investigated. Simulation results are provided to compare the performances of three scheduling schemes including fair scheduling, symmetric bargaining, and proportional scheduling, which can be achieved by adjusting the bargaining powers.