Optimal Multilayer Adaptation of SVC Video over Heterogeneous Environments
Algorithm 1
Step 0: i = 0. Start from the initial node (0, 0).
Step 1: At each stage i, add possible branches to the
end nodes of the surviving paths. At each node, a branch is grown for each of
the available selections; the branch must satisfy condition (6).
Step 2: Among all paths arriving at a node in stage
, the one having the highest accumulated sum of is kept, and the rest are pruned.
Step 3: i = i+1. If i ≤ N, go
back to step 1, otherwise go to step 4.
Step 4: At the final stage, compare all surviving
paths then select the path having the highest value of . That path corresponds to the optimal set of selections for all spatial layers.
