首页> 外文会议>IEEE NetSoft Conference and Workshops >Semantic validation of affinity constrained service function chain requests
【24h】

Semantic validation of affinity constrained service function chain requests

机译:亲和力约束服务功能链请求的语义验证

获取原文

摘要

Network Function Virtualization (NFV) has been proposed as a paradigm to increase the cost-efficiency, flexibility and innovation in network service provisioning. By leveraging IT virtualization techniques in combination with programmable networks, NFV is able to decouple network functionality from the physical devices on which they are deployed. This opens up new business opportunities for both Infrastructure Providers (InPs) as well as Service Providers (SPs), where the SP can request to deploy a chain of Virtual Network Functions (VNFs) on top of which its service can run. However, current NFV approaches lack the possibility for SPs to define location requirements and constraints on the mapping of virtual functions and paths onto physical hosts and links. Nevertheless, many scenarios can be envisioned in which the SP would like to attach placement constraints for efficiency, resilience, legislative, privacy and economic reasons. Therefore, we propose a set of affinity and anti-affinity constraints, which can be used by SPs to define such placement restrictions. This newfound ability to add constraints to Service Function Chain (SFC) requests also introduces an additional risk that SFCs with conflicting constraints are requested or automatically generated. Therefore, a framework is proposed that allows the InP to check the validity of a set of constraints and provide feedback to the SP. To achieve this, the SFC request and relevant information on the physical topology are modeled as an ontology of which the consistency can be checked using a semantic reasoner. Enabling semantic validation of SFC requests, eliminates inconsistent SFCs requests from being transferred to the embedding algorithm.
机译:网络功能虚拟化(NFV)已提出为范例,以提高网络服务供应中的成本效率,灵活性和创新。通过与可编程网络结合使用虚拟化技术,NFV能够从部署它们的物理设备中解耦网络功能。这为基础架构提供商(INPS)以及服务提供商(SP)开辟了新的商业机会,其中SP可以请求部署一系列虚拟网络功能(VNF),其服务可以运行。然而,当前的NFV方法缺乏SPS定义位置要求和对物理主机和链路上的虚拟功能和路径的映射的限制的可能性。尽管如此,可以设想许多方案,其中SP希望附上效率,恢复,立法,隐私和经济原因的放置限制。因此,我们提出了一系列的亲和力和反亲和力约束,可以由SPS使用,以定义这种放置限制。这种向服务功能链(SFC)请求添加约束的新发现能够引入具有冲突约束的SFC的额外风险,或自动生成。因此,提出了一种框架,其允许INP检查一组约束的有效性并向SP提供反馈。为此,SFC请求和关于物理拓扑的相关信息被建模为本体,其中可以使用语义推理员检查一致性。启用S​​FC请求的语义验证,消除了从传输到嵌入算法的不一致的SFC请求。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号