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.
| Original language | English |
|---|---|
| Pages (from-to) | 229-236 |
| Number of pages | 8 |
| Journal | Journal of Internet Technology |
| Volume | 19 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2018 Jan 1 |
Fingerprint
Keywords
- Backup
- High availability (HA)r
- Service function (SF)
- Service function chaining (SFC)
- Service node (SN)
ASJC Scopus subject areas
- Software
- Computer Networks and Communications
Cite this
A two-stage failover mechanism for high availability in service function chaining. / Baek, Hosung; Ko, Haneul; Park, Gwangwoo; Pack, Sangheon; Kwak, Jiyoung.
In: Journal of Internet Technology, Vol. 19, No. 1, 01.01.2018, p. 229-236.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A two-stage failover mechanism for high availability in service function chaining
AU - Baek, Hosung
AU - Ko, Haneul
AU - Park, Gwangwoo
AU - Pack, Sangheon
AU - Kwak, Jiyoung
PY - 2018/1/1
Y1 - 2018/1/1
N2 - 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.
AB - 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.
KW - Backup
KW - High availability (HA)r
KW - Service function (SF)
KW - Service function chaining (SFC)
KW - Service node (SN)
UR - http://www.scopus.com/inward/record.url?scp=85046821868&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85046821868&partnerID=8YFLogxK
U2 - 10.3966/160792642018011901022
DO - 10.3966/160792642018011901022
M3 - Article
AN - SCOPUS:85046821868
VL - 19
SP - 229
EP - 236
JO - Journal of Internet Technology
JF - Journal of Internet Technology
SN - 1607-9264
IS - 1
ER -