Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ren, Yi | en_US |
dc.contributor.author | Huang, Tzu-Ming | en_US |
dc.contributor.author | Lin, Kate Ching-Ju | en_US |
dc.contributor.author | Tseng, Yu-Chee | en_US |
dc.date.accessioned | 2020-05-05T00:00:50Z | - |
dc.date.available | 2020-05-05T00:00:50Z | - |
dc.date.issued | 2018-01-01 | en_US |
dc.identifier.isbn | 978-1-5386-4128-6 | en_US |
dc.identifier.issn | 0743-166X | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/153855 | - |
dc.description.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. | en_US |
dc.language.iso | en_US | en_US |
dc.title | On Scalable Service Function Chainingng with O(1) Flowtable Entries | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2018) | en_US |
dc.citation.spage | 702 | en_US |
dc.citation.epage | 710 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000509768900079 | en_US |
dc.citation.woscount | 2 | en_US |
Appears in Collections: | Conferences Paper |