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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Steve Licking

dblp:173/5213 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2016
—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 · 67% Software-defined and programmable networks · 33%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › packet processing
line-rate processing		 0.212016
Packet Transactions: High-Level Programming for Line-Rate Switches · SIGCOMM 2016
Internet architecture and protocols
packet processing		 0.212016
Packet Transactions: High-Level Programming for Line-Rate Switches · SIGCOMM 2016
Software-defined and programmable networks
programmable data plane		 0.212016
Packet Transactions: High-Level Programming for Line-Rate Switches · SIGCOMM 2016
Programming languages and type systems
domain-specific languages		 0.112016
Packet Transactions: High-Level Programming for Line-Rate Switches · SIGCOMM 2016
YearPublicationVenuePosition
2016 Packet Transactions: High-Level Programming for Line-Rate Switches
abstract
Many algorithms for congestion control, scheduling, network measurement, active queue management, and traffic engineering require custom processing of packets in the data plane of a network switch. To run at line rate, these data-plane algorithms must be implemented in hardware. With today's switch hardware, algorithms cannot be changed, nor new algorithms installed, after a switch has been built.
Anirudh Sivaraman, Alvin Cheung, Mihai Budiu, Changhoon Kim, Mohammad Alizadeh, Hari Balakrishnan, George Varghese, Nick McKeown, Steve Licking
 SIGCOMM9