skip to main content
10.1145/2716281.2836095acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
research-article
Free access

Practical network-wide packet behavior identification by AP classifier

Published: 01 December 2015 Publication History

Abstract

Identifying the network-wide forwarding behaviors of a packet is essential for many network management applications, including rule verification, policy enforcement, attack detection, traffic engineering, and fault localization. Current tools that can perform packet behavior identification either incur large time and memory costs or do not support real-time updates. In this paper we present AP Classifier, a control plane tool for packet behavior identification. AP Classifier is developed based on the concept of atomic predicates which can be used to characterize the forwarding behaviors of packets. Experiments using the data plane network state of two real networks show that the processing speed of AP Classifier is faster than existing tools by at least an order of magnitude. Furthermore, AP Classifier uses very small memory and is able to support real-time updates.

References

[1]
Hassel-C. http://bitbucket.org/peymank/hassel-public/.
[2]
The internet2 observatory data collections. http://www.internet2.edu/observatory/archive/data-collections.html.
[3]
University of oregon route views project. http://www.routeviews.org.
[4]
S. Agarwal, M. Kodialam, and T. Lakshman. Traffic engineering in software defined networks. In Proc. of IEEE INFOCOM, 2013.
[5]
M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat. Hedera: dynamic flow scheduling for data center networks. In Proc. of USENIX NSDI, 2010.
[6]
H. Ballani, P. Costa, T. Karagiannis, and A. Rowstron. Towards predictable datacenter networks. In Proc. of ACM SIGCOMM, 2011.
[7]
T. Benson, A. Akella, and D. A. Maltz. Network traffic characteristics of data centers in the wild. In Proc. of ACM IMC, 2010.
[8]
T. Benson, A. Anand, A. Akella, and M. Zhang. Microte: Fine grained traffic engineering for data centers. In Proc. of ACM CoNEXT, 2011.
[9]
Q. Chen, C. Qian, and S. Zhong. Privacy-preserving cross-domain routing optimization --- a cryptographic approach. In Proc. of IEEE ICNP, 2015.
[10]
W. Cui and C. Qian. Difs: Distributed flow scheduling for adaptive routing in hierarchical data center networks. In Proc. of ACM/IEEE ANCS, 2014.
[11]
M. Dhawan, R. Poddar, K. Mahajan, and V. Mann. Dynamic scheduling of network updates. In Proc. of ACM SIGCOMM, 2014.
[12]
A. Fogel, S. Fung, L. Pedrosa, M. Walraed-Sullivan, R. Govindan, R. Mahajan, and T. Millstein. A general approach to network configuration analysis. In Proc. of USENIX NSDI, 2015.
[13]
T. Inoue, T. Mano, K. Mizutani, S. Minato, and O. Akashi. Rethinking packet classification for global network view of software-defined networking. In Proc. of IEEE ICNP, 2014.
[14]
S. Jain et al. B4: Experience with a Globally-Deployed Software Defined WAN. In Proceedings of ACM Sigcomm, 2013.
[15]
S. Kandula, S. Sengupta, A. Greenberg, P. Patel, and R. Chaiken. The nature of data center traffic: measurements & analysis. In Proc. of ACM IMC, 2009.
[16]
P. Kazemian, M. Chang, H. Zeng, G. Varghese, N. McKeown, and S. Whyte. Real time network policy checking using header space analysis. In Proc. of USENIX NSDI, 2013.
[17]
P. Kazemian, G. Varghese, and N. McKeown. Header space analysis: Static checking for networks. In Proc. of USENIX NSDI, 2012.
[18]
A. R. Khakpour and A. X. Liu. Quantifying and querying network reachability. In Proc. of IEEE ICDCS, 2010.
[19]
A. Khurshid, X. Zou, W. Zhou, M. Caesar, and P. B. Godfrey. Veriflow: Verifying network-wide invariants in real time. In Proc. of USENIX NSDI, 2013.
[20]
M. Kuzniar, P. Peresini, and D. Kostic. What you need to know about SDN flow tables. In Proc. of PAM, 2015.
[21]
X. Li and C. Qian. Traffic and failure aware vm placement for multi-tenant cloud computing. In Proceedings of IEEE IWQoS, 2015.
[22]
H. Liu, S. Kandula, R. Mahajan, M. Zhang, and D. Gelernter. Traffic engineering with forward fault correction. In Proc. of ACM SIGCOMM, 2014.
[23]
N. P. Lopes, N. BjØrner, P. Godefroid, K. Jayaraman, and G. Varghese. Checking beliefs in dynamic networks. In Proc. of USENIX NSDI, 2015.
[24]
H. Mai, A. Khurshid, R. Agarwal, M. Caesar, P. B. Godfrey, and S. T. King. Debugging the data plane with Anteater. In Proc. of ACM SIGCOMM, 2011.
[25]
N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner. Openflow: enabling innovation in campus networks. ACM SIGCOMM CCR, 38(2):69--74, 2008.
[26]
A. Nayak, A. Reimers, N. Feamster, and R. Clark. Resonance: Dynamic access control for enterprise networks. In Proc. of ACM WREN, 2009.
[27]
Z. A. Qazi, C. Tu, L. Chiang, R. Miao, V. Sekar, and M. Yu. Simple-fying middlebox policy enforcement using SDN. In Proc. of ACM SIGCOMM, 2013.
[28]
G. Xie, J. Zhan, D. A. Maltz, H. Zhang, A. Greenberg, G. Hjalmtysson, and J. Rexford. On static reachability analysis of IP networks. In Proc. of IEEE INFOCOM, 2005.
[29]
H. Yang and S. S. Lam. Real-time verification of network properties using atomic predicates. Technical Report TR-13-15, The Univ. of Texas at Austin, Dept. of Computer Science, Aug. 2013.
[30]
H. Yang and S. S. Lam. Real-time verification of network properties using atomic predicates. In Proc. of IEEE ICNP, 2013, extended version in IEEE/ACM Transactions on Networking.
[31]
Y. Yu and C. Qian. Space shuffle: A scalable, flexible, and high-bandwidth data center network. In Proc. of IEEE ICNP, 2014.
[32]
Y. Yu, C. Qian, and X. Li. Distributed collaborative monitoring in software defined networks. In Proc. of ACM HotSDN, 2014.
[33]
H. Zeng, P. Kazemiany, G. Varghese, and N. McKeown. Automatic test packet generation. In Proc. of ACM CoNEXT, 2012.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CoNEXT '15: Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies
December 2015
483 pages
ISBN:9781450334129
DOI:10.1145/2716281
Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2015

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. network verification
  2. packet behavior identification
  3. software defined networking

Qualifiers

  • Research-article

Funding Sources

Conference

CoNEXT '15
Sponsor:

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Upcoming Conference

CoNEXT '24

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)77
  • Downloads (Last 6 weeks)8
Reflects downloads up to 07 Nov 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media