activity
20172021
most citedLearning to Cache With No Regrets

2 citations · 2 across the 2 of their papers we have counts for

collaborators

11 papers

cs.NI2021

Blind Optimal User Association in Small-Cell Networks

Livia Elena Chatzieleftheriou, Apostolos Destounis, Georgios Paschos +1

We learn optimal user association policies for traffic from different locations to Access Points(APs), in the presence of unknown dynamic traffic demand. We aim at minimizing a bro…

cs.IT2020

Multi-Agent Deep Stochastic Policy Gradient for Event Based Dynamic Spectrum Access

Rahif Kassab, Apostolos Destounis, Dimitrios Tsilimantos +1

We consider the dynamic spectrum access (DSA) problem where Internet of Things (IoT) devices compete for time slots constituting a frame. Devices collectively monitor e…

cs.NI2020

Online Convex Optimization for Caching Networks

Georgios Paschos, Apostolos Destounis, George Iosifidis

We study the problem of wireless edge caching when file popularity is unknown and possibly non-stationary. A bank of caches receives file requests and a utility is accrued for…

cs.NI2019

Learning to Cooperate in D2D Caching Networks

Georgios S. Paschos, Apostolos Destounis, George Iosifidis

We consider a wireless device-to-device (D2D) cooperative network where memory-endowed nodes store and exchange content. Each node generates random file requests following an unkno…

cs.IT2019

Complexity of URLLC Scheduling and Efficient Approximation Schemes

Apostolos Destounis, Georgios S. Paschos

In this paper we address the problem of joint admission control and resource scheduling for \emph{Ultra Reliable Low Latency Communications} (URLLC). We examine two models: (i) the…

cs.NI20192 cited

Learning to Cache With No Regrets

Georgios S. Paschos, Apostolos Destounis, Luigi Vigneri +1

This paper introduces a novel caching analysis that, contrary to prior work, makes no modeling assumptions for the file request sequence. We cast the caching problem in the framewo…