Tim Hellemans

Orcid: 0000-0002-9255-3141

According to our database1, Tim Hellemans authored at least 15 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Join-Up-To(m): improved hyperscalable load balancing.
Queueing Syst. Theory Appl., December, 2023

Performance of Load Balancers With Bounded Maximum Queue Length in Case of Non-Exponential Job Sizes.
IEEE/ACM Trans. Netw., August, 2023

2022
Improved Load Balancing in Large Scale Systems Using Attained Service Time Reporting.
IEEE/ACM Trans. Netw., 2022

Open problems in refined mean field approximations.
Queueing Syst. Theory Appl., 2022

Performance analysis of load balancing policies with memory.
Perform. Evaluation, 2022

2021
Analysis of large scale randomized load balancing policies
PhD thesis, 2021

Mean Waiting Time in Large-Scale and Critically Loaded Power of d Load Balancing Systems.
Proc. ACM Meas. Anal. Comput. Syst., 2021

Download time analysis for distributed storage systems with node failures.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Heavy Traffic Analysis of the Mean Response Time for Load Balancing Policies in the Mean Field Regime.
CoRR, 2020

2019
Performance of Redundancy(<i>d</i>) with Identical/Independent Replicas.
ACM Trans. Model. Perform. Evaluation Comput. Syst., 2019

Performance Analysis of Workload Dependent Load Balancing Policies.
Proc. ACM Meas. Anal. Comput. Syst., 2019

Analysis of lead time correlation under a base-stock policy.
Eur. J. Oper. Res., 2019

2018
Analysis of Redundancy(d) with Identical Replicas.
SIGMETRICS Perform. Evaluation Rev., 2018

On the Power-of-d-choices with Least Loaded Server Selection.
Proc. ACM Meas. Anal. Comput. Syst., 2018

2017
On a class of push and pull strategies with single migrations and limited probe rate.
Perform. Evaluation, 2017


  Loading...