Embedding Service Function Tree With Minimum Cost for NFV-Enabled Multicast

Ren, Bangbang; Guo, Deke; Shen, Yulong; Tang, Guoming; Lin, Xu

doi:10.1109/jsac.2019.2906764

Cited by 41 publications

(13 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There have been few works on the VNF-PR problem for MSC [8,9,10,11,12,13]. Yi et al [9] presented a multi-stage algorithm for solving the VNF-PR problem, which first constructs a traffic forwarding graph and a function delivery graph and then determines the traffic steering for each multicast session.…”

Section: Related Workmentioning

confidence: 99%

“…The problem formulated in [11] allows multipath traffic routing between embedded VNFs to improve the flexibility of VNF placement and routing. Ren et al [12] formulated the service function tree embedding problem by ILP and presented a two-stage algorithm which has the approximation ratio of 1 + ρ, where ρ is the best approximation ratio of the Steiner tree problem.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Virtual network function placement and routing for multicast service chaining using merged paths

Kiji

Sato

Shinkuma

et al. 2020

Optical Switching and Networking

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Virtual network function placement and routing for multicast service chaining using merged paths

Kiji

Sato

Shinkuma

et al. 2020

Optical Switching and Networking

View full text Add to dashboard Cite

“…Studies that investigated network slicing and NFVenabled multicasting include the ones due to Leconte et al [23], Zhang et al [56], [57], Xu et al [50], Soni et al [45], Ren et al [41], [42], and Yu et al [54].…”

Section: Related Workmentioning

confidence: 99%

“…Later, Xu et al [53] studied the problem of NFV-enabled multicasting by considering the resource sharing among requests. Ren et al [41], [42] investigated the problem of embedding a service graph that consisting instances of VNFs into the substrate network. Soni et al [45] proposed a scalable multicast group management scheme and a load balancing method for the routing of best-effort traffic and bandwidthguaranteed traffic.…”

Section: Related Workmentioning

confidence: 99%

Enabling Multicast Slices in Edge Networks

Qin

Xia

et al. 2020

IEEE Internet Things J.

View full text Add to dashboard Cite

Telecommunication networks are undergoing a disruptive transition towards distributed mobile edge networks with virtualized network functions (VNFs) (e.g., firewalls, Intrusion Detection Systems (IDSs), and transcoders) within the proximity of users. This transition will enable network services, especially IoT applications, to be provisioned as network slices with sequences of VNFs, in order to guarantee the performance and security of their continuous data and control flows. In this paper we study the problems of delay-aware network slicing for multicasting traffic of IoT applications in edge networks. We first propose exact solutions by formulating the problems into Integer Linear Programs (ILPs). We further devise an approximation algorithm with an approximation ratio for the problem of delay-aware network slicing for a single multicast slice, with the objective to minimize the implementation cost of the network slice subject to its delay requirement constraint. Given multiple multicast slicing requests, we also propose an efficient heuristic that admits as many user requests as possible, through exploring the impact of a non-trivial interplay of the total computing resource demand and

show abstract

“…In NFV, several studies (e.g., [4], [13], [14]) consider the placement of a minimum number of VNF instances to cover all flows. A single type of network functions is considered in [4], [13], [15], [16], and the case of multiple network functions is considered in [14], [17], [18], [19], [20]. However, these work neglects either the budget constraint or the multi-dimensional resource allocation.…”

Section: Related Workmentioning

confidence: 99%

Placement and Allocation of Virtual Network Functions: Multi-dimensional Case

Sallam

Zheng

2019

2019 IEEE 27th International Conference on Network Protocols (ICNP)

View full text Add to dashboard Cite

Network function virtualization (NFV) is an emerging design paradigm that replaces physical middlebox devices with software modules running on general purpose commodity servers. While gradually transitioning to NFV, Internet service providers face the problem of where to introduce NFV in order to make the most benefit of that; here, we measure the benefit by the amount of traffic that can be serviced through the NFV. This problem is non-trivial as it is composed of two challenging subproblems: 1) placement of nodes to support virtual network functions (referred to as VNF-nodes); and 2) allocation of the VNF-nodes resources to network flows; the two subproblems need to be considered jointly to satisfy the objective of serving the maximum amount of traffic. This problem has been studied recently but for the one-dimensional setting, where all network flows require one network function, which requires a unit of resource to process a unit of flow. In this work, we extend to the multi-dimensional setting, where flows can require multiple network functions, which can also require a different amount of each resource to process a unit of flow. The multi-dimensional setting introduces new challenges in addition to those of the onedimensional setting (e.g., NP-hardness and non-submodularity) and also makes the resource allocation a multi-dimensional generalization of the generalized assignment problem with assignment restrictions. To address these difficulties, we propose a novel two-level relaxation method and utilize the primal-dual technique to design two approximation algorithms that achieve an approximation ratio of (e−1)(Z−1) 2e 2 Z(kR) 1/(Z−1) and (e−1)(Z−1) 2e(Z−1+eZR 1/(Z−1) ) , where k (resp. R) is the number of VNF-nodes (resp. resources), and Z is a measure of the available resource compared to flow demand. Finally, we perform extensive trace-driven simulations to show the effectiveness of the proposed algorithms.

show abstract

Embedding Service Function Tree With Minimum Cost for NFV-Enabled Multicast

Cited by 41 publications

References 36 publications

Virtual network function placement and routing for multicast service chaining using merged paths

Virtual network function placement and routing for multicast service chaining using merged paths

Enabling Multicast Slices in Edge Networks

Placement and Allocation of Virtual Network Functions: Multi-dimensional Case

Contact Info

Product

Resources

About