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.

Jiangchen Zhu

dblp:331/5726 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-5833-4180ORCID · corroborated

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

Computer networks · 2 · 1 first-author · 2 since 2021

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
2 papers
Content delivery and video streaming · 43% Routing and switching · 43% Internet architecture and protocols · 15%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › digital libraries
web archiving
0.712023
Reviving Dead Links on the Web with Fable · IMC 2023
Routing and switching › routing
anycast routing
0.612022
The best of both worlds: high availability CDN routing without compromising control · IMC 2022
Content delivery and video streaming
content delivery network
0.612022
The best of both worlds: high availability CDN routing without compromising control · IMC 2022
Internet architecture and protocols
world wide web
0.212023
Reviving Dead Links on the Web with Fable · IMC 2023
Distributed systems
fault tolerance
0.212022
The best of both worlds: high availability CDN routing without compromising control · IMC 2022
Distributed systems › fault tolerance
high availability
0.212022
The best of both worlds: high availability CDN routing without compromising control · IMC 2022

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

web crawling · 1.3archival reconstruction · 1.3internet experiments · 1.1hybrid routing techniques · 1.1
YearPublicationVenuePosition
2023 Reviving Dead Links on the Web with Fable
abstract
The web is littered with millions of links which previously worked but no longer do. When users encounter any such broken link, they resort to looking up an archived copy of the linked page. But, for a sizeable fraction of these broken links, no archived copies exist. Even if a copy exists, it often poorly approximates the original page, e.g., any functionality on the page which requires the client browser to communicate with the page's backend servers will not work, and even the latest copy will be missing updates made to the page's content after that copy was captured.
Anish Nyayachavadi, Jiangchen Zhu, Vaspol Ruamviboonsuk, Harsha V. Madhyastha
IMC3
2022 The best of both worlds: high availability CDN routing without compromising control
abstract
Content delivery networks (CDNs) provide fast service to clients by replicating content at geographically distributed sites. Most CDNs route clients to a particular site using anycast or unicast with DNS-based redirection. We analyze anycast and unicast and explain why neither of them provides both precise control of user-to-site mapping and high availability in the face of failures, two fundamental goals of CDNs. Anycast compromises control (and hence performance), and unicast compromises availability. We then present new hybrid techniques and demonstrate via experiments on the real Internet that these techniques provide both a high level of traffic control and fast failover following site failures.
Jiangchen Zhu, Kevin Vermeulen, Ítalo S. Cunha, Ethan Katz-Bassett, Matt Calder
IMC1