IEEE INFOCOM 2021 - IEEE Conference on Computer Communications 2021
DOI: 10.1109/infocom42981.2021.9488867
|View full text |Cite
|
Sign up to set email alerts
|

Blind Optimal User Association in Small-Cell Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…In [23], a proposal was presented to alter user association in overlapped ultra-dense networks. Furthermore, [24] learned user association policies to direct traffic from different locations to transmitters, minimizing total delay and load on the wireless downlink in the presence of unknown dynamic traffic demand. Network slicing is a key innovation to meet diverse needs.…”
Section: B Traffic Steering In Traditional Ran Architecturementioning
confidence: 99%
“…In [23], a proposal was presented to alter user association in overlapped ultra-dense networks. Furthermore, [24] learned user association policies to direct traffic from different locations to transmitters, minimizing total delay and load on the wireless downlink in the presence of unknown dynamic traffic demand. Network slicing is a key innovation to meet diverse needs.…”
Section: B Traffic Steering In Traditional Ran Architecturementioning
confidence: 99%
“…Moreover, in order to avoid the projection step of ( 2), the regularization function can be used by exploiting the geometry of the feasible space. For example, the work [10] aimed to find solutions that lie in sets that are the combinations of unit simplices. A possible regularization function R(•) for each simplex in the feasible space is the Gibbs-Shannon entropy.…”
Section: B Online Mirror Descent 1) Online Mirror Descent Algorithmmentioning
confidence: 99%
“…The work [10] introduced a novel periodic benchmark, which is particularly useful for performance comparison in the case of conjectured periodicity in λ(t). The benchmark is called Optimal Periodic Static (OPS).…”
Section: Metrics and Benchmarksmentioning
confidence: 99%
See 1 more Smart Citation