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

Brian J. Premore

dblp:27/1955 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2001
—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 · 70% Network performance modeling · 30%

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

TopicWeightPapersLastEvidence papers
Routing and switching › inter-domain routing › BGP
BGP convergence
0.012001
An Experimental Analysis of BGP Convergence Time · ICNP 2001
Routing and switching
inter-domain routing
0.012001
An Experimental Analysis of BGP Convergence Time · ICNP 2001
Network performance modeling › network simulation
routing protocol simulation
0.012001
An Experimental Analysis of BGP Convergence Time · ICNP 2001
Routing and switching › inter-domain routing
BGP
0.012001
An Experimental Analysis of BGP Convergence Time · ICNP 2001

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

SSFNet simulation · 0.0
YearPublicationVenuePosition
2001 An Experimental Analysis of BGP Convergence Time
abstract
The border gateway protocol (BGP) is the routing protocol used to maintain connectivity between autonomous systems in the Internet. Empirical measurements have shown that there can be considerable delay in BGP convergence after routing changes. One contributing factor in this delay is a BGP-specific timer used to limit the rate at which routing messages are transmitted. We use the SSFNet simulator to explore the relationship between convergence time and the configuration of this timer. For each simple network topology simulated, we observe that there is an optimal value for the rate-limiting timer that minimizes convergence time.
Timothy G. Griffin, Brian J. Premore
ICNP2