首页> 外文期刊>Services Computing, IEEE Transactions on >Improve Service Chaining Performance with Optimized Middlebox Placement
【24h】

Improve Service Chaining Performance with Optimized Middlebox Placement

机译:通过优化的中间盒放置来提高服务链性能

获取原文
获取原文并翻译 | 示例

摘要

Previous works have proposed various approaches to implement service chaining by routing traffic through the desired middleboxes according to pre-defined policies. However, no matter what routing scheme is used, the performance of service chaining depends on where these middleboxes are placed. Thus, in this paper, we study middlebox placement problem, i.e., given network information and policy specifications, we attempt to determine the optimal locations to place the middleboxes so that the performance is optimized. The performance metrics studied in this paper include the end-to-end delay and the bandwidth consumption, which cover both users’ and network providers’ interests. We first formulate it as 0-1 programming problem, and prove it is NP-hard. We then propose two heuristic algorithms to obtain the sub-optimal solutions. The first algorithm is a greedy algorithm, and the second algorithm is based on simulated annealing. Through extensive simulations, we show that in comparison with a baseline algorithm, the proposed algorithms can reduce 22 percent end-to-end delay and save 38 percent bandwidth consumption on average. The formulation and proposed algorithms have no special assumption on network topology or policy specifications, therefore, they have broad range of applications in various types of networks such as enterprise, data center and broadband access networks.
机译:先前的工作提出了各种方法,以根据预定义的策略通过所需中间盒路由流量来实现服务链。但是,无论使用哪种路由方案,服务链接的性能都取决于这些中间盒的放置位置。因此,在本文中,我们研究了中间盒放置问题,即在给定网络信息和策略规范的情况下,我们尝试确定放置中间盒的最佳位置,从而优化性能。本文研究的性能指标包括端到端延迟和带宽消耗,它们涵盖了用户和网络提供商的利益。我们首先将其表达为0-1编程问题,并证明它是NP难的。然后,我们提出了两种启发式算法来获得次优解。第一种算法是贪婪算法,第二种算法基于模拟退火。通过广泛的仿真,我们表明与基线算法相比,所提出的算法可以减少22%的端到端延迟,平均节省38%的带宽消耗。公式和提出的算法对网络拓扑或策略规范没有特殊的假设,因此,它们在各种类型的网络(例如企业,数据中心和宽带接入网络)中具有广泛的应用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号