Adaptive Broadcasting Mechanism for Bandwidth Allocation in Mobile Services

Algorithm 3

Root-cutting procedure  (𝑅,𝑤₁,…,𝑤_𝑣):

(1) Sort the data items in root R according to their sizes into a non-increasing order 𝑎₁,…,𝑎_𝑘.

  (i.e., 𝑆(𝑎_𝑖)≥𝑆(𝑎_𝑗)𝑖𝑓𝑓1≤𝑖≤𝑗≤𝑘).

(2) For  i = 1 to k

(3)  Find the wood 𝑤_𝑐with the smallest size.

(4)  Split the data item 𝑎_𝑖 from the root and attach it to the top of wood 𝑤_𝑐.

(5) return (𝑤₁,…,𝑤_𝑣).