论文标题
将最低成本SFC嵌入端到端延迟约束
Embedding the Minimum Cost SFC with End-to-end Delay Constraint
论文作者
论文摘要
许多网络应用程序，尤其是多媒体应用程序，通常会以高QoS（例如端到端延迟约束）提供流量。这些应用程序的流量通常需要在到达客户端的主机之前有序地遍历一系列不同的网络功能，这称为服务功能链（SFC）。网络功能虚拟化（NFV）的出现增加了此类网络功能的部署灵活性。在本文中，我们介绍了将SFC嵌入给定流量的启发式方法，以考虑以下方面的流动：i）沿路径沿端到端限制的端到端延迟，ii）SFC嵌入的最低成本，成本和成本和延迟可以是独立的指标，并将其附加到链接和节点上。嵌入SFC的问题是NP-HARD，可以将其简化为背包问题。然后，我们设计了一种应用于多级网络的贪婪算法。仿真结果表明，多级贪婪算法可以有效地解决NP硬化问题。
Many network applications, especially the multimedia applications, often deliver flows with high QoS, like end-to-end delay constraint. Flows of these applications usually need to traverse a series of different network functions orderly before reaching to the host in the customer end, which is called the service function chain (SFC). The emergence of network function virtualization (NFV) increases the deployment flexibility of such network functions. In this paper, we present heuristics to embed the SFC for a given flow considering: i) bounded end-to-end delay along the path, and ii) minimum cost of the SFC embedding, where cost and delay can be independent metrics and be attached to both links and nodes. This problem of embedding SFC is NP-hard, which can be reduced to the Knapsack problem. We then design a greedy algorithm which is applied to a multilevel network. The simulation results demonstrate that the multilevel greedy algorithm can efficiently solve the NP-hard problem.
