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

Andreas Kirpal

dblp:54/1190 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2000
—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
Content delivery and video streaming · 44% Transport protocols and congestion control · 44% Internet architecture and protocols · 13%

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

TopicWeightPapersLastEvidence papers
Content delivery and video streaming
parallel access
0.012000
Parallel-Access for Mirror Sites in the Internet · INFOCOM 2000
Transport protocols and congestion control
TCP
0.012000
Parallel-Access for Mirror Sites in the Internet · INFOCOM 2000

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

dynamic parallel access · 0.0
YearPublicationVenuePosition
2000 Parallel-Access for Mirror Sites in the Internet
abstract
Popular documents are frequently mirrored on multiple sites in an effort to share the load and reduce clients' retrieval latencies. However, choosing the best mirror site is a non-trivial task and a bad choice may give poor performance. We propose a scheme in which clients access multiple mirror sites in parallel to speedup document downloads while eliminating the problem of server selection. In our scheme, clients connect to mirror sites using unicast TCP connections and dynamically request different pieces of a document from different sites. The amount of data retrieved from a particular site varies depending on the network path/server conditions. Dynamic parallel-access can be easily implemented in the current Internet and does not require any modifications at the mirror sites. Using dynamic parallel-access, all clients experience dramatic speedups in downloading documents, and the load is shared among servers without the need for a server selection mechanism. Even in a situation where clients are connected through modem lines, dynamic parallel-access offers transmission rates at least as high as the fastest server.
Pablo Rodriguez 0001, Andreas Kirpal, Ernst W. Biersack
INFOCOM2