Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
A scalable content-addressable network
20013.9k citationsSylvia Ratnasamy, Paul Francis et al.profile →
A scalable content-addressable network
20011.3k citationsSylvia Ratnasamy, Paul Francis et al.profile →
Equation-based congestion control for unicast applications
20001.0k citationsMark Handley, Joerg Widmer et al.profile →
Congestion control for high bandwidth-delay product networks
2012401 citationsCostin Raiciu, Christoph Paasch et al.Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B))profile →
Re-architecting datacenter networks and stacks for low latency and high performance
2017259 citationsMark Handley, Costin Raiciu et al.profile →
Author Peers
Peers are selected by citation overlap in the author's most active subfields.
citations ·
hero ref
This map shows the geographic impact of Mark Handley's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Mark Handley with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mark Handley more than expected).
This network shows the impact of papers produced by Mark Handley. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Mark Handley. The network helps show where Mark Handley may publish in the future.
Co-authorship network of co-authors of Mark Handley
This figure shows the co-authorship network connecting the top 25 collaborators of Mark Handley.
A scholar is included among the top collaborators of Mark Handley based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Mark Handley. Mark Handley is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Watson, Robert N. M., et al.. (2017). Disk|Crypt|Net. 211–224.9 indexed citations
3.
Handley, Mark, et al.. (2014). HACK: hierarchical ACKs for efficient wireless medium utilization. UCL Discovery (University College London). 359–370.11 indexed citations
4.
Karp, Brad, et al.. (2013). LOUP: the principles and practice of intra-domain route dissemination. UCL Discovery (University College London). 413–426.7 indexed citations
Bonaventure, Olivier, Mark Handley, & Costin Raiciu. (2012). An Overview of Multipath TCP. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 37(5). 17–23.32 indexed citations
7.
Wischik, Damon, Costin Raiciu, Adam Greenhalgh, & Mark Handley. (2011). Design, implementation and evaluation of congestion control for multipath TCP. Networked Systems Design and Implementation. 99–112.465 indexed citations breakdown →
8.
Bittau, Andrea, et al.. (2008). Wedge: splitting applications into reduced-privilege compartments. UCL Discovery (University College London). 309–322.101 indexed citations
9.
Handley, Mark, et al.. (2006). RFC 4566: SDP: Session Description Protocol. UCL Discovery (University College London).21 indexed citations
10.
Handley, Mark & Eric Rescorla. (2006). RFC 4732: Internet Denial-of-Service Considerations. UCL Discovery (University College London).6 indexed citations
11.
Widmer, Joerg & Mark Handley. (2006). RFC 4654: TCP-Friendly Multicast Congestion Control (TFMCC): Protocol Specification. UCL Discovery (University College London).19 indexed citations
12.
Subramanian, Lakshminarayanan, Matthew Caesar, Cheng Tien Ee, et al.. (2005). HLP. 13–24.119 indexed citations
13.
Greenhalgh, Adam, Mark Handley, & Felipe Huici. (2005). Using routing and tunneling to combat DoS attacks. UCL Discovery (University College London). 1–1.11 indexed citations
Ratnasamy, Sylvia, Paul Francis, Mark Handley, Richard M. Karp, & Scott Shenker. (2001). A scalable content-addressable network. 161–172.3899 indexed citations breakdown →
16.
Handley, Mark, Vern Paxson, & Christian Kreibich. (2001). Network intrusion detection: evasion, traffic normalization, and end-to-end protocol semantics. UCL Discovery (University College London). 9–9.263 indexed citations
17.
Breslau, Lee, Deborah Estrin, Kevin Fall, et al.. (1999). Improving Simulation for Network Research.95 indexed citations
18.
Kirstein, Peter T., Mark Handley, Angela Sasse, & Stuart Clayman. (1995). Recent Activities in the MICE Conferencing Project. UCL Discovery (University College London).4 indexed citations
19.
Sasse, Martina Angela, et al.. (1993). Support for Collaborative Authoring via Electronic Mail: The MESSIE Environment.. UCL Discovery (University College London). 257.4 indexed citations
20.
Crowcroft, Jon, et al.. (1992). Some Multimedia Traffic Characterization and Measurement Results.. Networks. 3–14.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.