Skip to Main Content
Constant rate transmission and transport (CRTT) is an effective bandwidth smoothing scheme resulting in one fixed rate during the whole duration of variable bit-rate video, which, however, needs a large client buffer size. The minimum buffer requirement (MBR) of CRTT, besides benefiting the design of some piecewise transmission scheme, can examine whether we can transmit the requested video with a constant rate for a given buffer size. In this paper, we formulate off-line bandwidth smoothing into a binary classification problem of the underflow and overflow points. Then we propose a novel algorithm based on support vector machine because of its equal margin, which,we have proven, is able to minimize the required buffer size of CRTT. Our algorithm, therefore, can exactly calculate MBR together with the CRTT transmission rate without exhaustively searching buffer sizes and startup delay. The simulation results using some real MPEG4 and H.264 video show the philosophy and effectiveness of our algorithm.