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

Ding-Yuan Lee

dblp:168/5857 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0002-2918-7791ORCID · reported

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

Systems, architecture and hardware · 1 · 1 first-authorComputer 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 · 54% Internet architecture and protocols · 23% Network measurement and analytics · 23%

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

TopicWeightPapersLastEvidence papers
Network measurement and analytics › sketch data structures
bloom filter
0.312018
Dynamically Updatable Ternary Segmented Aging Bloom Filter for OpenFlow-Compliant Low-Power Packet Processing · IEEE/ACM Trans. Netw. 2018
Software-defined and programmable networks
openflow
0.312018
Dynamically Updatable Ternary Segmented Aging Bloom Filter for OpenFlow-Compliant Low-Power Packet Processing · IEEE/ACM Trans. Netw. 2018
Internet architecture and protocols
packet processing
0.312018
Dynamically Updatable Ternary Segmented Aging Bloom Filter for OpenFlow-Compliant Low-Power Packet Processing · IEEE/ACM Trans. Netw. 2018
Software-defined and programmable networks
programmable data plane
0.312018
Dynamically Updatable Ternary Segmented Aging Bloom Filter for OpenFlow-Compliant Low-Power Packet Processing · IEEE/ACM Trans. Netw. 2018

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

ternary segmented aging bloom filter · 0.3
YearPublicationVenuePosition
2019 Bundle-Updatable SRAM-Based TCAM Design for OpenFlow-Compliant Packet Processor
abstract
Static random-access memory (SRAM)-based ternary content-addressable memories (TCAMs) emulate TCAM functions with high throughput at low cost. However, the implementation of SRAMbased TCAM as a rule table in network switches tends to prolong updating latency, which can cause a false packet routing. This brief proposes a novel low-latency bundle-updatable TCAM (BU-TCAM) scheme that uses binary tree-based prefix encoding (BPE) to support singleand multiple-rule updating in a software-defined networking/OpenFlow network. The proposed encoding method transforms the original ternary rule data into a binary code word and determines the range of overlap in SRAM addresses to facilitate updating. This greatly decreases latency in cases where multiple rules are required to update on an SRAMbased TCAM. We implemented an emulated 64 × 32-bit TCAM of the proposed design on a Xilinx ZC-706 field-programmable gate array. The proposed scheme reduced updating latency by 79.6%, compared with a conventional updating structure, which had only 9.8% and 23% increases in LUTs and registers overhead, respectively.
Ding-Yuan Lee, Ching-Che Wang, An-Yeu Wu
IEEE Trans. Very Large Scale Integr. Syst.1
2018 Dynamically Updatable Ternary Segmented Aging Bloom Filter for OpenFlow-Compliant Low-Power Packet Processing
Sheng-Chun Kao, Ding-Yuan Lee, Ting-Sheng Chen, An-Yeu Wu
IEEE/ACM Trans. Netw.2