TagFlow: Efficient Flow Classification in SDN
Summary :
We propose TagFlow, a data plane mechanism for classification in Software-Defined Networking (SDN). We first argue that simple field-matching proposals of current SDN APIs are not efficient and flexible enough and then propose a tag based classification mechanism as an alternative. Moreover, we propose user-defined actions as an improvement over current hardcoded actions in SDN APIs. Our experiments show TagFlow forwarding is almost 40% faster than OpenFlow. Furthermore, our user-defined actions at SDN southbound are thousands of times faster that equivalent northbound implementations in the literature.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E97-B No.11 pp.2302-2310
- Publication Date
- 2014/11/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E97.B.2302
- Type of Manuscript
- Special Section PAPER (Special Section on Network Virtualization, and Fusion Platform of Computing and Networking)
- Category
Authors
Hamid FARHADY
The University of Tokyo
Akihiro NAKAO
The University of Tokyo
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hamid FARHADY, Akihiro NAKAO, "TagFlow: Efficient Flow Classification in SDN" in IEICE TRANSACTIONS on Communications,
vol. E97-B, no. 11, pp. 2302-2310, November 2014, doi: 10.1587/transcom.E97.B.2302.
Abstract: We propose TagFlow, a data plane mechanism for classification in Software-Defined Networking (SDN). We first argue that simple field-matching proposals of current SDN APIs are not efficient and flexible enough and then propose a tag based classification mechanism as an alternative. Moreover, we propose user-defined actions as an improvement over current hardcoded actions in SDN APIs. Our experiments show TagFlow forwarding is almost 40% faster than OpenFlow. Furthermore, our user-defined actions at SDN southbound are thousands of times faster that equivalent northbound implementations in the literature.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E97.B.2302/_p
Copy
@ARTICLE{e97-b_11_2302,
author={Hamid FARHADY, Akihiro NAKAO, },
journal={IEICE TRANSACTIONS on Communications},
title={TagFlow: Efficient Flow Classification in SDN},
year={2014},
volume={E97-B},
number={11},
pages={2302-2310},
abstract={We propose TagFlow, a data plane mechanism for classification in Software-Defined Networking (SDN). We first argue that simple field-matching proposals of current SDN APIs are not efficient and flexible enough and then propose a tag based classification mechanism as an alternative. Moreover, we propose user-defined actions as an improvement over current hardcoded actions in SDN APIs. Our experiments show TagFlow forwarding is almost 40% faster than OpenFlow. Furthermore, our user-defined actions at SDN southbound are thousands of times faster that equivalent northbound implementations in the literature.},
keywords={},
doi={10.1587/transcom.E97.B.2302},
ISSN={1745-1345},
month={November},}
Copy
TY - JOUR
TI - TagFlow: Efficient Flow Classification in SDN
T2 - IEICE TRANSACTIONS on Communications
SP - 2302
EP - 2310
AU - Hamid FARHADY
AU - Akihiro NAKAO
PY - 2014
DO - 10.1587/transcom.E97.B.2302
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E97-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2014
AB - We propose TagFlow, a data plane mechanism for classification in Software-Defined Networking (SDN). We first argue that simple field-matching proposals of current SDN APIs are not efficient and flexible enough and then propose a tag based classification mechanism as an alternative. Moreover, we propose user-defined actions as an improvement over current hardcoded actions in SDN APIs. Our experiments show TagFlow forwarding is almost 40% faster than OpenFlow. Furthermore, our user-defined actions at SDN southbound are thousands of times faster that equivalent northbound implementations in the literature.
ER -
English
