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

Jared Winick

dblp:39/2325 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 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 · 50% Network management and operations · 25% Network optimization and economics · 25%

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

TopicWeightPapersLastEvidence papers
Routing and switching › routing protocol
BGP routing
0.012004
A model of BGP routing for network engineering · SIGMETRICS 2004
Network optimization and economics › network design
capacity planning
0.012004
A model of BGP routing for network engineering · SIGMETRICS 2004
Network management and operations
network configuration
0.012004
A model of BGP routing for network engineering · SIGMETRICS 2004
Routing and switching
traffic engineering
0.012004
A model of BGP routing for network engineering · SIGMETRICS 2004

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

static analysis · 0.0emulation · 0.0
YearPublicationVenuePosition
2004 A model of BGP routing for network engineering
abstract
The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of the Internet can all degrade performance. To maintain good performance, network operators must continually reconfigure the routing protocols. Operators configure BGP to control how traffic flows to neighboring Autonomous Systems (ASes), as well as how traffic traverses their networks. However, because BGP route selection is distributed, indirectly controlled by configurable policies, and influenced by complex interactions with intradomain routing protocols, operators cannot predict how a particular BGP configuration would behave in practice. To avoid inadvertently degrading network performance, operators need to evaluate the effects of configuration changes before deploying them on a live network. We propose an algorithm that computes the outcome of the BGP route selection process for each router in a single AS, given only a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe a BGP emulator based on this algorithm; the emulator exploits the unique characteristics of routing data to reduce computational overhead. Using data from a large ISP, we show that the emulator correctly computes BGP routing decisions and has a running time that is acceptable for many tasks, such as traffic engineering and capacity planning.
Nick Feamster, Jared Winick, Jennifer Rexford
SIGMETRICS2