Combining queueing analysis and machine learning for performance modeling of distributed systems

Performance modeling is commonly used during the early design phase of a system to ensure that performance meets quality of service (QoS) requirements. Queueing analysis is a classic analytical approach that abstracts queueing networks (QNs) from systems and quantitatively characterizes system behavior to support decision-making. However, most realistic QNs are mathematically intractable, leading to two key challenges. The first challenge is characterizing complex response time distributions, a task beyond the capabilities of conventional approaches. The second challenge is accurately evaluating the performance of non-product-form QNs, for which queueing analysis lacks a closed-form solution. Machine learning (ML) advancement presents new opportunities for performance modeling. Nevertheless, the use of ML faces the challenge of lacking flexibility, making it difficult to apply to QNs with varying topologies and numbers of job classes, which limits its potential as a general-purpose solution. We address these challenges by combining queueing analysis and ML approaches. To estimate response time distributions, we propose a phase-type density-passing framework which recursively propagates response time distributions predicted by mixture density networks, enabling accurate approximations. To address the challenges of evaluating non-product-form QNs, we leverage insights from queueing analysis to design graph neural network (GNN) models. First, we develop a model to solve closed multiclass QNs. Similar to analytical methods, our GNN predicts performance measures per job class at each service center. This exploration reveals the potential of a learning-based model as a general-purpose solver for various QNs. Next, we define a more fine-grained graph for open multiclass QNs abstracted from distributed edge AI systems and customize message passing based on queueing analysis of chain-based services. To broaden its applicability, we propose a solution for achieving out-of-distribution generalization ability. We demonstrate that the proposed model is an accurate yet efficient performance modeling tool for determining the optimal plan during the system design.

Institutions

Publication Details

Journal
Imperial College Research Computing Service Data Repository
Published
2024-10-04
DOI
https://doi.org/10.25560/122292
Primary Topic
Software System Performance and Reliability
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Combining queueing analysis and machine learning for performance modeling of distributed systems

Imperial College Research Computing Service Data Repository
Software System Performance and Reliability
article

Combining queueing analysis and machine learning for performance modeling of distributed systems

article en

Abstract

Performance modeling is commonly used during the early design phase of a system to ensure that performance meets quality of service (QoS) requirements. Queueing analysis is a classic analytical approach that abstracts queueing networks (QNs) from systems and quantitatively characterizes system behavior to support decision-making. However, most realistic QNs are mathematically intractable, leading to two key challenges. The first challenge is characterizing complex response time distributions, a task beyond the capabilities of conventional approaches. The second challenge is accurately evaluating the performance of non-product-form QNs, for which queueing analysis lacks a closed-form solution. Machine learning (ML) advancement presents new opportunities for performance modeling. Nevertheless, the use of ML faces the challenge of lacking flexibility, making it difficult to apply to QNs with varying topologies and numbers of job classes, which limits its potential as a general-purpose solution. We address these challenges by combining queueing analysis and ML approaches. To estimate response time distributions, we propose a phase-type density-passing framework which recursively propagates response time distributions predicted by mixture density networks, enabling accurate approximations. To address the challenges of evaluating non-product-form QNs, we leverage insights from queueing analysis to design graph neural network (GNN) models. First, we develop a model to solve closed multiclass QNs. Similar to analytical methods, our GNN predicts performance measures per job class at each service center. This exploration reveals the potential of a learning-based model as a general-purpose solver for various QNs. Next, we define a more fine-grained graph for open multiclass QNs abstracted from distributed edge AI systems and customize message passing based on queueing analysis of chain-based services. To broaden its applicability, we propose a solution for achieving out-of-distribution generalization ability. We demonstrate that the proposed model is an accurate yet efficient performance modeling tool for determining the optimal plan during the system design.

Imperial College Research Computing Service Data Repository
Imperial College London (GB)
Openalex Percentile: Top 53%
Software System Performance and Reliability
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Combining queueing analysis and machine learning for performance modeling of distributed systems · Imperial College Research Computing Service Data Repository (2024) | TGRS Research Map | TGRS