Abstract
A new algorithm for efficient multiplexing of smoothed video streams through linear programming (LP) is proffered. We review the optimal multiplexing solution for transmission of multiple streams over a CBR network and give some results for real MPEG-1 video sequences. The results of the PCRTT procedure and the optimal multiplexing linear program are compared in terms of peak transmission bandwidth and P-loss performance measures. For several client buffer sizes, the rate obtained by PCRTT was reduced by up to 35% by the LP solution. The multiplexed LP is extended to include client constraints in the form of individual bandwidth and buffer limits. In addition the possibility of placing a preloading time limit on the server is included. For this version a small example is solved to illustrate the procedure. It is noted that the PCRTT method is not appropriate for cases different client rate limits.
Original language | English GB |
---|---|
Pages | 197-203 |
Number of pages | 7 |
State | Published - 2002 |
Event | Information Systems and Databases (ISDB 2002) - Tokyo, Japan Duration: 25 Sep 2002 → 27 Sep 2002 https://www.actapress.com/Content_Of_Proceeding.aspx?ProceedingID=362 |
Conference
Conference | Information Systems and Databases (ISDB 2002) |
---|---|
Country/Territory | Japan |
City | Tokyo |
Period | 25/09/02 → 27/09/02 |
Internet address |