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

Karl Jeacle

dblp:48/4897 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2005
—ORCID · none

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

Computer networks · 2 · 2 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
Internet architecture and protocols · 33% Routing and switching · 33% Transport protocols and congestion control · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › multicast
reliable multicast
0.112005
Hybrid reliable multicast with TCP-XM · CoNEXT 2005
Transport protocols and congestion control
TCP
0.112005
Hybrid reliable multicast with TCP-XM · CoNEXT 2005
Routing and switching › routing › routing schemes
unicast and multicast routing
0.112005
Hybrid reliable multicast with TCP-XM · CoNEXT 2005
High-performance computing › data transfer
bulk data transfer
0.012005
Hybrid reliable multicast with TCP-XM · CoNEXT 2005

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

userspace transport protocol · 0.1
YearPublicationVenuePosition
2005 Hybrid reliable multicast with TCP-XM
abstract
In recent years, much work has been done on attempting to scale multicast data transmission to hundreds or thousands of receivers. There are, however, many situations where an application might involve transmission to just ten or twenty sites. The European Space Agency, for example, carry out regular multi-gigabyte bulk data transfers to a handful of destinations.Using multicast for this type of application can provide significant benefits including reduced load on the transmitter, an overall reduction in network traffic, and consequently shorter data transfer times.In this paper we take a fresh look at the problem of deploying reliable multicast. So far, there has been no convincing solution to achieve this. We present a simple hybrid solution which has not been proposed before. The approach taken is to combine unicast with multicast by modifying TCP to support multicast transfers, and run this modified TCP engine over UDP as a userspace transport protocol.Our goal is clear: reliable bulk data delivery to a moderate number of sites. Unlike some other multicast protocols, our work is complete: we have designed, implemented, deployed and evaluated a protocol which meets this goal.
Karl Jeacle, Jon Crowcroft, Marinho P. Barcellos, Stefano Pettini
CoNEXT1
2005 TCP-XM: unicast-enabled reliable multicast
abstract
In recent years, much work has been done on attempting to scale multicast data transmission to hundreds or thousands of receivers. There are, however, many situations where an application might involve transmission to just ten or twenty sites. Using multicast for this type of application can provide significant benefits including reduced load on the transmitter an overall reduction in network traffic, and consequently shorter data transfer times. In this project, we are investigating how partial or incomplete multicast can be exploited alongside reliable unicast to improve both speed and efficiency of data transfers while maintaining reliability. The approach taken is to combine unicast with multicast by modifying TCP to support multicast transfers, and run this modified TCP engine over UDP as a userspace transport protocol. We describe the work to date on the design and implementation, and provide experimental results from our tests across both local and wide area networks.
Karl Jeacle, Jon Crowcroft
ICCCN1