Danny De Vleeschauwer

Danny De Vleeschauwer

Auto-generated profile, based on publicly available information

Danny De Vleeschauwer

Network Automation Department, Nokia Bell Labs, Antwerp, Belgium

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 October 2020 in IEEE Communications Letters
Verified
Journal Article
Closed access
DVDanny De Vleeschauwer
Danny De Vleeschauwer
CPChrysa Papagianni
Chrysa Papagianni
AWAnwar Walid
Anwar Walid
When a network slice is requested, multiple technology and/or administrative domains are invoked to ensure that the slice end-to-end service level agreement (SLA) is met. Therefore, this SLA requirement needs to be decomposed in portions that each of the domains can support. In this paper we consider a management architecture consisting of an end-to-end service orchestrator responsible for decomposing the SLA, and domain controllers that govern their respective domain. The orchestrator has no detailed knowledge of the state of the resources in each of the domains when the network slice is requested. The orchestrator is only aware of the responses of the domains to previous requests, and captures this knowledge in a risk model associated with each domain. In this study, we propose an approach for decomposing the end-to-end SLA based on the best current estimate of the risk models of all involved domains. We further describe how the risk model for a particular domain is determined (and updated) based on historical data.

12 January 2022 in IEEE Access
Verified
Journal Article
Open access
JPJorge Martín Pérez
Jorge Martín Pérez
KKKoteswararao Kondepu
Koteswararao Kondepu
DVDanny De Vleeschauwer
Danny De Vleeschauwer
VRVenkatarami Reddy
Venkatarami Reddy
CGCarlos Guimarães
Carlos Guimarães
Carlos J. BernardosCarlos J. Bernardos
Carlos J. Bernardos
With the increasing adoption of intelligent transportation systems and the upcoming era of autonomous vehicles, vehicular services (such as remote driving, cooperative awareness, and hazard warning) will have to operate in an ever-changing and dynamic environment. Anticipating the dynamics of traffic flows on the roads is critical for these services and, therefore, it is of paramount importance to forecast how they will evolve over time. By predicting future events (such as traffic jams) and demands, vehicular services can take proactive actions to minimize Service Level Agreement (SLA) violations and reduce the risk of accidents. In this paper, we compare several techniques, including both traditional time-series and recent Machine Learning (ML)-based approaches, to forecast the traffic flow at different road segments in the city of Torino (Italy). Using the most accurate forecasting technique, we propose n-max algorithm as a forecast-based scaling algorithm for vertical scaling of edge resources, comparing its benefits against state-of-the-art solutions for three distinct Vehicle-to-Network (V2N) services. Results show that the proposed scaling algorithm outperforms the state-of-the-art, reducing Service Level Objective (SLO) violations for remote driving and hazard warning services.

24 April 2023 in IEEE Access
Verified
Journal Article
Open access
APAngelos Pentelas
Angelos Pentelas
DVDanny De Vleeschauwer
Danny De Vleeschauwer
CCChia-Yu Chang
Chia-Yu Chang
KSKoen De Schepper
Koen De Schepper
PPPanagiotis Papadimitriou
Panagiotis Papadimitriou
Network Function Virtualization (NFV) decouples network functions from the underlying specialized devices, enabling network processing with higher flexibility and resource efficiency. This promotes the use of virtual network functions (VNFs), which can be grouped to form a service function chain (SFC). A critical challenge in NFV is SFC partitioning (SFCP), which is mathematically expressed as a graph-to-graph mapping problem. Given its NP-hardness, SFCP is commonly solved by approximation methods. Yet, the relevant literature exhibits a gradual shift towards data-driven SFCP frameworks, such as (deep) reinforcement learning (RL). In this article, we initially identify crucial limitations of existing RL-based SFCP approaches. In particular, we argue that most of them stem from the centralized implementation of RL schemes. Therefore, we devise a cooperative deep multi-agent reinforcement learning (DMARL) scheme for decentralized SFCP, which fosters the efficient communication of neighboring agents. Our simulation results (i) demonstrate that DMARL outperforms a state-of-the-art centralized double deep Q-learning algorithm, (ii) unfold the fundamental behaviors learned by the team of agents, (iii) highlight the importance of information exchange between agents, and (iv) showcase the implications stemming from various network topologies on the DMARL efficiency.

30 August 2023 in IEEE Networking Letters
Verified
Journal Article
Closed access
CHCyril Shih-Huan Hsu
Cyril Shih-Huan Hsu
DVDanny De Vleeschauwer
Danny De Vleeschauwer
CPChrysa Papagianni
Chrysa Papagianni
For a network slice that spans multiple technology and/or administrative domains, these domains must ensure that the slice’s End-to-End (E2E) Service Level Agreement (SLA) is met. Thus, the E2E SLA should be decomposed to partial SLAs, assigned to each of these domains. Assuming a two-level management architecture consisting of an E2E service orchestrator and local domain controllers, we consider that the former is only aware of historical data of the local controllers’ responses to previous slice requests, and captures this knowledge in a risk model per domain. In this study, we propose the use of Neural Network (NN) based risk models, using such historical data, to decompose the E2E SLA. Specifically, we introduce models that incorporate monotonicity, applicable even in cases involving small datasets. An empirical study on a synthetic multi-domain dataset demonstrates the efficiency of our approach.

1 April 2012
Verified
Conference Paper
Closed access
DMDana Marinca
Dana Marinca
AHAli Hamieh
Ali Hamieh
DBDominique Barth
Dominique Barth
KKKinda Khawam
Kinda Khawam
DVDanny De Vleeschauwer
Danny De Vleeschauwer
YLYannick Lelouedec
Yannick Lelouedec
Caching is an effective technique to improve the quality of streaming multimedia services. In this paper, we propose a novel content caching scheme referred as “Cache Management using Temporal Pattern based Solicitation” (CMTPS), to further minimize both service delays and load in the network for Video on Demand (VoD) applications. CMPTS is based on the analysis of clients' requests over passed time intervals to predict the contents that will be solicited in the near future. By means of experimental tests, the CMTPS protocol is evaluated. The obtained results show that CMTPS outperforms LRU, in terms of peak traffic reduction and number of cache hits.

31 March 2025
Verified
Conference Paper
Open access
MFMatthias De Fré
Matthias De Fré
JHJeroen van der Hooft
Jeroen van der Hooft
CCChia-Yu Chang
Chia-Yu Chang
KSKoen De Schepper
Koen De Schepper
PAPatrice Rondao Alface
Patrice Rondao Alface
FTFilip De Turck
Filip De Turck