poster

Free access

Replication free rule grouping for packet classification

Authors:

Xiang Wang,

Chang Chen,

Jun LiAuthors Info & Claims

SIGCOMM '13: Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM

Pages 539 - 540

https://doi.org/10.1145/2486001.2491709

Published: 27 August 2013 Publication History

PDF eReader

Abstract

Most recent works demonstrate that grouping methodology could bring significant reduction of memory usage to decision-tree packet classification algorithms, with insignificant impact on throughput. However, these grouping techniques can hardly eliminate rule-replication completely. This work proposes a novel rule grouping algorithm without any replication. At each space decomposition step, all rules projecting on the split dimension form the maximum number of non-overlapped ranges, which guarantees the modest memory usage and grouping speed. Evaluation shows that the proposed algorithm achieves comparable memory size with less pre-processing time.

References

[1]

J. Pettit, J. Gross, B. Pfaff, M. Casado and S. Crosby. "Virtual Switching in an Era of Advanced Edges", in Proc. of DC CAVES, 2010.

Google Scholar

[2]

B. Vamanan, G. Voskuilen and T. Vijaykumar. "EffiCuts: Optimizing Packet Classification for Memory and Throughput", in Proc. of SIGCOMM, 2010.

Digital Library

Google Scholar

[3]

J. Fong, X. Wang, Y. Qi, J. Li and W. Jiang. "ParaSplit: A Scalable Architecture on FPGA for Terabit Packet Classification," in Proc. of HOTI, 2012.

Digital Library

Google Scholar

[4]

Y. Qi, L. Xu, B. Yang, Y. Xue and J. Li. "Packet Clas-sification Algorithms: From Theory to Practice", in Proc. of INFOCOM, 2009.

Google Scholar

Cited By

View all

Wang XShi WXiang YLi J(2016)Efficient Network Security Policy Enforcement With Policy Space AnalysisIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2015.250240224:5(2926-2938)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1109/TNET.2015.2502402
Sureshkumar TLingaraj MAnand BPremkumar T(2018)Hybrid firefly bat algorithm (HFBA)–based network security policy enforcement for PSAInternational Journal of Communication Systems10.1002/dac.374031:14Online publication date: 11-Jul-2018
https://doi.org/10.1002/dac.3740
Sureshkumar TLingaraj MAnand BPremkumar T(2018)Non‐dominated sorting particle swarm optimization (NSPSO) and network security policy enforcement for Policy Space AnalysisInternational Journal of Communication Systems10.1002/dac.355431:10Online publication date: Mar-2018
https://doi.org/10.1002/dac.3554
Show More Cited By

Index Terms

Replication free rule grouping for packet classification
1. Networks
  1. Network services
    1. Network management
    2. Network monitoring

Recommendations

EffiCuts: optimizing packet classification for memory and throughput
SIGCOMM '10

Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate a classifier's rules. Despite their optimizations, the algorithms incur ...
Replication free rule grouping for packet classification

Most recent works demonstrate that grouping methodology could bring significant reduction of memory usage to decision-tree packet classification algorithms, with insignificant impact on throughput. However, these grouping techniques can hardly eliminate ...
EffiCuts: optimizing packet classification for memory and throughput
SIGCOMM '10: Proceedings of the ACM SIGCOMM 2010 conference

Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate a classifier's rules. Despite their optimizations, the algorithms incur ...

Comments

Information & Contributors

Information

Published In

SIGCOMM '13: Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM

August 2013

580 pages

ISBN:9781450320566

DOI:10.1145/2486001

General Chairs:
Dah Ming Chiu
Chinese University of Hong Kong, China
,
Jia Wang
AT&T Labs - Research, USA
,
Program Chairs:
Paul Barford
University of Wisconsin, USA
,
Srinivasan Seshan
Carnegie Mellon University, USA

ACM SIGCOMM Computer Communication Review Volume 43, Issue 4
October 2013
595 pages
ISSN:0146-4833
DOI:10.1145/2534169
Issue’s Table of Contents

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 August 2013

Check for updates

Author Tags

Qualifiers

Poster

Conference

SIGCOMM'13

Sponsor:

SIGCOMM

SIGCOMM'13: ACM SIGCOMM 2013 Conference

August 12 - 16, 2013

Hong Kong, China

Acceptance Rates

SIGCOMM '13 Paper Acceptance Rate 38 of 246 submissions, 15%;

Overall Acceptance Rate 554 of 3,547 submissions, 16%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
280
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)3

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang XShi WXiang YLi J(2016)Efficient Network Security Policy Enforcement With Policy Space AnalysisIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2015.250240224:5(2926-2938)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1109/TNET.2015.2502402
Sureshkumar TLingaraj MAnand BPremkumar T(2018)Hybrid firefly bat algorithm (HFBA)–based network security policy enforcement for PSAInternational Journal of Communication Systems10.1002/dac.374031:14Online publication date: 11-Jul-2018
https://doi.org/10.1002/dac.3740
Sureshkumar TLingaraj MAnand BPremkumar T(2018)Non‐dominated sorting particle swarm optimization (NSPSO) and network security policy enforcement for Policy Space AnalysisInternational Journal of Communication Systems10.1002/dac.355431:10Online publication date: Mar-2018
https://doi.org/10.1002/dac.3554
Wang XShi WXiang YLi J(2016)Efficient Network Security Policy Enforcement With Policy Space AnalysisIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2015.250240224:5(2926-2938)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1109/TNET.2015.2502402

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

EffiCuts: optimizing packet classification for memory and throughput

Replication free rule grouping for packet classification

EffiCuts: optimizing packet classification for memory and throughput