Server Saturation in Skewed Networks

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

doi:10.1145/3673660.3655080

Server Saturation in Skewed Networks

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

Stochastic Operations Research

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

6 Downloads (Pure)

Samenvatting

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.

Originele taal-2	Engels
Pagina's (van-tot)	97-98
Aantal pagina's	2
Tijdschrift	Performance Evaluation Review
Volume	52
Nummer van het tijdschrift	1
DOI's	https://doi.org/10.1145/3673660.3655080
Status	Gepubliceerd - 10 jun. 2024

Bibliografische nota

Publisher Copyright:
© 2024 Owner/Author.

Toegang tot document

10.1145/3673660.3655080

pdfDefinitieve gepubliceerde versie, 869 KBLicentie: TAVERNE

Andere bestanden en links

Link naar publicatie in Scopus

Citeer dit

@article{b0f5f7b739724dc982faee58ef66ef97,

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.\}",

note = "Publisher Copyright: {\textcopyright} 2024 Owner/Author.",

year = "2024",

month = jun,

day = "10",

doi = "10.1145/3673660.3655080",

language = "English",

volume = "52",

pages = "97--98",

journal = "Performance Evaluation Review",

issn = "0163-5999",

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

number = "1",

}

TY - JOUR

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 - http://www.scopus.com/inward/record.url?scp=85196363651&partnerID=8YFLogxK

U2 - 10.1145/3673660.3655080

DO - 10.1145/3673660.3655080

M3 - Article

AN - SCOPUS:85196363651

SN - 0163-5999

VL - 52

SP - 97

EP - 98

JO - Performance Evaluation Review

JF - Performance Evaluation Review

IS - 1

ER -

Server Saturation in Skewed Networks

Samenvatting

Bibliografische nota

Toegang tot document

Andere bestanden en links

Vingerafdruk

Citeer dit