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

D. Kaufman

dblp:31/5818 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1983
—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 · 62% Internet architecture and protocols · 38%

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

TopicWeightPapersLastEvidence papers
Routing and switching › routing protocol
route discovery
0.011983
Interconnection of broadband local area networks · SIGCOMM 1983
Internet architecture and protocols › network interconnection
LAN interconnection
0.011983
Interconnection of broadband local area networks · SIGCOMM 1983
Internet architecture and protocols
network interconnection
0.011983
Interconnection of broadband local area networks · SIGCOMM 1983

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

controlled flooding · 0.0
YearPublicationVenuePosition
1983 Interconnection of broadband local area networks
abstract
Interconnection of multiple broadband local area networks to form an integrated packet transport system presents several challenges. To take full advantage of broadband systems, assignment of nodes to channels must be dynamic, leading to the use of a flat address space. Combined with the desire to avoid reliance on a central server or complex routing in packet forwarders, this addressing scheme leads to adoption of a controlled flooding technique to “discover” the best path to a destination node. This discovery procedure sets up a path through internetwork forwarders for use by subsequent packets to the same destination. This paper describes the design and implementation of such a technique in Sytek's LocalNet(TM) systems along with several refinements which increase performance and keep the worst case load for route discovery below a few percent of network capacity.
Carl A. Sunshine, D. Kaufman, Gregory Ennis, K. Biba
SIGCOMM2