Pre-provisioning Protection for Faster Failure Recovery in Service Function Chaining

P. Thorat, Niraj Kumar Dubey
{"title":"Pre-provisioning Protection for Faster Failure Recovery in Service Function Chaining","authors":"P. Thorat, Niraj Kumar Dubey","doi":"10.1109/CONECCT50063.2020.9198654","DOIUrl":null,"url":null,"abstract":"Service function chaining (SFC) enables the traffic to be sequentially processed by the service functions (SFs) based on its service requirement. Any failure on the service function path (SFP) of the SFC needs to be rapidly recovered for continued end-to-end service delivery. A local detouring approach could achieve rapid recovery. However, providing local protection to each component on an SFP could consume memory of the switch to store alternate path flow rules. In addition, the efforts required for per-flow detouring in local detouring could overburden the software-defined networking controller (SDNC). In order to reduce the complexity associated with the recovery process, we propose the segment-based SFP protection (SSP) approach. Our proposed SSP approach divides the SFP into a set of service segments (SSes). Our proposed SSP approach employs the flow-grouping strategy to group the flows that share the common SS to enable local detouring via a single point of change in action and thus minimizes the effort required for per-flow detouring. Additionally, the SSP approach conserves the switch memory consumption for configuring SFP and its protection.","PeriodicalId":261794,"journal":{"name":"2020 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONECCT50063.2020.9198654","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Service function chaining (SFC) enables the traffic to be sequentially processed by the service functions (SFs) based on its service requirement. Any failure on the service function path (SFP) of the SFC needs to be rapidly recovered for continued end-to-end service delivery. A local detouring approach could achieve rapid recovery. However, providing local protection to each component on an SFP could consume memory of the switch to store alternate path flow rules. In addition, the efforts required for per-flow detouring in local detouring could overburden the software-defined networking controller (SDNC). In order to reduce the complexity associated with the recovery process, we propose the segment-based SFP protection (SSP) approach. Our proposed SSP approach divides the SFP into a set of service segments (SSes). Our proposed SSP approach employs the flow-grouping strategy to group the flows that share the common SS to enable local detouring via a single point of change in action and thus minimizes the effort required for per-flow detouring. Additionally, the SSP approach conserves the switch memory consumption for configuring SFP and its protection.
预发放保护,实现业务功能链中更快的故障恢复
SFC (Service function chains)是一种业务功能链,可以使流量按照业务需求依次在各个业务功能间进行处理。SFC的SFP (service function path)故障需要快速恢复,以保证端到端业务的持续交付。局部绕行可以实现快速恢复。然而,为SFP上的每个组件提供本地保护可能会消耗交换机的内存来存储备用路径流规则。此外,在局部绕行中,逐流绕行所需的工作量可能会使软件定义网络控制器(SDNC)负担过重。为了降低与恢复过程相关的复杂性,我们提出了基于段的SFP保护(SSP)方法。我们提出的SSP方法将SFP划分为一组服务段(sse)。我们提出的SSP方法采用流分组策略对共享公共SS的流进行分组,通过单点改变来实现局部绕行,从而最大限度地减少了每个流绕行所需的工作量。此外,SSP方法节省了配置SFP及其保护的交换机内存消耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信