Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Softwar...Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Software Defined Network(SDN), most of the them are focused either on the number of transmission layers or on the optimization of transmission path for specific layer. In this paper, we propose a noval optimization algorithm for SVC to dynamically adjust the number of layers and optimize the transmission paths simultaneously. We establish the problem model based on the 0/1 knapsack model, and then solve it with Artificial Fish Swarm Algorithm. Additionally, the simulations are carried out on the Mininet platform, which show that our approach can dynamically adjust the number of layers and select the optimal paths at the same time. As a result, it can achieve an effective allocation of network resources which mitigates the congestion and reduces the loss of non-SVC stream.展开更多
Let {Tn } be a renewal process in R＋ representing the successive arrival times of some natural events. We studied this process by using a record process approach under the assumption that the interarrival times T,, =...Let {Tn } be a renewal process in R＋ representing the successive arrival times of some natural events. We studied this process by using a record process approach under the assumption that the interarrival times T,, = Tn, - Ta-1, n = 1, 2...are exponentially i.i.d （independent and identically distributed）. The goal is to test that the first observed events are sporadic events. For testing the hypothesis ＂sporadic＂ we used the non-parametric test based on the probability distribution of the statistic of the number of records N, among{Xx }k-1= where Xk = （ΔTk）-1. We showed that it is independent of the cumulative distribution of the observations and that it is exactly calculated for each n. We illustrated this statistic on a simulated trajectory and we compared it with descriptive smoothing methods. We studied an application to a data set as storms in France and US.展开更多
文摘Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Software Defined Network(SDN), most of the them are focused either on the number of transmission layers or on the optimization of transmission path for specific layer. In this paper, we propose a noval optimization algorithm for SVC to dynamically adjust the number of layers and optimize the transmission paths simultaneously. We establish the problem model based on the 0/1 knapsack model, and then solve it with Artificial Fish Swarm Algorithm. Additionally, the simulations are carried out on the Mininet platform, which show that our approach can dynamically adjust the number of layers and select the optimal paths at the same time. As a result, it can achieve an effective allocation of network resources which mitigates the congestion and reduces the loss of non-SVC stream.
文摘Let {Tn } be a renewal process in R＋ representing the successive arrival times of some natural events. We studied this process by using a record process approach under the assumption that the interarrival times T,, = Tn, - Ta-1, n = 1, 2...are exponentially i.i.d （independent and identically distributed）. The goal is to test that the first observed events are sporadic events. For testing the hypothesis ＂sporadic＂ we used the non-parametric test based on the probability distribution of the statistic of the number of records N, among{Xx }k-1= where Xk = （ΔTk）-1. We showed that it is independent of the cumulative distribution of the observations and that it is exactly calculated for each n. We illustrated this statistic on a simulated trajectory and we compared it with descriptive smoothing methods. We studied an application to a data set as storms in France and US.
