| （英） |
Service chaining is attracting attention as a promising technology for providing services using multiple virtual network functions (VNFs) which are instantiated on commercial off-the-shelf servers.
Packets which are forwarded on the service chain have requirements for quality of service (QoS) such as packet loss probaility, and hence VNF must have a sufficient amount of processing resources to meet those requirements.
However, since the number of VNF instances and the amount of processing resources are the costs for constructing service chains, it is necessary to keep the costs down as much as possible.
Although the number of instances can be reduced by sharing the VNF among multiple service chains, the number of packets arriving at the VNF increases.
Therefore, the amount of processing resources must be allocated according to the requirement for the packet loss probability.
In this paper, we propose a service chain construction method that minimizes the costs while satisfying the requirement for the packet loss probability.
In the proposed method, each VNF is modeled by the M/M/1/K queue and the loss probability is taken into account.
In addition, the proposed method determines the VNF placement, the amount of resources allocated to the VNF, and the transmission route in each service chain.
We evaluate the performance of the proposed method by simulation and show the effectiveness of the proposed method in a numerical examples. |