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.
OpenFlow
20086.3k citationsNick McKeown, Hari Balakrishnan et al.profile →
A scalable content-addressable network
20013.9k citationsSylvia Ratnasamy, Paul Francis et al.profile →
This map shows the geographic impact of Scott Shenker'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 Scott Shenker with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Scott Shenker more than expected).
This network shows the impact of papers produced by Scott Shenker. 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 Scott Shenker. The network helps show where Scott Shenker may publish in the future.
Co-authorship network of co-authors of Scott Shenker
This figure shows the co-authorship network connecting the top 25 collaborators of Scott Shenker.
A scholar is included among the top collaborators of Scott Shenker 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 Scott Shenker. Scott Shenker is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Amaro, Emmanuel, Inder Monga, Ethan Katz-Bassett, et al.. (2024). An Architecture For Edge Networking Services. eScholarship (California Digital Library). 645–660.2 indexed citations
3.
Cangialosi, Frank, Mohammad Alizadeh, Hari Balakrishnan, et al.. (2024). Principles for Internet Congestion Management. Repository for Publications and Research Data (ETH Zurich). 166–180.2 indexed citations
Zhang, Wen, Scott Shenker, & Irene Zhang. (2020). Persistent State Machines for Recoverable In-memory Storage Systems with NVRam. Operating Systems Design and Implementation. 1029–1046.7 indexed citations
7.
Jin, Yuchen, Colin Scott, Amogh Dhamdhere, et al.. (2019). Stable and Practical AS Relationship Inference with ProbLink. Lancaster EPrints (Lancaster University).22 indexed citations
Bergemann, Dirk, Thomas M. Eisenbach, Joan Feigenbaum, & Scott Shenker. (2011). Pricing Under the Threat of Piracy: Flexibility and Platforms for Digital Goods. SSRN Electronic Journal.1 indexed citations
11.
Godfrey, P. Brighten, Igor Ganichev, Scott Shenker, & Ion Stoica. (2009). Pathlet routing. 111–122.175 indexed citations
12.
Ermolinskiy, Andrey, Daekyeong Moon, Byung-Gon Chun, & Scott Shenker. (2009). Minuet: rethinking concurrency control in storage area networks. UC Berkeley. 311–324.2 indexed citations
13.
Chun, Byung-Gon, Petros Maniatis, Scott Shenker, & John Kubiatowicz. (2009). Tiered fault tolerance for long-term integrity. File and Storage Technologies. 267–282.7 indexed citations
14.
Ratnasamy, Sylvia, Andrey Ermolinskiy, & Scott Shenker. (2006). Revisiting IP multicast. 15–26.55 indexed citations
15.
Casado, Martín, Tal Garfinkel, Aditya Akella, et al.. (2006). SANE: a protection architecture for enterprise networks. USENIX Security Symposium. 10.225 indexed citations
16.
Subramanian, Lakshminarayanan, Matthew Caesar, Cheng Tien Ee, et al.. (2005). HLP. 13–24.119 indexed citations
17.
Culler, David, Prabal Dutta, Cheng Tien Ee, et al.. (2005). Towards a sensor network architecture: lowering the waistline. 24–24.74 indexed citations
18.
Gummadi, R., et al.. (2004). RSR: Reduced-State Routing in the Internet. UCL Discovery (University College London).11 indexed citations
19.
Ratnasamy, Sylvia, Paul Francis, Mark Handley, Richard M. Karp, & Scott Shenker. (2001). A scalable content-addressable network. 161–172.3899 indexed citations breakdown →
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.