CNOR: A Non-Overlapping Wildcard Rule Caching System for Software-Defined Networks

Yang, Chun-Lin; Jiang, Yong; Liu, Yang; Wang, Lei

doi:10.1109/iscc.2018.8538522

Cited by 13 publications

(24 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The performance of HBD is evaluated through simulation, and three other algorithms are implemented for comparison, which includes: (1) the naive exact dispatching approach; (2) a dependency-based algorithm that works in reactive mode, copies the strategy of Cover-set [12] , and treats the hits on the cover sets as cache misses (We refer to it as DependencyBased Dispatching, DBD); and (3) the cache rule generation algorithm used in CAB [16] .…”

Section: Discussionmentioning

confidence: 99%

“…(3) Cut-based algorithm: As one latest work targeting at reactive rule dispatching, CAching in Buckets (CAB) [16] dispatches a set of buckets associated with their overlapped rules, and implements a two-stage table pipeline in the forwarding device. The bucket generation procedure, which directly affects cache performance, shares similarity with space decomposition based packet classification algorithms such as HiCuts [17] and HyperCuts [18] .…”

Section: Prior Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

HBD: towards efficient reactive rule dispatching in software-defined networks

Chen

Zheng

et al. 2016

Tinshhua Sci. Technol.

View full text Add to dashboard Cite

Most types of Software-Defined Networking (SDN) architectures employ reactive rule dispatching to enhance real-time network control. The rule dispatcher, as one of the key components of the network controller, generates and dispatches the cache rules with response for the packet-in messages from the forwarding devices.It is important not only for ensuring semantic integrity between the control plane and the data plane, but also for preserving the performance and efficiency of the forwarding devices. In theory, generating the optimal cache rules on demands is a knotty problem due to its high theoretical complexity. In practice, however, the characteristics lying in real-life traffic and rule sets demonstrate that temporal and spacial localities can be leveraged by the rule dispatcher to significantly reduce computational overhead. In this paper, we take a deep-dive into the reactive rule dispatching problem through modeling and complexity analysis, and then we propose a set of algorithms named Hierarchy-Based Dispatching (HBD), which exploits the nesting hierarchy of rules to simplify the theoretical model of the problem, and trade the strict coverage optimality off for a more practical but still superior rule generation result. Experimental result shows that HBD achieves performance gain in terms of rule cache capability and rule storage efficiency against the existing approaches.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Prior Algorithmsmentioning

confidence: 99%

HBD: towards efficient reactive rule dispatching in software-defined networks

Chen

Zheng

et al. 2016

Tinshhua Sci. Technol.

View full text Add to dashboard Cite

show abstract

“…Many SDN applications rely on sophisticated packet processing and advanced pipelining. Examples include source address validation [9], d-dimensional packet classification [10], wildcard rule caching [11], controller modularization or hierarchical network management [12]. The available hardware, on the other hand, does not necessarily support all required capabilities.…”

Section: Background and Related Workmentioning

confidence: 99%

The Power of Composition: Abstracting a Multi-Device SDN Data Path Through a Single API

Geissler

Herrnleben

Bauer

et al. 2020

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Software Defined Networking aims to separate network control and data plane by moving the control logic from network elements into a logically-centralized controller. Using a well-defined, unified control-channel protocol, such as OpenFlow, the controller is able to configure the forwarding behavior of data plane devices. Here, the OpenFlow protocol is translated to vendor-and device-specific instructions that, for instance, manipulate the flow table entries of a switch. In practice, SDNenabled switches often feature different hardware capabilities and configurations with respect to the number of flow tables, their implementation, and which kind of data plane features they support. This leads to device heterogeneity within the SDN landscape, thereby obstructing the increased scalability and flexibility promised by the SDN paradigm. To overcome this challenge we propose TableVisor, a transparent proxy-layer for the SDN control channel that enables the flexible abstraction of heterogeneous data plane devices into a single emulated data plane switch. In this paper, we extend our previous work by introducing features to integrate modern P4 devices into an existing SDN environment and perform a detailed performance evaluation to quantify the overhead induced by our approach.

show abstract

“…The caching system for the SDN based on the wildcard rules, called CAching in Buckets (CAB), is presented in [101]. The basic idea of the CAB is the partitioning of the field into logical structures, called bucket, and bucket caching along with the associated rules.…”

Section: A Performancementioning

confidence: 99%

A Survey on Data Plane Flexibility and Programmability in Software-Defined Networking

et al. 2019

View full text Add to dashboard Cite

Software-defined networking (SDN) attracts the attention of the research community in recent years, as evidenced by a large number of survey and review papers. The architecture of SDN clearly recognizes three planes: application, control, and data plane. The application plane executes network applications; control plane regulates the rules for the entire network based on the requests generated by network applications; and based on the set rules, the controller configures the switches in the data plane. The role of the switch in the data plane is to simply forward packets based on the instructions given by the controller. By analyzing SDN-related research papers, it is observed that research, from the very beginning, is insufficiently focused on the data plane. Therefore, this paper gives a comprehensive overview of the data plane survey with particular emphasis on the problem of programmability and flexibility. The first part of the survey is dedicated to the evaluation of actual data plane architectures through several definitions and aspects of data plane flexibility and programmability. Then, an overview of SDN-related research was presented with the aim of identifying key factors influencing the gradual deviation from the original data plane architectures given with ForCES and OpenFlow specifications, which we called the data plane evolution. By establishing a correlation between the treated problem and the problem-solving approaches, the limitations of ForCES and OpenFlow data plane architectures were identified. Based on identified limitations, a generalization of approaches to addressing the problem of data plane flexibility and programmability is made. By examining generalized approaches, open issues have been identified, establishing the grounds for future research directions proposal.

show abstract

CNOR: A Non-Overlapping Wildcard Rule Caching System for Software-Defined Networks

Cited by 13 publications

References 18 publications

HBD: towards efficient reactive rule dispatching in software-defined networks

HBD: towards efficient reactive rule dispatching in software-defined networks

The Power of Composition: Abstracting a Multi-Device SDN Data Path Through a Single API

A Survey on Data Plane Flexibility and Programmability in Software-Defined Networking

Contact Info

Product

Resources

About