TY - GEN
T1 - Virtual network function placement and routing model for multicast service chaining based on merging multiple service paths
AU - Kiji, Narumi
AU - Sato, Takehiro
AU - Shinkuma, Ryoichi
AU - Oki, Eiji
N1 - Funding Information:
This work was supported in part by JSPS KAKENHI, Japan, under Grant Numbers 15K00116 and 18H03230.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/5
Y1 - 2019/5
N2 - In this paper, we propose a virtual network function placement and routing model for multicast service chaining based on merging multiple service paths (MSC-M). The multicast service chaining (MSC) provides a multicast path, which connects a source node and multiple destination nodes, and virtual network functions (VNFs) are placed on the path so that users on the destination nodes receive their desired services. The conventional MSC model configures multicast paths for services, each of which has the same source data and the same set of VNFs in a predefined order. In the MSC-M model, if paths of different services carry the same data on the same link, these paths are allowed to be merged into one path at that link, which improves the utilization of network resources. The MSC-M model determines the placement of VNFs and the route of paths so that the total cost associated with VNF placement and link usage is minimized. The MSC-M model is formulated as an integer linear programming (ILP) problem. In the ILP problem, data flows whose source data is the same and which already passed the same subset of VNFs belong to the same group. A part of paths of different services which carry data flows belonging to the same group are allowed to be merged into one path. Numerical results show that the MSC-M model reduces the total cost by 28.7% at a maximum compared to the conventional MSC model.
AB - In this paper, we propose a virtual network function placement and routing model for multicast service chaining based on merging multiple service paths (MSC-M). The multicast service chaining (MSC) provides a multicast path, which connects a source node and multiple destination nodes, and virtual network functions (VNFs) are placed on the path so that users on the destination nodes receive their desired services. The conventional MSC model configures multicast paths for services, each of which has the same source data and the same set of VNFs in a predefined order. In the MSC-M model, if paths of different services carry the same data on the same link, these paths are allowed to be merged into one path at that link, which improves the utilization of network resources. The MSC-M model determines the placement of VNFs and the route of paths so that the total cost associated with VNF placement and link usage is minimized. The MSC-M model is formulated as an integer linear programming (ILP) problem. In the ILP problem, data flows whose source data is the same and which already passed the same subset of VNFs belong to the same group. A part of paths of different services which carry data flows belonging to the same group are allowed to be merged into one path. Numerical results show that the MSC-M model reduces the total cost by 28.7% at a maximum compared to the conventional MSC model.
KW - Multicast
KW - Network function virtualization
KW - Service chaining
KW - Virtual network function
UR - http://www.scopus.com/inward/record.url?scp=85071956696&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85071956696&partnerID=8YFLogxK
U2 - 10.1109/HPSR.2019.8807998
DO - 10.1109/HPSR.2019.8807998
M3 - Conference contribution
AN - SCOPUS:85071956696
T3 - IEEE International Conference on High Performance Switching and Routing, HPSR
BT - 2019 IEEE 20th International Conference on High Performance Switching and Routing, HPSR 2019
PB - IEEE Computer Society
T2 - 20th IEEE International Conference on High Performance Switching and Routing, HPSR 2019
Y2 - 26 May 2019 through 29 May 2019
ER -