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

Daniel Borkmann

dblp:67/10369 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2018
0000-0001-9806-2899ORCID · corroborated

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

Computer networks · 3

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%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › i/o
kernel bypass
0.112018
The eXpress data path: fast programmable packet processing in the operating system kernel · CoNEXT 2018

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

eBPF · 0.7
YearPublicationVenuePosition
2018 The eXpress data path: fast programmable packet processing in the operating system kernel
abstract
Programmable packet processing is increasingly implemented using kernel bypass techniques, where a userspace application takes complete control of the networking hardware to avoid expensive context switches between kernel and userspace. However, as the operating system is bypassed, so are its application isolation and security mechanisms; and well-tested configuration, deployment and management tools cease to function.
Toke Høiland-Jørgensen, Jesper Dangaard Brouer, Daniel Borkmann, John Fastabend, Tom Herbert, David Ahern
CoNEXT3
2012 Hardware support for dynamic protocol stacks
abstract
Most networking performance enhancements occur through specific static solutions, where the structure of the protocol stack remains unchanged. Instead, we focus on a flexible software and hardware co-design for the entire protocol stack. In this paper, we present EmbedNet, a System-on-Chip implementation of a flexible network architecture for the Future Internet, where parts of the protocol stack can be moved between software and hardware at runtime. This enables the construction of dynamic protocol stacks that use available resources optimally.
Ariane Trammell, Daniel Borkmann, Stephan Neuhaus
ANCS2
2011 Efficient Implementation of Dynamic Protocol Stacks
abstract
Network programming is widely understood as programming strictly defined socket interfaces. Only some frameworks have made a step towards real network programming by decomposing networking functionality into small modular blocks that can be assembled in a flexible manner. In this paper, we tackle the challenge of accommodating 3 partially conflicting objectives: (i) high flexibility for network programmers, (ii) re-configuration of the network stack at runtime, and (iii) high packet forwarding rates. First experiences with a prototype implementation in Linux suggest little performance overhead compared to the standard Linux protocol stack.
Ariane Trammell, Daniel Borkmann, Wolfgang Mühlbauer
ANCS2