activity
20102026
most citedBalanced Fair Resource Sharing in Computer Clusters

46 citations · 192 across the 23 of their papers we have counts for

collaborators
Showing cs.NIShow all

6 papers · 1 filter

cs.NI2026

Exponential Backoff: Meta-Stability and Implicit Admission Control

Richard Combes, Fabien Mathieu, Thomas Bonald

We analyze exponential backoff, an algorithm used to share a single communication channel in a distributed manner between several users, in a similar way as many networking standar…

cs.NI2017

Performance of Balanced Fairness in Resource Pools: A Recursive Approach

Thomas Bonald, Céline Comte, Fabien Mathieu

Understanding the performance of a pool of servers is crucial for proper dimensioning. One of the main challenges is to take into account the complex interactions between servers t…

cs.NI2017

Power Control in Massive MIMO with Dynamic User Population

Mohamad Assaad, Salah Eddine Hajri, Thomas Bonald +1

This paper considers the problem of power control in Massive MIMO systems taking into account the pilot contamination issue and the arrivals and departures of users in the network.…

cs.NI2014★ 8 cited

Multi-resource fairness: Objectives, algorithms and performance

Thomas Bonald, James Roberts

Designing efficient and fair algorithms for sharing multiple resources between heterogeneous demands is becoming increasingly important. Applications include compute clusters share…

cs.NI2011★ 1 cited

Adaptive Probabilistic Flooding for Multipath Routing

Christophe Betoule, Thomas Bonald, Remi Clavier +3

In this work, we develop a distributed source routing algorithm for topology discovery suitable for ISP transport networks, that is however inspired by opportunistic algorithms use…

cs.NI2010

Performance of CSMA in Multi-Channel Wireless Networks

Thomas Bonald, Mathieu Feuillet

We analyze the performance of CSMA in multi-channel wireless networks, accounting for the random nature of traffic. Specifically, we assess the ability of CSMA to fully utilize the…