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

Ádám Stipkovits

dblp:117/4267 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2012
—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
Software-defined and programmable networks · 91% Routing and switching · 9%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
openflow
0.112012
Towards SmartFlow: case studies on enhanced programmable forwarding in OpenFlow switches · SIGCOMM 2012
Software-defined and programmable networks
programmable data plane
0.112012
Towards SmartFlow: case studies on enhanced programmable forwarding in OpenFlow switches · SIGCOMM 2012
Software-defined and programmable networks › programmable data plane
programmable forwarding
0.112012
Towards SmartFlow: case studies on enhanced programmable forwarding in OpenFlow switches · SIGCOMM 2012

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

network coding · 0.1greedy routing · 0.1bloom filter · 0.1
YearPublicationVenuePosition
2012 Towards SmartFlow: case studies on enhanced programmable forwarding in OpenFlow switches
abstract
The limited capabilities of the switches renders the implementation of unorthodox routing and forwarding mechanisms as a hard task in OpenFlow. Our high level goal is therefore to inspect the possibilities of slightly smartening up the OpenFlow switches. As a first step in this direction we demonstrate (with Bloom filters, greedy routing and network coding) that a very limited computational capability enables us to natively support experimental technologies while preserving performance. We distribute the demos in source files and as a ready-to-experiment VM image to promote further improvements and evaluations.
Felician Németh, Ádám Stipkovits, Balázs Sonkoly, András Gulyás
SIGCOMM2