Server Saturation in Skewed Networks

We use bipartite graphs to model compatibility constraints that arise between tasks and servers in data centers, cloud computing systems and content delivery networks. We prove that servers with skewed graph neighborhoods saturate with tasks in a limiting regime. The neighborhood of a server is skew...

Full description

Saved in:
Bibliographic Details
Published in:Performance evaluation review 2024-06, Vol.52 (1), p.97-98
Main Authors: Goldsztajn, Diego, Borst, Sem C., van Leeuwaarden, Johan S. H.
Format: Article
Language:English
Subjects:
Markov processes
Mathematics of computing
Probability and statistics
Stochastic processes
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We use bipartite graphs to model compatibility constraints that arise between tasks and servers in data centers, cloud computing systems and content delivery networks. We prove that servers with skewed graph neighborhoods saturate with tasks in a limiting regime. The neighborhood of a server is skewed if it contains a diverging number of dispatchers with uniformly bounded degrees.
ISSN:0163-5999
1557-9484
DOI:10.1145/3673660.3655080