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

Daryl Seah

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

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

Systems, architecture and hardware · 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 · 93% Transport protocols and congestion control · 7%

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

TopicWeightPapersLastEvidence papers
Routing and switching › adaptive routing
detour routing
0.212013
mPath: High-Bandwidth Data Transfers with Massively Multipath Source Routing · IEEE Trans. Parallel Distributed Syst. 2013
Routing and switching
multipath routing
0.212013
mPath: High-Bandwidth Data Transfers with Massively Multipath Source Routing · IEEE Trans. Parallel Distributed Syst. 2013
Routing and switching
routing
0.212013
mPath: High-Bandwidth Data Transfers with Massively Multipath Source Routing · IEEE Trans. Parallel Distributed Syst. 2013
Routing and switching
source routing
0.212013
mPath: High-Bandwidth Data Transfers with Massively Multipath Source Routing · IEEE Trans. Parallel Distributed Syst. 2013
Transport protocols and congestion control › congestion control fairness
TCP friendliness
0.012013
mPath: High-Bandwidth Data Transfers with Massively Multipath Source Routing · IEEE Trans. Parallel Distributed Syst. 2013

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

proxy-based implementation · 0.2measurement · 0.2
YearPublicationVenuePosition
2013 mPath: High-Bandwidth Data Transfers with Massively Multipath Source Routing
abstract
The capacity of access links has increased dramatically in recent times, and bottlenecks are moving deeper into the Internet core. When bottlenecks occur in a core (or AS-AS peering) link, it is possible to use additional detour paths to improve the end-to-end throughput between a pair of source and destination nodes. We propose and evaluate a new massively multipath (mPath) source routing algorithm to improve end-to-end throughput for high-volume data transfers. We demonstrate that our algorithm is practical by implementing a system that employs a set of proxies to establish one-hop detour paths between the source and destination nodes. Our algorithm can fully utilize the available access link bandwidth when good proxied paths are available, without sacrificing TCP-friendliness, and achieves throughput comparable to TCP when such paths cannot be found. For 40 percent of our test cases on PlanetLab, mPath achieved significant improvements in throughput. Among these, 50 percent achieved a throughput of more than twice that of TCP.
Ben Leong, Daryl Seah, Ali Razeen
IEEE Trans. Parallel Distributed Syst.3