Jonatan Krolikowski

Jonatan Krolikowski

Auto-generated profile, based on publicly available information

Jonatan Krolikowski

Huawei Technologies Co., Ltd., Paris, France

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
1 January 2015 in Applied Soft Computing
Verified
Journal Article
Closed access
FDFabio D'Andreagiovanni
Fabio D'Andreagiovanni
JKJonatan Krolikowski
Jonatan Krolikowski
JPJonad Pulaj
Jonad Pulaj

7 June 2018 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
JKJonatan Krolikowski
Jonatan Krolikowski
AGAnastasios Giovanidis
Anastasios Giovanidis
MRMarco Di Renzo
Marco Di Renzo
Caching popular content at the wireless edge promises performance benefits as well as business perspectives. In this work we study the following arrangement: a Mobile Network Operator (MNO) pre-installs memory on its wireless equipment, sets a price, and invites a unique Content Provider (CP) to invest. The CP leases memory space and places its content; the MNO then associates network users to stations, aiming for offloading CP traffic or not. We formulate an optimization problem, which maximizes offloading with minimum leasing costs for the CP. This is an NP-hard mixed-integer non-linear optimization problem. We present an iterative exact solution using Generalized Benders decomposition into a content-related Master problem and a user-association Slave problem. Master is integer linear. Slave is convex for various association policies, including (1) join-the-closest-cache, and (2) cache-aware association. For Slave, we introduce a distributed exact solution, named Generalized Bucket-filling. Extensive simulations illustrate the performance benefits under different association policies. The solution helps to determine the optimal leasing price for the MNO, and the optimal investment budget for the CP. As a general conclusion, both actors profit when the MNO association supports CP decisions.


19 December 2022 in IEEE Communications Magazine
Verified
Journal Article
Open access
OIOvidiu Iacoboaiea
Ovidiu Iacoboaiea
JKJonatan Krolikowski
Jonatan Krolikowski
ZHZied Ben Houidi
Zied Ben Houidi
DRDario Rossi
Dario Rossi
Machine learning (ML) is increasingly used to automate networking tasks, in a paradigm known as zero-touch network and service management (ZSM). In particular, Deep Reinforcement Learning (DRL) techniques have recently gathered much attention for their ability to learn taking complex decisions in different fields. In the ZSM context, DRL is an appealing candidate for tasks such as dynamic resource allocation, that are generally formulated as hard optimization problems. At the same time, successful training and deployment of DRL agents in real-world scenarios faces a number of challenges that we outline and address in this paper. Tackling the case of Wireless Local Area Network (WLAN) radio resource management, we report guidelines that extend to other usecases and more general contexts.

1 April 2012
Verified
Conference Paper
Closed access
AGAnastasios Giovanidis
Anastasios Giovanidis
JKJonatan Krolikowski
Jonatan Krolikowski
SBStefan Brueck
Stefan Brueck
Base station cooperation in the downlink of cellular systems has been recently suggested as a promising concept towards a better exploitation of the communication system's physical resources. It may offer a high gain in capacity through interference mitigation. This however, comes at a cost of high information exchange between cooperating entities and a high computational burden. Clustering of base stations into subgroups is an alternative to guarantee such cooperation benefits in a lower scale. The optimal definition of clusters, however, and a systematic way to find a solution to such problem is not yet available. In this work, we highlight the combinatorial nature of the problem, exploit this to describe the system of users and base stations as a graph and formulate a pure 0-1 program. Its solution suggests a cost optimal way to form clusters and assign user subsets to them.

1 May 2017
Verified
Conference Paper
Open access
JKJonatan Krolikowski
Jonatan Krolikowski
AGAnastasios Giovanidis
Anastasios Giovanidis
MRMarco Di Renzo
Marco Di Renzo