Optimal video stream multiplexing through linear programming

This paper presents a new optimal multiplexing scheme for compressed video streams based on a piecewise linear approximation of the accumulative data curve of each stream. A linear programming algorithm is provided, which takes into account different constraints of each client. It is shown that the algorithm succeeds in obtaining maximum bandwidth utilization with Quality of Service (QoS) guarantees. The algorithm takes into account the interaction between the multiplexed streams and the individual streams, and simultaneously finds the optimum total multiplexed schedule and individual stream schedules that minimizes the peak transmission rate. In addition, the algorithm, due to the linear programming formulation, is bounded in polynomial time. The simulation results show a significant reduction in peak rate and rate variability of the aggregated stream, compared to the non-smoothing case. Therefore the proposed scheme allows an increase in the number of simultaneously served video streams.