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

Gautier Bayzelon

dblp:148/1949 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2014
—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
Routing and switching · 92% Internet architecture and protocols · 8%

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

TopicWeightPapersLastEvidence papers
Routing and switching › packet forwarding
forwarding policy
0.212014
Scalable forwarding tables for supporting flexible policies in enterprise networks · INFOCOM 2014
Routing and switching
forwarding table
0.212014
Scalable forwarding tables for supporting flexible policies in enterprise networks · INFOCOM 2014
Routing and switching › data plane
router data plane
0.212014
Scalable forwarding tables for supporting flexible policies in enterprise networks · INFOCOM 2014
Internet architecture and protocols
enterprise network
0.112014
Scalable forwarding tables for supporting flexible policies in enterprise networks · INFOCOM 2014
Routing and switching
routing policy
0.112014
Scalable forwarding tables for supporting flexible policies in enterprise networks · INFOCOM 2014

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

incremental update · 0.2TCAM/SRAM partitioning · 0.2
YearPublicationVenuePosition
2014 Scalable forwarding tables for supporting flexible policies in enterprise networks
abstract
With increasing demands for more flexible services, the routing policies in enterprise network becomes much richer. This has placed a heavy burden to the current router forwarding plane to support the increasing number of policies, primarily due to the limited capacity in TCAM. This hinders the development of new network services. In this paper, we present the design and implementation of a new forwarding table structure. It separates the functions of TCAM and SRAM and maximally utilizes the large & flexible SRAM. We progressively design a set of schemes, to maintain correctness, compress storage, and achieve line-card speeds. We also design incremental update algorithms that bring less accesses to memory. We present implementation designs and evaluate our scheme with a real implementation on a commercial router using real data sets. Our design does not require new devices. The evaluation results show that the performance of our forwarding tables is promising.
Shu Yang 0002, Mingwei Xu 0001, Dan Wang 0002, Gautier Bayzelon
INFOCOM4