Hosung Baek, Haneul Ko, Gwangwoo Park, Sangheon Pack, Jiyoung Kwak
{"title":"业务功能链中高可用性的两阶段故障转移机制","authors":"Hosung Baek, Haneul Ko, Gwangwoo Park, Sangheon Pack, Jiyoung Kwak","doi":"10.3966/160792642018011901022","DOIUrl":null,"url":null,"abstract":"Service function chaining (SFC) enables specific network flows to be processed through an ordered set of service functions. In this paper, we propose a two-stage failover mechanism to provide high availability (HA) in SFC. In the proposed mechanism, a secondary service function path (SFP) is pre-computed, which is maximally disjointed with the primary SFP, and a backup service function instance (SFI) is prepared for each service function. For a failure event, the first local repair stage is examined by means of the preconfigured backup SFI. If the backup SFI is not available and/or any link is failed, the second end-to-end repair stage is triggered by replacing the primary SFP with the secondary SFP. Simulation results demonstrate that the proposed failover mechanism can reduce the recovery time by 50%-75% compared to the conventional approach.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"229-236"},"PeriodicalIF":0.9000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Two-Stage Failover Mechanism for High Availability in Service Function Chaining\",\"authors\":\"Hosung Baek, Haneul Ko, Gwangwoo Park, Sangheon Pack, Jiyoung Kwak\",\"doi\":\"10.3966/160792642018011901022\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Service function chaining (SFC) enables specific network flows to be processed through an ordered set of service functions. In this paper, we propose a two-stage failover mechanism to provide high availability (HA) in SFC. In the proposed mechanism, a secondary service function path (SFP) is pre-computed, which is maximally disjointed with the primary SFP, and a backup service function instance (SFI) is prepared for each service function. For a failure event, the first local repair stage is examined by means of the preconfigured backup SFI. If the backup SFI is not available and/or any link is failed, the second end-to-end repair stage is triggered by replacing the primary SFP with the secondary SFP. Simulation results demonstrate that the proposed failover mechanism can reduce the recovery time by 50%-75% compared to the conventional approach.\",\"PeriodicalId\":50172,\"journal\":{\"name\":\"Journal of Internet Technology\",\"volume\":\"19 1\",\"pages\":\"229-236\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Internet Technology\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.3966/160792642018011901022\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Internet Technology","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3966/160792642018011901022","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1
摘要
SFC (Service function chains)是指将特定的网络流通过一组有序的业务功能进行处理。为了在SFC中提供高可用性,我们提出了一种两阶段的故障转移机制,在该机制中,预先计算出与主SFP最大程度分离的辅助业务功能路径(secondary service function path, SFP),并为每个业务功能准备一个备份业务功能实例(backup service function instance, SFI)。对于故障事件,通过预先配置的备份SFI检查第一个本地修复阶段。如果备份SFI不可用和/或任何链路失败,则通过用辅助SFP替换主SFP来触发第二个端到端修复阶段。仿真结果表明,所提出的故障转移机制比传统的故障转移机制可减少50% ~ 75%的恢复时间。
A Two-Stage Failover Mechanism for High Availability in Service Function Chaining
Service function chaining (SFC) enables specific network flows to be processed through an ordered set of service functions. In this paper, we propose a two-stage failover mechanism to provide high availability (HA) in SFC. In the proposed mechanism, a secondary service function path (SFP) is pre-computed, which is maximally disjointed with the primary SFP, and a backup service function instance (SFI) is prepared for each service function. For a failure event, the first local repair stage is examined by means of the preconfigured backup SFI. If the backup SFI is not available and/or any link is failed, the second end-to-end repair stage is triggered by replacing the primary SFP with the secondary SFP. Simulation results demonstrate that the proposed failover mechanism can reduce the recovery time by 50%-75% compared to the conventional approach.
期刊介绍:
The Journal of Internet Technology accepts original technical articles in all disciplines of Internet Technology & Applications. Manuscripts are submitted for review with the understanding that they have not been published elsewhere.
Topics of interest to JIT include but not limited to:
Broadband Networks
Electronic service systems (Internet, Intranet, Extranet, E-Commerce, E-Business)
Network Management
Network Operating System (NOS)
Intelligent systems engineering
Government or Staff Jobs Computerization
National Information Policy
Multimedia systems
Network Behavior Modeling
Wireless/Satellite Communication
Digital Library
Distance Learning
Internet/WWW Applications
Telecommunication Networks
Security in Networks and Systems
Cloud Computing
Internet of Things (IoT)
IPv6 related topics are especially welcome.