Abstract: A novel strategy of Measurement Based Admission Control (MBAC) for video distribution system has been developed, aiming at obtaining the needed Quality of Service (QoS), expressed in terms of probability for the video aggregation to exceed the ch
filter of 15 taps. In all the simulation results here presented such values have been used.

Figure 2: Processing scheme
Let fn(b) be the probability density function (pdf) of the prediction error with respect to the bit rate, and Fn(b) its corresponding cumulative distribution, the quantity Fcn(b)=1–Fn(b) represents the probability that the event “the difference between estimated bit rate and the true one is grater than b”. This probability will be used in the proposed MBAC algorithm.
To accept a new streaming client, the available composite video bit rate must satisfy the relation:
BR(N+1,Ps)+ΔBr(Ps/α)≤C (3.4) where BR and ΔBrare evaluated by (3.5). BR represents the composite video stream bit rate in the hypothesis the new stream is accepted and multiplexed together with the given N-streams composite video, to originate a (N+1)-streams composite video as a function of the overflow probability Ps , and ΔBris the corresponding margin with respect to the channel capacity C to absorb the peaks of the BR due to the unpredictability of the phenomenon. As previously stated, Pi=Ps/α has to be littler than Ps, but not excessively to avoid an over-conservative admission control policy, that would tend to reject flows even if there are sufficient bandwidth requirements. A good choice is to choose Pi an order of magnitude littler than Ps, so we choose for our experiments α=0.1.
The curves of the bit rate probability obtained with all N streams composite videos for the prediction error tend to saturate, as N increases, to the curve in figure 4. To be conservative and make the algorithm simple, we have considered a single curve corresponding to N large.
WheneverBR+ΔBr<C the new client will be admitted to the service, otherwise the probability of overflow will be estimated and passed to the client that, considering such information, might decide to accept the service or deny it. The limit condition (equality) can be assumed in (3.4). For each N, and defined α in (3.2), the complementary curves of the probability as a function of the bit rate can be approximated by polynomial functions in the variable Ps; we compute a single polynomial function for the unpredictability of the bit rate, ΔBr, and a family of curves for the N-streams cases of composite video streams. Thus we have:
∑
L
ΔBr(Pi)=ΔBr(Ps/α)=cn Pns n=0
(3.5)
∑
L
BR(N,Ps
)=ann(N) Ps
n=0Assuming to be in proximity of the channel capacity, with a N-streams composite video, the algorithm steps consist in:
I. Compute the probability Ps0 due to the (N+1) case
finding the zero of the polynomial equation BR(Ps0) = C:
L
C=BR(N+1,Ps0)=
∑a(N+1) P
nn
s0
n=0
II.
Compute the margin with respect to the channel capacity for the (N+1)-streams composite video, ΔBr(Ps0): L
ΔBr(Ps0/α)=
∑c
n
Pns0
n=0
III.
Compute the new maximum bit rate to be assumed for the smooth signal, BR1:
BR1 = C – ΔBr(Ps/α) IV.
Compute the minimum value assumed at the new computed bit rate for the (N+1) case, Pmin, as the solution of the polynomial equation BR1 = BR(N+1, Pmin):
BR1=BR(N+1,Pmin)=
∑L
ann
(N+1) P
min
n=0
V. Compute the estimated overflow probability as:
Pq=(1+α) Ps
3. EXPERIMENTAL RESULTS
The experimental results we present all refer to real data of composite videos obtained statistically multiplexing MPEG encoded YUV-CIF videos, with GOP of 12 frames and 30 fps. All the created composite video streams have been obtained randomly mixing sources with different statistics, and composite videos are limited to 20 sources composite video.
Figure 3 refers to the obtained complementary cumulative distribution function for the cases of N multiplexed sources, with N in the set [1,20].
Curves in figure 3 and the curve in figure 4 have been polynomial fitted to give analytical expression in (3.5). Two sets of N-streams composite videos time series bit rates have been produced: a training one, used to obtain curves in figures 3 and 4, and a test set, used to obtain experimental results.
Polynomials fitting curves for such functions have been estimated, as described in section 3.2.
The test of the proposed algorithm has been carried out on the test set of N-streams composite videos to estimate the expected overflow event.
A capacity C communication channel has been assumed, and a number of video, N, in the composite video stream has been selected in order be close to the channel capacity and give a negligible overflow probability. A request of service by a (N+1)-th client has been assumed, and the
A New MBAC algorithm for... 暂无评价 4页 免费...VBR Video Streaming in a Multicastbased Video-on-...algorithm with two other algorithms based on ...
Based on autoregressive AR estimation approach 2 , a new adaptive frequency estimation algorithm which gives direct and accurate frequency measurements is ...
Based on autoregressive AR estimation approach 2 , a new adaptive frequency estimation algorithm which gives direct and accurate frequency measurements is ...
热门文档