Optimal Client Constrained Multiplexing: A Linear Programming Approach

Ofer Hadar; Helman Stern

Optimal Client Constrained Multiplexing: A Linear Programming Approach

Department of Industrial Engineering and Management

Research output: Contribution to conference › Paper › peer-review

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
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	https://www.actapress.com/Content_Of_Proceeding.aspx?ProceedingID=362

Cite this

@conference{9dfd8a8c08764bc7aff67b4a77b58035,

title = "Optimal Client Constrained Multiplexing: A Linear Programming Approach",

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.",

author = "Ofer Hadar and Helman Stern",

year = "2002",

language = "English",

pages = "197--203",

note = "Information Systems and Databases (ISDB 2002) ; Conference date: 25-09-2002 Through 27-09-2002",

url = "https://www.actapress.com/Content\_Of\_Proceeding.aspx?ProceedingID=362",

}

TY - CONF

T1 - Optimal Client Constrained Multiplexing

T2 - Information Systems and Databases (ISDB 2002)

AU - Hadar, Ofer

AU - Stern, Helman

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

M3 - Paper

SP - 197

EP - 203

Y2 - 25 September 2002 through 27 September 2002

ER -

Optimal Client Constrained Multiplexing: A Linear Programming Approach

Abstract

Conference

Fingerprint

Cite this