skip to main content
research-article

ReWiFlow: Restricted Wildcard OpenFlow Rules

Published:30 September 2015Publication History
Skip Abstract Section

Abstract

The ability to manage individual flows is a major benefit of Software-Defined Networking. The overheads of this fine-grained control, e.g. initial flow setup delay, can overcome the benefits, for example when we have many time-sensitive short flows. Coarse-grained control of groups of flows, on the other hand, can be very complex: each packet may match multiple rules, which requires conflict resolution. In this paper, we present ReWiFlow, a restricted class of OpenFlow wildcard rules (the fundamental way to control groups of flows in OpenFlow), which allows managing groups of flows with flexibility and without loss of performance. We demonstrate how ReWiFlow can be used to implement applications such as dynamic proactive routing. We also present a generalization of ReWiFlow, called Multi-ReWiFlow, and show how it can be used to efficiently represent access control rules collected from Stanford's backbone network.

References

  1. M. Appelman. 2012. Performance Analysis of OpenFlow Hardware. M.Sc. Thesis. University of Amsterdam.Google ScholarGoogle Scholar
  2. T. Benson, et al. 2010. Network traffic characteristics of data centers in the wild. In IMC '10. 267--280. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. Bifulco, and F. Schneider. 2013. OpenFlow rules interactions: definition and detection. In SDN4FNS 2013.Google ScholarGoogle Scholar
  4. A.R. Curtis, et al. 2011. DevoFlow: scaling flow management for high-performance networks. In SIGCOMM'11. 254--265. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. H. Hamed and E. Al-Shaer. 2006. Taxonomy of conflicts in network security policies. Comm. Mag. 44(3). 134--141. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. C.Y. Hong, et al. 2012. Finishing flows quickly with preemptive scheduling. In SIGCOMM '12. 127--138. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Kandula, S., et al. 2009. The nature of data center traffic: measurements & analysis. In IMC'09. 202--208. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. T. Koponen, et al. 2010. Onix: a distributed control platform for large-scale production networks. In OSDI'10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. H. Lim, et al. 2014. On Adding Bloom Filters to Longest Prefix Matching Algorithms. IEEE Trans. Compu. 63(2). 411--423. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. F. Mansmann, et al. 2012. Visual analysis of complex firewall configurations. In VizSec '12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. C. Monsanto, et al. 2012. A compiler and run-time system for network programming languages. In POPL '12. 217--230. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. C. Monsanto, et al. 2013. Composing software-defined networks. In NSDI'13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. T. Nelson, et al. 2014. Tierless Programming and Reasoning for Software-Defined Networks. In NSDI'14. 519--531. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. Shirali-Shahreza and Y. Ganjali. 2013. Efficient Implementation of Security Applications in OpenFlow Controller with FleXam. In HotI 2013. 49--54. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Shirali-Shahreza and Y. Ganjali. 2013. FleXam: Flexible Sampling Extension for Monitoring and Security Applications in OpenFlow. In HotSDN 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. H. Song, et al. 2012. Efficient trie braiding in scalable virtual routers. IEEE/ACM Trans. Netw. 20(5). 1489--1500. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. V. Srinivasan, et al. 1999. Packet classification using tuple space search. SIGCOMM Comput. Commun. Rev. 29(4). 135--146. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. H. Yamanaka, et al. 2014. OpenFlow Networks with Limited L2 Functionality. In ICN2014. 221--229.Google ScholarGoogle Scholar
  19. G Yao, et al. 2014. FlowInsight: Separating Visibility and Operability in SDN Data Plane. In ONS 2014.Google ScholarGoogle Scholar
  20. H. Zeng, et al. 2012. Automatic Test Packet Generation. In CoNEXT 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. ReWiFlow: Restricted Wildcard OpenFlow Rules

    Recommendations

    Comments

    Login options

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

    Sign in

    Full Access

    • Published in

      cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 45, Issue 5
      October 2015
      41 pages
      ISSN:0146-4833
      DOI:10.1145/2831347
      Issue’s Table of Contents

      Copyright © 2015 ACM

      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]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 30 September 2015

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader