首页> 外文会议> >Performance guarantee aware orchestration for service function chains with elastic demands
【24h】

Performance guarantee aware orchestration for service function chains with elastic demands

机译:具有弹性需求的服务功能链的性能保证感知编排

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

摘要

In this paper, we study how to provide optimal performance guarantee in multi-resource scenarios, such as Network Function Virtualization (NFV), where Virtual Network Function (VNF) resource demands of one Service Function Chain (SFC) are elastic and correlated with the end-to-end throughput of SFC. Previous works such as Dominant Resource Fairness (DRF) achieve this goal only if the demands are already orchestrated to dedicated resource instances. However, how to orchestrate SFC to VNF instances is a key issue in NFV. Few previous works have investigated the relationship between them. In this paper, we consider the problem of SFC orchestration subject to DRF allocation scheme so as to find the orchestration scheme with optimal performance guarantee. We analyze it and model it as SFC Performance Guarantee (SFC-PG) problem, followed by a Mixed Integer Linear Programming (MILP) formulation. We design a heuristic Performance Guarantee Aware Orchestration (PGAO) to solve it in large scale cases. We conduct simulations with a variety of circumstances and parameters, and the results demonstrate that PGAO achieves better performance compared to existing solutions.
机译:在本文中,我们研究了如何在多资源场景中提供最佳性能保证,例如网络功能虚拟化(NFV),其中一个服务功能链(SFC)的虚拟网络功能(VNF)资源需求具有弹性并且与服务功能链相关联。 SFC的端到端吞吐量。仅当需求已经针对专用资源实例进行协调时,以前的作品(如“主导资源公平性”(DRF))才能实现此目标。但是,如何将SFC整理到VNF实例是NFV中的关键问题。以前的著作很少研究它们之间的关系。在本文中,我们考虑了采用DRF分配方案的SFC编排问题,以找到具有最佳性能保证的编排方案。我们对其进行分析并将其建模为SFC性能保证(SFC-PG)问题,然后采用混合整数线性规划(MILP)公式。我们设计了一种启发式性能保证感知编排(PGAO)来解决大规模案例。我们在各种情况和参数下进行仿真,结果表明PGAO与现有解决方案相比具有更好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号