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.
Scenario-based performance analysis of routing protocols for mobile ad-hoc networks
1999594 citationsPer Johansson, Tony Larsson et al.profile →
Small forwarding tables for fast routing lookups
1997447 citationsMikael Degermark, Andrej Brodnik et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Mikael Degermark
Since
Specialization
Citations
This map shows the geographic impact of Mikael Degermark'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 Mikael Degermark with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mikael Degermark more than expected).
Fields of papers citing papers by Mikael Degermark
This network shows the impact of papers produced by Mikael Degermark. 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 Mikael Degermark. The network helps show where Mikael Degermark may publish in the future.
Co-authorship network of co-authors of Mikael Degermark
This figure shows the co-authorship network connecting the top 25 collaborators of Mikael Degermark.
A scholar is included among the top collaborators of Mikael Degermark 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 Mikael Degermark. Mikael Degermark is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
18 of 18 papers shown
1.
Degermark, Mikael. (2004). RFC 3828: The Lightweight User Datagram Protocol (UDP Lite). Lancaster EPrints (Lancaster University).11 indexed citations
Bormann, Carsten, Carsten Burmeister, Mikael Degermark, et al.. (2001). RObust Header Compression (ROHC): Framework and four profiles.58 indexed citations
5.
Fairhurst, Gorry, et al.. (2001). The UDP-Lite Protocol. Aberdeen University Research Archive (Aberdeen University).26 indexed citations
6.
Degermark, Mikael, et al.. (2000). Robust checksum-based header compression. KTH Publication Database DiVA (KTH Royal Institute of Technology).5 indexed citations
7.
Hannu, Hans, et al.. (2000). RObust Checksum-based header COmpression (ROCCO).14 indexed citations
Chao, H. Jonathan, Mikael Degermark, Nick McKeown, & Hong-Yi Tzeng. (1999). Next-generation IP switches and routers. IEEE Journal on Selected Areas in Communications. 17(6). 1009–1012.3 indexed citations
10.
Johansson, Per, et al.. (1999). Scenario-based performance analysis of routing protocols for mobile ad-hoc networks. 195–206.594 indexed citations breakdown →
11.
Degermark, Mikael, et al.. (1999). RFC 2507: IP header compression. KTH Publication Database DiVA (KTH Royal Institute of Technology).23 indexed citations
12.
Larzon, Lars-Åke, Mikael Degermark, & Stephen Pink. (1999). UDP lite for real time multimedia applications.92 indexed citations
Degermark, Mikael, Andrej Brodnik, Svante Carlsson, & Stephen Pink. (1997). Small forwarding tables for fast routing lookups. ACM SIGCOMM Computer Communication Review. 27(4). 3–14.154 indexed citations
16.
Degermark, Mikael, Andrej Brodnik, Svante Carlsson, & Stephen Pink. (1997). Small forwarding tables for fast routing lookups. 3–14.447 indexed citations breakdown →
17.
Degermark, Mikael & Stephen Pink. (1996). Soft state header compression for wireless networks. KTH Publication Database DiVA (KTH Royal Institute of Technology).5 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.