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.
Distributed Caching Algorithms for Content Distribution Networks
2010473 citationsSem Borst, Anwar Walid et al.TU/e Research Portalprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Sem Borst'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 Sem Borst with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sem Borst more than expected).
This network shows the impact of papers produced by Sem Borst. 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 Sem Borst. The network helps show where Sem Borst may publish in the future.
Co-authorship network of co-authors of Sem Borst
This figure shows the co-authorship network connecting the top 25 collaborators of Sem Borst.
A scholar is included among the top collaborators of Sem Borst 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 Sem Borst. Sem Borst is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Borst, Sem, et al.. (2020). Joint Scheduling of Low-Latency and Best-Effort Flows in 5G Wireless Networks. 1–8.4 indexed citations
3.
Borst, Sem, et al.. (2014). Markovian polling systems with an application to wireless random-access networks. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 2014001.1 indexed citations
Borst, Sem, Anupam Gupta, & Anwar Walid. (2010). Distributed caching algorirthms for content distribution netowkrs. Data Archiving and Networked Services (DANS).1 indexed citations
Borst, Sem, Iraj Saniee, & Anwar Walid. (2009). An analytical model for provisioning of emerging personalized content distribution services. TU/e Research Portal. 1–8.1 indexed citations
9.
Ayesta, Urtzi, et al.. (2008). Monotonicity properties for multi-class queueing systems. TU/e Research Portal (Eindhoven University of Technology). 1–26.1 indexed citations
Bekker, René & Sem Borst. (2005). Optimal admission control in queues with workload-dependent service rates. TU/e Research Portal (Eindhoven University of Technology). 1–27.1 indexed citations
12.
Borst, Sem, et al.. (2005). Stability of size-based scheduling disciplines in resource-sharing networks. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–26.5 indexed citations
13.
Bonald, Thomas, Sem Borst, & Alexandre Proutière. (2004). Inter-cell scheduling in wireless data networks. TU/e Research Portal. 1–12.74 indexed citations
14.
Borst, Sem, et al.. (2004). A stochastic mean-value method for the derivation of delay asymptotics in heavy-tailed processor-sharing systems. 200411.1 indexed citations
15.
Borst, Sem. (2003). User-level performance of channel-aware scheduling algorithms.8 indexed citations
Borst, Sem, et al.. (2000). Exact asymptotics for fluid queues fed by multiple heavy-tailed on-off flows. TU/e Research Portal. 200014.8 indexed citations
18.
Mei, R.D. van der & Sem Borst. (1994). Analysis of multiple-server polling systems by means of the power-series algorithm. 9410(10). 1–22.1 indexed citations
19.
Borst, Sem, Onno Boxma, & Hanoch Levy. (1993). The use of service limits for efficient operation of multi-station single-medium communication systems. Data Archiving and Networked Services (DANS). 94(12). 1–24.1 indexed citations
20.
Borst, Sem. (1993). A polling system with a dormant server. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 9313(13). 1–36.2 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.