to any UE is available centrally and can be transmitted through any TRP. As an optimization target, we aim to maximize aggregate achieved (downlink) throughput across all UEs. The first step in optimization is to define, for each combination of TRP and UE the single unique path (via a repeater or not) that is optimal for performance. It is intui- tive to conclude that this would be the only path to be used between that specific UE and that specific TRP for uplink and downlink communication-given that the relationship between repeater and TRP is N:1 (assumption 7). The second step is to define the optimization target. We assume the goal to be defined as optimizing to a utility function, which is often defined as the aggregate throughput of the sys- tem, across multiple base stations and {user, RF channel} allocations, for each instance in Chapter 7 Wireless scheduling and Quality of Service optimization techniques 257 time (e.g., slot or frame). This means optimization to maximize the sum rate across all allo- cated users: UE=max max(R)==___Rue where we assume (for each UE as we defined in the first step) a known achievable rate R to that UE defined by its unique established path from the TRP to the UE. The third step is to define the limitations in the system. Given assumption 6 (arguably, a bit over an over-simplification), we take it that as soon as a single TRP UE allocation is established, during that slot duration, that TRP can not communicate to any other UE. Enhanced versions of the algorithm can be expanded to scale to multiple UE allocations. As we have now defined the problem and the limitations, we can think about potential solutions. Greedy allocations schemes are often thought of first: Out of all potential allocations between TRP and UE (across all repeater path options), find the one that gives to the first (to be allocated) UE the maximum possible throughput. Assign time/frequency resources to this UE and remove the TRP and repeater path to this UE from further consideration (each allocation can o