On Scalable Service Function Chaining with O(1) Flowtable Entries

Yi Ren, Tzu Ming Huang, Ching-Ju Lin, Yu-Chee Tseng

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

The emergence of Network Function Virtualization (NFV) enables flexible and agile service function chaining in a Software Defined Network (SDN). While this virtualization technology efficiently offers customization capability, it however comes with a cost of consuming precious TCAM resources. Due to this, the number of service chains that an SDN can support is limited by the flowtable size of a switch. To break this limitation, this paper presents CRT-Chain, a service chain forwarding protocol that requires only constant flowtable entries, regardless of the number of service chain requests. The core of CRT-Chain is an encoding mechanism that leverages Chinese Remainder Theorem (CRT) to compress the forwarding information into small labels. A switch does not need to insert forwarding rules for every service chain request, but only needs to conduct very simple modular arithmetic to extract the forwarding rules directly from CRT-Chain's labels attached in the header. We further incorporate prime reuse and path segmentation in CRT-Chain to reduce the header size and, hence, save bandwidth consumption. Our evaluation results show that, when a chain consists of no more than 5 functions, CRT-Chain actually generates a header smaller than the legacy 32-bit header defined in IETF. By enabling prime reuse and segmentation, CRT-Chain further reduces the total signaling overhead to a level lower than the conventional scheme, showing that CRT-Chain not only enables scalable flowtable-free chaining but also improves network efficiency.

Original languageEnglish
Title of host publicationINFOCOM 2018 - IEEE Conference on Computer Communications
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages702-710
Number of pages9
ISBN (Electronic)9781538641286
DOIs
StatePublished - 11 Oct 2018
Event2018 IEEE Conference on Computer Communications, INFOCOM 2018 - Honolulu, United States
Duration: 15 Apr 201819 Apr 2018

Publication series

NameProceedings - IEEE INFOCOM
Volume2018-April
ISSN (Print)0743-166X

Conference

Conference2018 IEEE Conference on Computer Communications, INFOCOM 2018
CountryUnited States
CityHonolulu
Period15/04/1819/04/18

Fingerprint Dive into the research topics of 'On Scalable Service Function Chaining with O(1) Flowtable Entries'. Together they form a unique fingerprint.

  • Cite this

    Ren, Y., Huang, T. M., Lin, C-J., & Tseng, Y-C. (2018). On Scalable Service Function Chaining with O(1) Flowtable Entries. In INFOCOM 2018 - IEEE Conference on Computer Communications (pp. 702-710). [8486396] (Proceedings - IEEE INFOCOM; Vol. 2018-April). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFOCOM.2018.8486396