Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dan Zhang 0022

dblp:21/802-22 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-0978-8960ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Software-defined and programmable networks · 100%
Network and information security
1 paper
Network security · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks › runtime verification
rule enforcement verification
0.412020
Verifying Rule Enforcement in Software Defined Networks With REV · IEEE/ACM Trans. Netw. 2020
Software-defined and programmable networks
SDN control plane
0.412020
Verifying Rule Enforcement in Software Defined Networks With REV · IEEE/ACM Trans. Netw. 2020
Software-defined and programmable networks
SDN data plane
0.412020
Verifying Rule Enforcement in Software Defined Networks With REV · IEEE/ACM Trans. Netw. 2020

Methods — techniques the papers use, named apart from their topics

message authentication code · 0.9heuristic flow selection · 0.9compressive MAC · 0.9
YearPublicationVenuePosition
2020 Verifying Rule Enforcement in Software Defined Networks With REV
abstract
Software defined networking (SDN) reshapes the ossified network architectures, by decoupling the control plane and data plane. Due to such a decoupling, SDN assumes that rules issued by the control plane are always correctly enforced by the data plane. However, this assumption breaks as an adversary can prevent the data plane from enforcing the rules, by exploiting the vulnerabilities of switch OS and control channel. The serious consequence is that packets may deviate from their original paths, thereby violating critical security policies like access control. To this end, this paper introduces rule enforcement verification (REV), which enables the controller to check whether switches have correctly enforced the rules that it issues. Since using message authentication code (MAC) can incur heavy switch-to-controller traffic, we propose the compressive MAC, which lets switches compress MACs before reporting to the controller, thereby significantly reducing the bandwidth cost. Finally, we propose a heuristic flow selection algorithm, which allows the controller to verify much less flows for rule coverage. We implement REV based on Open vSwitch with DPDK, and use experiments to show: (1) by using compressive MAC, REV achieves a 97% reduction in switch-to-controller traffic, and an 8× increase in verification throughput; (2) by using the heuristic flow selection algorithm, REV can reduce the number of flows to verify by 40%-60%.
Peng Zhang 0011, Hui Wu 0003, Dan Zhang 0022, Qi Li 0002
IEEE/ACM Trans. Netw.3