Intent-Based Service Graph Selection for Cost-Effective Cloud Deployment

Cloud computing offers a diverse range of virtualized services for users. However, selecting and composing these services to generate optimal service graphs that meet user requirements is complex because it requires an expert with extensive knowledge of the cloud applications and their service composition, to manually generate service graphs. This, however, cannot often guarantee that all the requirements are met. A potentially promising approach to address this complexity is to develop a system that enables cloud users to specify their intent and then to automatically select a service graph that meets all their requirements. In this paper, we address the problem of service graph selection while considering both functional and non-functional requirements derived from user intent. Our objective is to minimize the total deployment cost of the service graph in a data center network and to determine its placement within the distributed data center network. We formulate the problem as an Integer Linear Programming (ILP), taking into account the bandwidth and latency requirements of user intent. To solve this, we propose our Service Graph Selection (SGS) solution, which aims to achieve a near-optimal solution in a computationally efficient manner. Our results demonstrate that the proposed solution achieves a deployment cost that is only 4–6% larger than the lower bound of the optimal deployment cost.

Authors

Institutions

Publication Details

Published
2025-03-11
DOI
https://doi.org/10.1109/icin64016.2025.10942645
Primary Topic
Service-Oriented Architecture and Web Services
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Intent-Based Service Graph Selection for Cost-Effective Cloud Deployment

Fetahi Wuhib, Amin Ebrahimzadeh, Roch Glitho, Mbarka Soualhia et al.
Service-Oriented Architecture and Web Services
article

Intent-Based Service Graph Selection for Cost-Effective Cloud Deployment

Fetahi Wuhib, Amin Ebrahimzadeh, Roch Glitho, Mbarka Soualhia, Sasan Sabour
article en

Abstract

Cloud computing offers a diverse range of virtualized services for users. However, selecting and composing these services to generate optimal service graphs that meet user requirements is complex because it requires an expert with extensive knowledge of the cloud applications and their service composition, to manually generate service graphs. This, however, cannot often guarantee that all the requirements are met. A potentially promising approach to address this complexity is to develop a system that enables cloud users to specify their intent and then to automatically select a service graph that meets all their requirements. In this paper, we address the problem of service graph selection while considering both functional and non-functional requirements derived from user intent. Our objective is to minimize the total deployment cost of the service graph in a data center network and to determine its placement within the distributed data center network. We formulate the problem as an Integer Linear Programming (ILP), taking into account the bandwidth and latency requirements of user intent. To solve this, we propose our Service Graph Selection (SGS) solution, which aims to achieve a near-optimal solution in a computationally efficient manner. Our results demonstrate that the proposed solution achieves a deployment cost that is only 4–6% larger than the lower bound of the optimal deployment cost.

Ericsson (Canada) (CA), Concordia University (CA)
Openalex Percentile: Top 92%
Service-Oriented Architecture and Web Services
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.