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

Daniel F. Gryniewicz

dblp:19/5656 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1999
—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
Network measurement and analytics · 77% Routing and switching · 23%

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

TopicWeightPapersLastEvidence papers
Network measurement and analytics › distance estimation
internet host distance estimation
0.011999
An Architecture for a Global Internet Host Distance Estimation Service · INFOCOM 1999
Routing and switching › spanning tree
spanning tree construction
0.011999
An Architecture for a Global Internet Host Distance Estimation Service · INFOCOM 1999

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

spanning tree · 0.0IP multicast · 0.0
YearPublicationVenuePosition
1999 An Architecture for a Global Internet Host Distance Estimation Service
abstract
There is an increasing need for Internet hosts to be able to quickly and efficiently learn the distance, in terms of metrics such as latency or bandwidth, between Internet hosts. For example, to select the nearest of multiple equal content Web servers. This paper explores technical issues related to the creation of a public infrastructure service to provide such information. In so doing, we suggest an architecture, called IDMaps, whereby Internet distance information is distributed over the Internet, using IP multicast groups, in the form of a virtual distance map. Systems listening to the groups can estimate the distance between any pair of IP addresses by running a spanning tree algorithm over the received distance map. We also presents the results of experiments that give preliminary evidence supporting the architecture. This work thus lays the initial foundation for future work in this new area.
Paul Francis, Sugih Jamin, Vern Paxson, Lixia Zhang 0001, Daniel F. Gryniewicz, Yixin Jin
INFOCOM5