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.
Flow Monitoring Explained: From Packet Capture to Data Analysis With NetFlow and IPFIX
Countries citing papers authored by Brian Trammell
Since
Specialization
Citations
This map shows the geographic impact of Brian Trammell'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 Brian Trammell with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Brian Trammell more than expected).
This network shows the impact of papers produced by Brian Trammell. 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 Brian Trammell. The network helps show where Brian Trammell may publish in the future.
Co-authorship network of co-authors of Brian Trammell
This figure shows the co-authorship network connecting the top 25 collaborators of Brian Trammell.
A scholar is included among the top collaborators of Brian Trammell 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 Brian Trammell. Brian Trammell is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Trammell, Brian, et al.. (2018). Adding Explicit Passive Measurability of Two-Way Latency to the QUIC Transport Protocol.1 indexed citations
2.
Kühlewind, Mirja, et al.. (2018). Tracing Internet Path Transparency. Aberdeen University Research Archive (Aberdeen University). 1–7.1 indexed citations
3.
Kühlewind, Mirja & Brian Trammell. (2018). The QUIC Latency Spin Bit.4 indexed citations
4.
Trammell, Brian. (2016). Abstract Mechanisms for a Cooperative Path Layer under Endpoint Control.1 indexed citations
5.
Kühlewind, Mirja, et al.. (2016). Latency Loss Tradeoff PHB Group.2 indexed citations
Dusi, Maurizio, Felipe Huici, Andrea Di Pietro, et al.. (2012). Blockmon: Flexible and high-performance big data stream analytics platform and its use cases. Cineca Institutional Research Information System (Tor Vergata University). 7(2). 102–106.10 indexed citations
10.
Huici, Felipe, et al.. (2012). Blockmon. ACM SIGCOMM Computer Communication Review. 42(4). 79–80.12 indexed citations
Bianchi, Giuseppe, et al.. (2010). Scalable and fast approximate excess rate detection. Cineca Institutional Research Information System (Tor Vergata University). 1–9.2 indexed citations
14.
Trammell, Brian, et al.. (2010). YAF: yet another flowmeter. USENIX Large Installation Systems Administration Conference. 1–16.37 indexed citations
15.
Frei, Stefan, Dominik Schatzmann, Bernhard Plattner, & Brian Trammell. (2009). Modelling the Security Ecosystem- The Dynamics of (In)Security..12 indexed citations
16.
Zseby, Tanja, et al.. (2009). Specification of the IPFIX File Format.
17.
Trammell, Brian & Carrie Gates. (2006). NAF: the NetSA aggregated flow tool suite. USENIX Large Installation Systems Administration Conference. 18–18.4 indexed citations
18.
Trammell, Brian, et al.. (2006). Bidirectional Flow Export using IPFIX.4 indexed citations
19.
Trammell, Brian, et al.. (2006). IODEF/RID over SOAP.1 indexed citations
20.
Trammell, Brian, et al.. (2000). An Architecture for Transport Services.10 indexed citations
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.