HomePublications

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

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

Standard

On Scalable Service Function Chaining with O(1) Flowtable Entries. / Ren, Yi; Huang, Tzu-Ming; Lin, Kate Ching-Ju; Tseng, Yu-Chee.

IEEE INFOCOM 2018 - IEEE Conference on Computer Communications. IEEE Press, 2018. p. 702-710.

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

Harvard

Ren, Y, Huang, T-M, Lin, KC-J & Tseng, Y-C 2018, On Scalable Service Function Chaining with O(1) Flowtable Entries. in IEEE INFOCOM 2018 - IEEE Conference on Computer Communications. IEEE Press, pp. 702-710, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, 16/04/18. https://doi.org/10.1109/INFOCOM.2018.8486396

APA

Ren, Y., Huang, T-M., Lin, K. C-J., & Tseng, Y-C. (2018). On Scalable Service Function Chaining with O(1) Flowtable Entries. In IEEE INFOCOM 2018 - IEEE Conference on Computer Communications (pp. 702-710). IEEE Press. https://doi.org/10.1109/INFOCOM.2018.8486396

Vancouver

Ren Y, Huang T-M, Lin KC-J, Tseng Y-C. On Scalable Service Function Chaining with O(1) Flowtable Entries. In IEEE INFOCOM 2018 - IEEE Conference on Computer Communications. IEEE Press. 2018. p. 702-710 https://doi.org/10.1109/INFOCOM.2018.8486396

Author

Ren, Yi ; Huang, Tzu-Ming ; Lin, Kate Ching-Ju ; Tseng, Yu-Chee. / On Scalable Service Function Chaining with O(1) Flowtable Entries. IEEE INFOCOM 2018 - IEEE Conference on Computer Communications. IEEE Press, 2018. pp. 702-710

Bibtex- Download

@inproceedings{d0256a89809845fab21145ac63fa91f4,
title = "On Scalable Service Function Chaining with O(1) Flowtable Entries",
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.",
author = "Yi Ren and Tzu-Ming Huang and Lin, {Kate Ching-Ju} and Yu-Chee Tseng",
year = "2018",
month = "10",
day = "11",
doi = "10.1109/INFOCOM.2018.8486396",
language = "English",
pages = "702--710",
booktitle = "IEEE INFOCOM 2018 - IEEE Conference on Computer Communications",
publisher = "IEEE Press",

}

RIS (suitable for import to EndNote) - Download

TY - GEN

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

AU - Ren, Yi

AU - Huang, Tzu-Ming

AU - Lin, Kate Ching-Ju

AU - Tseng, Yu-Chee

PY - 2018/10/11

Y1 - 2018/10/11

N2 - 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.

AB - 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.

U2 - 10.1109/INFOCOM.2018.8486396

DO - 10.1109/INFOCOM.2018.8486396

M3 - Conference contribution

SP - 702

EP - 710

BT - IEEE INFOCOM 2018 - IEEE Conference on Computer Communications

PB - IEEE Press

ER -

ID: 144257012