Delay-tolerant constrained online convex optimization

Patent metadata

Field	Value
Publication number	US-12490203-B2
Application number	US-202118006794-A
Country	US
Kind code	B2
Filing date	Aug 3, 2021
Priority date	Aug 14, 2020
Publication date	Dec 2, 2025
Grant date	Dec 2, 2025

Abstract

A method and network node configured to perform wireless network virtualization to allocate resources of an infrastructure provider (InP) among a plurality of service providers (SPs) are provided. According to one aspect, a method in a network node includes, in each of a plurality of successive time slots in a time interval, T: receiving precoding feedback information from each SP, allocating a virtual transmit power to each cell served by an SP based at least in part on the received precoding feedback information and determining a precoding matrix for each SP. The method also includes minimizing a loss function based at least in part on the received precoding feedback information received in multiple previous time slots.

First claim

What is claimed is:

1 . A method in a network node for wireless network virtualization to allocate resources of an infrastructure provider, InP, among a plurality of service providers, SPs, each SP serving at least one cell, each SP further serving a respective set of wireless devices, WDs, the method comprising:
in each of a plurality of successive time slots in a time interval, T:
receiving precoding feedback information from each SP of the plurality of SPs, the precoding feedback information from an SP including a precoding demand from the SP, the feedback information being based at least in part on RF channels between one or more base stations of the SP and corresponding WDs;
allocating a virtual transmit power to each cell served by an SP, each allocation of a virtual transmit power allocated to a cell of an SP being based at least in part on the received precoding feedback information from the plurality of SPs and at least one constraint on interference; and
determining a precoding matrix for each SP of the plurality of SPs to meet each of the plurality of received precoding demands subject to the at least one constraint, the determining including:
minimizing a loss function based at least in part on the received precoding feedback information received in multiple previous time slots.

2 . The method of claim 1 , wherein minimizing a loss function includes finding a set of precoding matrices, one for each SP of the plurality of SPs, that minimizes a function of a gradient of the precoding feedback information.

3 . The method of claim 2 , wherein the loss function includes a virtual queue sequence used as a backlog queue of long-term constraint violations where an upper bound on the virtual queue is transformed into an upper bound on the long-term constraint violation.

4 . The method of claim 2 , wherein the loss function includes:

2
⁢
Re
⁢

{

tr
⁢

{

[

∇

V

t
-
τ

*

f

t
-
τ

(

V

t
-
τ

)

]

H

⁢

(

V
-

V

t
-
τ

)

}

}

+

α
⁢



V
-

V

t
-
τ



F
2

+

[

Q

t
-
1

+

g

t
-
τ
-
1

(

V

t
-
1

)

]

T

⁢

g

t
-
τ

(
V
)

+

η
⁢



V
-

V

t
-
1



F
2

where

∇

V

t
-
τ

*

f

t
-
τ

(

V

t
-
τ

)

is the feedback from a plurality of SPs at time t−τ, V t−τ is the precoding matrix for a plurality of SPs, Q t−1 is the virtual queue sequence value at time t−1, g t−τ−1 (V t−1 ) is a constraint at time

Assignees

• Ericsson Telefon Ab L M

Inventors

• Wang Juncheng
• Liang Ben
• Dong Min
• Boudreau Gary
• Abou-Zeid Hatem

Classifications

• H04W52/24

  using SIR [Signal to Interference Ratio] or other wireless path parameters · CPC title

• H04B7/024

  Co-operative use of antennas of several sites, e.g. in co-ordinated multipoint or co-operative multiple-input multiple-output [MIMO] systems · CPC title

• H04B7/0456

  Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting · CPC title

• H04B17/104

  of other parameters, e.g. DC offset, delay or propagation times · CPC title

• H04W52/243

  taking into account interferences · CPC title