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

Juncheng Ge

dblp:252/1023 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
0009-0002-4331-5726ORCID · corroborated

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

Computer networks · 2

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%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks › network policy
middlebox policy enforcement
0.412019
SAFE-ME: Scalable and Flexible Middlebox Policy Enforcement with Software Defined Networking · ICNP 2019
Software-defined and programmable networks › network function virtualization
service function chaining
0.412019
SAFE-ME: Scalable and Flexible Middlebox Policy Enforcement with Software Defined Networking · ICNP 2019
Software-defined and programmable networks › network function virtualization › service function chaining
service function chain routing
0.112019
SAFE-ME: Scalable and Flexible Middlebox Policy Enforcement with Software Defined Networking · ICNP 2019

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

smart tag operations · 0.4default SFC path construction · 0.4
YearPublicationVenuePosition
2020 PrePass: Load balancing with data plane resource constraints using commodity SDN switches
Haibo Wang 0004, Hongli Xu 0001, Chen Qian 0001, Juncheng Ge, Jianchun Liu, He Huang 0001
Comput. Networks4
2019 SAFE-ME: Scalable and Flexible Middlebox Policy Enforcement with Software Defined Networking
abstract
The past decades have seen a proliferation of middlebox deployment in various networks, including backbone networks and datacenters. Since network flows have to traverse specific service function chains (SFCs) for security and performance enhancement, it becomes much complex for SFC routing due to routing loops, traffic dynamics and scalability requirement. The existing SFC routing solutions may consume many resources (e.g., TCAM) on the data plane and lead to massive overhead on the control plane, which decrease the scalability of middlebox networks. Due to SFC requirement and potential routing loops, solutions like traditional default paths (e.g., using ECMP) that are widely used in non-middlebox networks will no longer be feasible. In this paper, we present and implement a scalable and flexible middlebox policy enforcement (SAFE-ME) system to minimize the TCAM usage and control overhead. To this end, we design the smart tag operations for construction of default SFC paths with less TCAM rules in the data plane, and present lightweight SFC routing update with less control overhead for dealing with traffic dynamics in the control plane. We implement our solution and evaluate its performance with experiments on both physical platform (Pica8) and Open vSwitch (OVS), as well as large-scale simulations. Both experimental and simulation results show that SAFE-ME can greatly improve scalability (e.g., TCAM cost, update delay, and control overhead) in middlebox networks. For example, our system can reduce the control traffic overhead by about 83% while achieving almost the similar middlebox load, compared with state-of-the-art solutions.
Gongming Zhao, Hongli Xu 0001, Jianchun Liu, Chen Qian 0001, Juncheng Ge, Liusheng Huang
ICNP5