Research Article
QoS-Based Multicast Routing in Network Function Virtualization-Enabled Software-Defined Mobile Edge Computing Networks
Algorithm 1
NFV-enabled QoS guaranteed multicast tree construction
| Input: , , Dk, Bk, cf,m, SCk, CL | | Output: A QoS guaranteed multicast tree with minimal cost | (1) | Calculate the cost Ckj of path j from source Si to VNF node ( ∈ CL) that implementing ; | (2) | Get a set of path costs Ck = (Ck1, Ck2, …, Ckn); | (3) | for ∈ CL, do | (4) | Construct a Steiner tree from each to destination set; | (5) | With QoS requirement constraints, generate a set of multicast trees T; | (6) | end | (7) | Select the multicast tree Topt with the minimum cost of Ck of , which meets the QoS requirements | (8) | Return Topt |
|