Title
OpenFlow Accelerator: A Decomposition-Based Hashing Approach for Flow Processing
Abstract
To support scalable, flexible software-defined networking, OpenFlow is designed to provide granular traffic control across multiple vendor's network devices for efficient flow processing. Decision-tree packet classification algorithms do not scale to the number of flow table fields while decomposition algorithms such as RFC fail to provide necessary incremental update and determinism. Since searching in a single field is well studied, e.g. Longest Prefix Match (LPM) for prefix fields, we propose a decomposition approach which performs individual search on each flow table field, aggregates these results and conducts a query in a single hash table. Our approach scales well to the number of fields and allows incremental update. Meanwhile deterministic query is enabled for high-speed search. As far as we know our proposal is the first efficient decomposition approach to address multidimensional match in an OpenFlow flow table with an arbitrary number of fields as well as any match type. Theoretical analysis and experiments using synthetic classifiers justify the performance improvement.
Year
DOI
Venue
2015
10.1109/ICCCN.2015.7288440
2015 24th International Conference on Computer Communication and Networks (ICCCN)
Keywords
Field
DocType
OpenFlow accelerator,decomposition-based hashing approach,flow processing,software defined networking,granular traffic control,vendor network devices,decision-tree packet classification algorithms,decomposition algorithms,RFC,longest prefix match,LPM,prefix fields,deterministic query,OpenFlow flow table,synthetic classifiers
Computer science,Networking hardware,Computer network,Prefix,OpenFlow,Longest prefix match,Hash function,Performance improvement,Hash table,Distributed computing,Scalability
Conference
ISSN
Citations 
PageRank 
1095-2055
0
0.34
References 
Authors
17
4
Name
Order
Citations
PageRank
Hai Sun171.91
Yan Lindsay Sun27510.41
Victor C. Valgenti3297.00
Min Sik Kim425527.17