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

J. M. Synder

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

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

Computer networks · 1 · 1 first-author

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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching › routing › routing design
routing architecture
0.011989
A Routing Architecture for Very Large Networks Undergoing Rapid Reconfiguration · SIGCOMM 1989
Routing and switching
routing protocol
0.011989
A Routing Architecture for Very Large Networks Undergoing Rapid Reconfiguration · SIGCOMM 1989

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

heuristic routing · 0.0
YearPublicationVenuePosition
1989 A Routing Architecture for Very Large Networks Undergoing Rapid Reconfiguration
abstract
A routing architecture is described for very large communications networks with greater than 10,000 routing nodes and 100,000 end nodes. This architecture, called the Traveler Architecture, is designed to be independent of network configuration and to be robust even under conditions of rapid reconfiguration. Traveler is an extension of the ISO routing protocols. The Traveler architecture is designed to work with traffic characteristic of existing large networks, such as the Internet. While Traveler does not require a particular routing algorithm, it is designed to work in conjunction with families of distributed routing algorithms. Because Traveler is based on the paradigm of a human traveler, it attempts to use non-deterministic and heuristic methods rather than purely algorithmic methods to determine high quality routes between two points. Traveler builds on the Landmark and Area routing architectures.
J. M. Synder
SIGCOMM1