Server Saturation in Skewed Networks

Diego Goldsztajn; Sem C. Borst; Johan S.H. van Leeuwaarden

doi:10.1145/3652963.3655080

Server Saturation in Skewed Networks

Diego Goldsztajn
, Sem C. Borst
, Johan S.H. van Leeuwaarden

Stochastic Operations Research

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

18 Downloads (Pure)

Abstract

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.

Original language	English
Title of host publication	SIGMETRICS/PERFORMANCE 2024
Subtitle of host publication	Abstracts of the 2024 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems
Place of Publication	New York
Publisher	Association for Computing Machinery, Inc.
Pages	97-98
Number of pages	2
ISBN (Electronic)	979-8-4007-0624-0
DOIs	https://doi.org/10.1145/3652963.3655080
Publication status	Published - 10 Jun 2024
Event	2024 ACM SIGMETRICS/IFIP Performance Conference on Measurement and Modeling of Computer Systems, SIGMETRICS/PERFORMANCE 2024 - Venice, Italy Duration: 10 Jun 2024 → 14 Jun 2024

Conference

Conference	2024 ACM SIGMETRICS/IFIP Performance Conference on Measurement and Modeling of Computer Systems, SIGMETRICS/PERFORMANCE 2024
Country/Territory	Italy
City	Venice
Period	10/06/24 → 14/06/24

Keywords

coupling
drift analysis
load balancing
networks with skewed degrees

Access to Document

10.1145/3652963.3655080

pdfFinal published version, 869 KBLicence: TAVERNE

Cite this

@inproceedings{039bf1bb8147471eb95904c813da14e8,

title = "Server Saturation in Skewed Networks",

abstract = "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.",

keywords = "coupling, drift analysis, load balancing, networks with skewed degrees",

author = "Diego Goldsztajn and Borst, \{Sem C.\} and \{van Leeuwaarden\}, \{Johan S.H.\}",

year = "2024",

month = jun,

day = "10",

doi = "10.1145/3652963.3655080",

language = "English",

pages = "97--98",

booktitle = "SIGMETRICS/PERFORMANCE 2024",

publisher = "Association for Computing Machinery, Inc.",

address = "United States",

note = "2024 ACM SIGMETRICS/IFIP Performance Conference on Measurement and Modeling of Computer Systems, SIGMETRICS/PERFORMANCE 2024 ; Conference date: 10-06-2024 Through 14-06-2024",

}

Goldsztajn, D, Borst, SC & van Leeuwaarden, JSH 2024, Server Saturation in Skewed Networks. in SIGMETRICS/PERFORMANCE 2024: Abstracts of the 2024 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery, Inc., New York, pp. 97-98, 2024 ACM SIGMETRICS/IFIP Performance Conference on Measurement and Modeling of Computer Systems, SIGMETRICS/PERFORMANCE 2024, Venice, Italy, 10/06/24. https://doi.org/10.1145/3652963.3655080

Server Saturation in Skewed Networks. / Goldsztajn, Diego; Borst, Sem C.; van Leeuwaarden, Johan S.H.
SIGMETRICS/PERFORMANCE 2024: Abstracts of the 2024 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems. New York: Association for Computing Machinery, Inc., 2024. p. 97-98.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Server Saturation in Skewed Networks

AU - Goldsztajn, Diego

AU - Borst, Sem C.

AU - van Leeuwaarden, Johan S.H.

PY - 2024/6/10

Y1 - 2024/6/10

N2 - 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.

AB - 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.

KW - coupling

KW - drift analysis

KW - load balancing

KW - networks with skewed degrees

UR - https://www.scopus.com/pages/publications/85196431914

U2 - 10.1145/3652963.3655080

DO - 10.1145/3652963.3655080

M3 - Conference contribution

AN - SCOPUS:85196431914

SP - 97

EP - 98

BT - SIGMETRICS/PERFORMANCE 2024

PB - Association for Computing Machinery, Inc.

CY - New York

T2 - 2024 ACM SIGMETRICS/IFIP Performance Conference on Measurement and Modeling of Computer Systems, SIGMETRICS/PERFORMANCE 2024

Y2 - 10 June 2024 through 14 June 2024

ER -

Server Saturation in Skewed Networks

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this