Continuity of Optimal Values and Solutions for Control of Markov Chains with Constraints
SIAM Journal on Control and Optimization
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Fixed point analysis of single cell IEEE 802.11e WLANs: uniqueness and multistability
IEEE/ACM Transactions on Networking (TON)
Alpha-Fair Resource Allocation under Incomplete Information and Presence of a Jammer
NET-COOP '09 Proceedings of the 3rd Euro-NF Conference on Network Control and Optimization
An axiomatic theory of fairness in network resource allocation
INFOCOM'10 Proceedings of the 29th conference on Information communications
Multiscale fairness and its application to resource allocation in wireless networks
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
| Hi-index | 0.24 |
Fair resource allocation is usually studied in a static context, in which a fixed amount of resources is to be shared. In dynamic resource allocation one usually tries to assign resources instantaneously so that the average share of each user is split fairly. The exact definition of the average share may depend on the application, as different applications may require averaging over different time periods or time scales. Our main contribution is to introduce new refined definitions of fairness that take into account the time over which one averages the performance measures. We examine how the constraints on the averaging durations impact the amount of resources that each user gets. We also address how the spatial component, which arises due to mobility of users, influences resource sharing under different fairness criteria. We demonstrate these new concepts via example applications.