On the optimality of max–min fairness in resource allocation

Coluccia, Angelo; D’Alconzo, Alessandro; Ricciato, Fabio

doi:10.1007/s12243-011-0246-y

Cited by 23 publications

(20 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We initially apply here RR scheduling to divide the resources equally among RUEs so that we can observe throughput gap between backhaul and access. In the case that the backhaul presents a capacity bottleneck (R r < R a ), the initially allocated resources using RR scheduling are redistributed among the RUEs using max-min fair scheduling which priorities RUEs with lower throughputs [43]. Otherwise, if backhaul is not a bottleneck (R r ≥ R a ), the resource allocation for the RUEs from RR scheduling is retained.…”

Section: Scheduling and Throughput Formulamentioning

confidence: 99%

Coordinated multi-point transmission for relaxation of self-backhauling bottlenecks in heterogeneous networks

Haile

Mutafungwa

Hämäläinen

2015

J Wireless Com Network

View full text Add to dashboard Cite

The heterogeneous deployment of high-power macro cells and low-power nodes (LPNs) is now widely acknowledged as an essential requirement towards meeting the continued demand for mobile data capacity. The selection of the optimum backhaul solution for the LPNs obliges operators to consider not only the capacity of the backhaul but also other key factors so as to fully leverage the benefits provided by LPNs: the cost of the backhauling may limit the density of LPN deployments and the backhaul configuration requirements impact on the flexibility of LPN deployment. To that end, self-backhauling of LPNs via the existing macro radio access network (RAN) provides an attractive solution, particularly for deployment scenarios that are very cost-sensitive and/or require high flexibility. However, use of self-backhauling usually makes backhaul as a bottleneck due to the a) limited bandwidth allocated for legacy macro RAN, b) the need to share resources with macro user equipment (UE), and c) the high-intercell interference particularly in the macro cell edge. In this paper, we provide an overview of self-backhauled LPNs and investigate possible performance enhancements through the use of coordinated multi-point (CoMP) transmission to relax the downlink backhaul capacity bottleneck for self-backhauled LPNs. To that end, we carry out analytical studies for a practical limited-feedback CoMP technique and numerically verify the derived capacity outage expressions. Furthermore, we implement a simulation study for an exemplary heterogeneous network deployment in a realistic radio propagation environment. The results of the studies demonstrate that significant spectral efficiency and throughput gains for the LPN backhaul are achievable through the use of selected CoMP technique under realizable feedback overhead, even under feedback bit error. The achieved relaxation in the backhaul bottleneck is observed providing improved performance for the UEs served by the LPNs. Furthermore, more resources will be available for macro UEs leading to overall performance gains compared to the case without CoMP.

show abstract

Section: Scheduling and Throughput Formulamentioning

confidence: 99%

Coordinated multi-point transmission for relaxation of self-backhauling bottlenecks in heterogeneous networks

Haile

Mutafungwa

Hämäläinen

2015

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…The effect that different types of objective functions in NUM-based resource management have on fairness has been questioned in recent research. Collucia et al [2] identify and study a number of objective function families that can be used to achieve max-min fairness.…”

Section: Termmentioning

confidence: 99%

“…However, its computational complexity deems it unfit for real-time operation and precipitates the need for heuristic algorithms that follow the same intra-class fairness, interclass differentiation policy. URM maximises the total per-client utility, a logarithmic function of the allocated throughput, different for every class and mathematically bound to follow the defined policy and provide Max-Min fairness [2]. The heuristics however, provide sub-optimal solutions that are not guaranteed to perfectly adhere to the policy.…”

Section: Introductionmentioning

confidence: 99%

SuperBS: A methodology for resource management in heterogeneous wireless networks

Tsompanidis

Zahran

Sreenan

2013

2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC)

View full text Add to dashboard Cite

Abstract-Resource management in heterogeneous wireless networks has been approached from various angles by the research community. The complexity of the network and the heterogeneity of clients make the conclusive comparison of the various resource allocations challenging. This work introduces superBS, an approach defining a theoretical optimal resource allocation that adheres to the required resource management policies and can be used as a reference for the performance of considered algorithms, mitigating the heterogeneity of the system. Two applications that leverage superBS are developed, an implementation of a heuristic resource management algorithm, and the enhancement of a popular fairness metric with support for clients of different classes and traffic demands. Simulations demonstrate the performance of superBS and the proposed algorithms.

show abstract

“…The proposed functional form also provides a network-wide tendency to max-min fairness among clients of the same class [6].…”

Section: Class-based Utility Functionsmentioning

confidence: 99%

Towards utility-based resource management in heterogeneous wireless networks

Tsompanidis

Zahran

Sreenan

2012

Proceedings of the Seventh ACM International Workshop on Mobility in the Evolving Internet Architecture

View full text Add to dashboard Cite

This work considers the network selection and the bandwidth assignment problems in the context of heterogeneous wireless networks operated by a single service provider. The current commercial and research practices on resource management are presented, and a novel utility-based approach supporting multiple client classes is introduced. A bandwidth sharing policy and a "controlled unfairness" scheme is achieved by combining distinct priority classes with logarithmic utility functions that variably grade the bandwidth allocated to clients.To demonstrate the possibilities of this approach an optimisation problem is formulated and its solution utilityoptimally allocates bandwidth and distributes clients to base stations, modelling a network-side resource management system. The centralised operation allows for network-wide provision of comparable service levels to clients of the same class. The optimal solution is compared to several heuristic methods. Simulations showcase the behaviour of the system, which successfully differentiates clients and utilises all available resources.

show abstract

On the optimality of max–min fairness in resource allocation

Cited by 23 publications

References 19 publications

Coordinated multi-point transmission for relaxation of self-backhauling bottlenecks in heterogeneous networks

Coordinated multi-point transmission for relaxation of self-backhauling bottlenecks in heterogeneous networks

SuperBS: A methodology for resource management in heterogeneous wireless networks

Towards utility-based resource management in heterogeneous wireless networks

Contact Info

Product

Resources

About