Adaptive Service-Chain Routing for Virtual Network Functions in Software-Defined Networks
Adaptive Service-Chain Routing for Virtual Network Functions in Software-Defined Networks
复制标题
DOI：
10.1145/2940147.2940148
复制
发表时间：
2016-08
期刊：
影响因子：
--
通讯作者：
Abhishek Dwaraki;T. Wolf
中科院分区：
文献类型：
--
作者：
Abhishek Dwaraki;T. Wolf
软件定义网络正在将数据通信网络转向更集中的控制。虚拟机和轻量级容器的可用性使虚拟网络功能能够按需动态放置。一个关键的挑战是有效地路由服务链请求，并将处理功能放置在网络中的操作约束下。提出了一种新的解决软件定义网络中节点受限服务链路由问题的方法。其主要思想是将网络表示转换为分层图，该分层图考虑处理步骤并允许使用传统的最短路径算法（如Dijkstra算法）来解决问题。我们证明了这种方法的可行性，通过一个模拟的原型实现，使用动态利用率测量的链接和主机，以确定在运行时的网络条件。
Software-defined networking is shifting data communication networks toward more centralized control. The availability of virtual machines and lightweight containers enables dynamic placement of virtual network functions on demand. A key challenge is to efficiently route service-chain requests and place processing functions in a network under operational constraints. We present a novel method of solving the node-constrained service chain routing problem in a software-defined network. The main idea is to transform the network representation to a layered graph that considers processing steps and allows the use of conventional shortest-path algorithms, such as Dijkstra's algorithm, to solve the problem. We demonstrate the feasibility of this approach through an emulated prototype implementation that uses dynamic utilization measurements on links and hosts to determine network conditions at runtime.