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

Alexander Shalimov

dblp:170/6827 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

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

Computer networks · 2

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
2 papers
Routing and switching · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching
forwarding table		 0.522017
Efficient FIB Representations on Distributed Platforms · IEEE/ACM Trans. Netw. 2017
FIB efficiency in distributed platforms · ICNP 2016
Routing and switching › forwarding table
forwarding table compression		 0.212016
FIB efficiency in distributed platforms · ICNP 2016
Routing and switching › switching systems
distributed switch architecture		 0.222017
Efficient FIB Representations on Distributed Platforms · IEEE/ACM Trans. Netw. 2017
FIB efficiency in distributed platforms · ICNP 2016

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

simulation · 0.5
YearPublicationVenuePosition
2017 Efficient FIB Representations on Distributed Platforms
abstract
The Internet routing ecosystem is facing substantial scalability challenges due to continuous, significant growth of the state represented in the data plane. Distributed switch architectures introduce additional constraints on efficiency of implementations from both lookup time and memory footprint perspectives. In this paper we explore efficient forwarding information base (FIB) representations in common distributed switch architectures. Our approach introduces substantial savings in memory footprint transparently for existing hardware. Our results are supported by an extensive simulation study on real IPv4 and IPv6 FIBs.
Kirill Kogan, Sergey I. Nikolenko, Patrick Eugster, Alexander Shalimov, Ori Rottenstreich
 IEEE/ACM Trans. Netw.4
2016 FIB efficiency in distributed platforms
abstract
The Internet routing ecosystem is facing substantial scalability challenges due to continuous, significant growth of the state represented in the data plane. Distributed switch architectures introduce additional constraints on efficient implementations from both lookup time and memory footprint perspectives. In this work we explore efficient FIB representations in common distributed switch architectures. Our approach introduces substantial savings in memory footprint transparently for existing hardware. Our results are supported by an extensive simulation study on real IPv4 and IPv6 FIBs.
Kirill Kogan, Sergey I. Nikolenko, Patrick Eugster, Alexander Shalimov, Ori Rottenstreich
 ICNP4