Optimal video stream multiplexing through linear programming

  • Authors:

  • Helman I. Stern;Ofer Hadar;Nir Friedman

  • Affiliations:

  • Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, P.O. Box 653, Be'er-Sheeva 84105, Israel;Department of Communication Systems Engineering, Ben-Gurion University of the Negev, P.O. Box 653, Be'er-Sheeva 84105, Israel;Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, P.O. Box 653, Be'er-Sheeva 84105, Israel

  • Venue:
  • Image Communication
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new optimal multiplexing scheme for compressed video streams based on their individual e-PCRTT transmission schedules. A linear programming algorithm is proffered, which takes into account the different constraints of each client. The algorithm simultaneously finds the optimum total multiplexed and individual stream schedules that minimize the peak transmission rate. Since the problem is formulated as a linear program it is bounded in polynomial time. It is shown that the algorithm succeeds in obtaining maximum bandwidth utilization with Quality of Service (QoS) guarantees. Simulation results using 10 real MPEG-1 video sequences are presented. The optimal multiplexing linear programming results are compared to the e-PCRTT and Join-the-Shortest-Queue (JSQ) procedures in terms of peak transmission bandwidth, P-loss performance and standard deviation. For several client buffer sizes, the rate obtained by our LP solution when compared to a previous e-PCRTT and JSQ methods resulted in reductions of 47% and 56%, respectively. This implies for a fixed rate problem that the proposed scheme can allow an increase in the number of simultaneously served video streams.