activity
20162021
most citedBalanced Fair Resource Sharing in Computer Clusters

46 citations · 83 across the 9 of their papers we have counts for

collaborators

9 papers

cs.NI2021★ 1 cited

Online Stochastic Matching: A Polytope Perspective

C{é}line Comte, Fabien Mathieu, Sushil Mahavir Varma +1

Stochastic dynamic matching problems have recently gained attention in the stochastic-modeling community due to their diverse applications, such as supply-chain management and kidn…

cs.NI2021★ 10 cited

Load Balancing in Heterogeneous Server Clusters: Insights From a Product-Form Queueing Model

Mark van der Boor, Céline Comte

Efficiently exploiting servers in data centers requires performance analysis methods that account not only for the stochastic nature of demand but also for server heterogeneity. Al…

math.PR2020★ 14 cited

Stochastic Non-Bipartite Matching Models and Order-Independent Loss Queues

Céline Comte

The problem of appropriately matching items subject to compatibility constraints arises in a number of important applications. While most of the literature on matching theory focus…

cs.PF2020★ 4 cited

Pass-and-Swap Queues

Céline Comte, Jan-Pieter Dorsman

Order-independent (OI) queues, introduced by Berezner, Kriel, and Krzesinski in 1995, expanded the family of multi-class queues that are known to have a product-form stationary dis…

cs.NI2018

Of Kernels and Queues: when network calculus meets analytic combinatorics

Anne Bouillard, Céline Comte, Élie De Panafieu +1

Stochastic network calculus is a tool for computing error bounds on the performance of queueing systems. However, deriving accurate bounds for networks consisting of several queues…

cs.PF2018★ 3 cited

Dynamic Load Balancing with Tokens

Céline Comte

Efficiently exploiting the resources of data centers is a complex task that requires efficient and reliable load balancing and resource allocation algorithms. The former are in cha…