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

David Fialho

dblp:209/8667 · DBLP profile ↗
← Back
1ranked-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 · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching › inter-domain routing
BGP
0.312017
Stabilizing BGP through distributed elimination of recurrent routing loops · ICNP 2017
Routing and switching
inter-domain routing
0.312017
Stabilizing BGP through distributed elimination of recurrent routing loops · ICNP 2017
Routing and switching › routing protocol
routing convergence
0.312017
Stabilizing BGP through distributed elimination of recurrent routing loops · ICNP 2017
Routing and switching
routing stability
0.312017
Stabilizing BGP through distributed elimination of recurrent routing loops · ICNP 2017
Routing and switching › routing protocol
routing protocol design
0.112017
Stabilizing BGP through distributed elimination of recurrent routing loops · ICNP 2017

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

simulation · 0.3
YearPublicationVenuePosition
2017 Stabilizing BGP through distributed elimination of recurrent routing loops
abstract
Despite years of research, the Internet still lacks a routing protocol with guaranteed termination. As is well-known, decentralization of routing decisions among the Autonomous Systems (ASes) that comprise the Internet may result in permanent oscillations of the state of its routing protocol - the Border Gateway Protocol (BGP). Some permanent oscillations are made from routing loops - the propagation of routing messages around the cycles of a network - that come back time and again. We discovered that the routing loop detection capability of BGP can be sharpened to predict which routing loops potentially recur and that the import policies can be adjusted to prevent the recurrence. The resulting protocol, named Self-Stable BGP (SS-BGP), is more stable than BGP. For the broad and common class of isotone routing policies, all permament oscillations are made from recurrent routing loops. For this class of routing policies, SS-BGP terminates. Our simulations with realistic Internet topologies and realistic variations of the Gao-Rexford (GR) inter-AS routing policies show that SS-BGP arrives at stable states at the expense of alterations in the import policies of only a handful of ASes.
João L. Sobrinho, David Fialho, Paulo Mateus
ICNP2