On the Joint Content Caching and User Association Problem in Small Cell Networks

Karaliopoulos, Merkourios; Chatzieleftheriou, Livia Elena; Darzanos, George; Koutsopoulos, Iordanis

doi:10.1109/iccworkshops49005.2020.9145338

Cited by 7 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The JCA problem (P2) is NP-hard [8]. In order to solve it, we apply the low-complexity heuristic approach described in [6]. Specifically, we initially assume that all users within range of an SBS are associated with that SBS (with minimum distance and random selection as tie-breakers in the case of overlapping cells and equidistant SBSs, respectively).…”

Section: B Heuristic Iterative Jca Algorithmmentioning

confidence: 99%

“…In this section, we compare the performance of the proposed dynamic JCA scheme to that of its static counterpart [6], in terms of the achieved average cache hit rate, via numerical simulations. We also consider a heuristic decoupled caching/user association design, where the users are sequentially parsed and each user is associated with the cell among the candidates that incurs the minimum association cost, provided that the cell capacity constraint is met, until all users have been associated with a cell.…”

Section: Numerical Simulationsmentioning

confidence: 99%

“…In [5], the authors consider user clustering based on the individual content demand profiles of the users and solve the caching problem via reinforcement learning. In [6], a heuristic iterative algorithm that alternates between solving a 0-1 Knapsack problem (KP) for caching and a generalized assignment problem (GAP) for user association is presented. Another decoupling approach based on the Generalized Benders decomposition is derived in [7], taking into account as well the leasing costs for the content providers.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Joint Dynamic Wireless Edge Caching and User Association: A Stochastic Optimization Approach

Ntougias

Psomas

Demarchou

et al. 2022

2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)

View full text Add to dashboard Cite

Wireless edge caching alleviates the capacity burden imposed on the backhaul of dense cellular networks while reducing the user-perceived latency. In this paper, we consider the joint optimization of caching and user association (JCA) policies with respect to the total cache hit ratio, taking into account the limited radio and storage resources, the service requirements, and the quality of the wireless channels. In order to effectively capture the dynamic nature and randomness of the system under study, which is reflected respectively in the mobility and content preferences of the users as well as in the time-variance of the wireless channels due to fading, we use a stochastic optimization framework based on Lyapunov optimization. After formulating the corresponding dynamic JCA problem, we solve this NPhard task by applying a low-complexity heuristic algorithm that alternates at each timeslot between the caching and user association problems. Numerical simulations highlight the performance gains of the proposed dynamic JCA scheme over its static and decoupled caching/user association counterparts and shed light on the effect of various parameters on the performance.

show abstract

Section: B Heuristic Iterative Jca Algorithmmentioning

confidence: 99%

Section: Numerical Simulationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Joint Dynamic Wireless Edge Caching and User Association: A Stochastic Optimization Approach

Ntougias

Psomas

Demarchou

et al. 2022

2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)

View full text Add to dashboard Cite

show abstract

“…The work [9] additionally considers transmission power, quantifying limits of the achievable gains. In [10] and [11] UA is seen jointly with content caching for cache hit ratio maximization, and low-complexity practical schemes are presented. The fast-converging scheme of [10] iterates between UA and content caching, while in [11] users are initially clustered based on their content preferences, and then clusters are assigned to APs.…”

Section: Related Work User Association (Ua)mentioning

confidence: 99%

“…The first equality is basically the definition of regret. From (6) π * [k] minimizes costs for t ∈ W k , and from (10) the objective V (•) is at least equal to costs. The first inequality comes from the observation that the penalty paid by the optimal benchmark π * [k] can't be greater than that paid by the online algorithm that takes decisions under lack of information.…”

mentioning

confidence: 99%

Blind Optimal User Association in Small-Cell Networks

Chatzieleftheriou¹,

Destounis²,

Paschos³

et al. 2021

Preprint

View full text Add to dashboard Cite

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 broad family of α-fair cost functions that express various objectives in load assignment in the wireless downlink, such as total load or total delay minimization. Finding an optimal user association policy in dynamic environments is challenging because traffic demand fluctuations over time are non-stationary and difficult to characterize statistically, which obstructs the computation of costefficient associations. Assuming arbitrary traffic patterns over time, we formulate the problem of online learning of optimal user association policies using the Online Convex Optimization (OCO) framework. We introduce a periodic benchmark for OCO problems that generalizes state-of-the-art benchmarks. We exploit inherent properties of the online user association problem and propose PerOnE, a simple online learning scheme that dynamically adapts the association policy to arbitrary traffic demand variations. We compare PerOnE against our periodic benchmark and prove that it enjoys the no-regret property, with additional sublinear dependence of the network size. To the best of our knowledge, this is the first work that introduces a periodic benchmark for OCO problems and a no-regret algorithm for the online user association problem. Our theoretical findings are validated through results on a real-trace dataset.

show abstract

A hybrid Bi-level management framework for caching and communication in Edge-AI enabled IoT

Sharif,

Yaghmaee Moghaddam,

Hosseini Seno

2024

Journal of Network and Computer Applications

View full text Add to dashboard Cite

On the Joint Content Caching and User Association Problem in Small Cell Networks

Cited by 7 publications

References 9 publications

Joint Dynamic Wireless Edge Caching and User Association: A Stochastic Optimization Approach

Joint Dynamic Wireless Edge Caching and User Association: A Stochastic Optimization Approach

Blind Optimal User Association in Small-Cell Networks

A hybrid Bi-level management framework for caching and communication in Edge-AI enabled IoT

Contact Info

Product

Resources

About