A two-stage failover mechanism for high availability in service function chaining

Hosung Baek, Haneul Ko, Gwangwoo Park, Sangheon Pack, Jiyoung Kwak

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)229-236
Number of pages8
JournalJournal of Internet Technology
Volume19
Issue number1
DOIs
Publication statusPublished - 2018 Jan 1

Fingerprint

Availability
Repair
Recovery

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 journalArticle

Baek, Hosung ; Ko, Haneul ; Park, Gwangwoo ; Pack, Sangheon ; Kwak, Jiyoung. / A two-stage failover mechanism for high availability in service function chaining. In: Journal of Internet Technology. 2018 ; Vol. 19, No. 1. pp. 229-236.
@article{c6bbfc8a10584f6c9ccc3946b2f2b67a,
title = "A two-stage failover mechanism for high availability in service function chaining",
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.",
keywords = "Backup, High availability (HA)r, Service function (SF), Service function chaining (SFC), Service node (SN)",
author = "Hosung Baek and Haneul Ko and Gwangwoo Park and Sangheon Pack and Jiyoung Kwak",
year = "2018",
month = "1",
day = "1",
doi = "10.3966/160792642018011901022",
language = "English",
volume = "19",
pages = "229--236",
journal = "Journal of Internet Technology",
issn = "1607-9264",
publisher = "Taiwan Academic Network Management Committee",
number = "1",

}

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 -