Demo Data from VLDB 2026 / reviewers in the wild / expert
Andrew Yourtchenko
dblp:209/9203
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
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 |
Internet architecture and protocols · 87% Routing and switching · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › packet processing
packet classification |
0.4 | 1 | 2019 | TupleMerge: Fast Software Packet Processing for Online Packet Classification · IEEE/ACM Trans. Netw. 2019 |
Internet architecture and protocols › packet processing › packet classification
tuple space search |
0.4 | 1 | 2019 | TupleMerge: Fast Software Packet Processing for Online Packet Classification · IEEE/ACM Trans. Netw. 2019 |
Routing and switching › router architecture
software router |
0.1 | 1 | 2019 | TupleMerge: Fast Software Packet Processing for Online Packet Classification · IEEE/ACM Trans. Netw. 2019 |
Methods — techniques the papers use, named apart from their topics
tuple space search · 0.4hash table · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | TupleMerge: Fast Software Packet Processing for Online Packet ClassificationabstractPacket classification is an important part of many networking devices, such as routers and firewalls. Software-defined networking (SDN) heavily relies on online packet classification which must efficiently process two different streams: incoming packets to classify and rules to update. This rules out many offline packet classification algorithms that do not support fast updates. We propose a novel online classification algorithm, TupleMerge (TM), derived from tuple space search (TSS), the packet classifier used by Open vSwitch (OVS). TM improves upon TSS by combining hash tables which contain rules with similar characteristics. This greatly reduces classification time preserving similar performance in updates. We validate the effectiveness of TM using both simulation and deployment in a full-fledged software router, specifically within the vector packet processor (VPP). In our simulation results, which focus solely on the efficiency of the classification algorithm, we demonstrate that TM outperforms all other state of the art methods, including TSS, PartitionSort (PS), and SAX-PAC. For example, TM is 34% faster at classifying packets and 30% faster at updating rules than PS. We then experimentally evaluate TM deployed within the VPP framework comparing TM against linear search and TSS, and also against TSS within the OVS framework. This validation of deployed implementations is important as SDN frameworks have several optimizations such as caches that may minimize the influence of a classification algorithm. Our experimental results clearly validate the effectiveness of TM. VPP TM classifies packets nearly two orders of magnitude faster than VPP TSS and at least one order of magnitude faster than OVS TSS. James Daly, Valerio Bruschi, Leonardo Linguaglossa, Salvatore Pontarelli, Dario Rossi 0001, Jerome Tollet, Eric Torng, Andrew Yourtchenko |
IEEE/ACM Trans. Netw. | 8 |