Abstract
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.
Chapter PDF
Similar content being viewed by others
References
Mo, J., Walrand, J.: Fair End-to-end Window-based Congestion Control. IEEE/ACM Transactions on Networking 8(5), 556–567 (2000)
Lan, T., Kao, D., Chiang, M., Sabharwal, A.: An Axiomatic Theory of Fairness for Resource Allocation. In: Proc. of IEEE INFOCOM 2010 (March 2010)
Altman, E., Avrachenkov, K., Prabhu, B.J.: Fairness in MIMD Congestion Control Algorithms. In: Proc. of IEEE INFOCOM 2005, Miami, USA (March 2005)
Altman, E., Avrachenkov, K., Garnaev, A.: Generalized Alpha-Fair Resource Allocation in Wireless Networks. In: Proc. of 47th IEEE Conference on Decision and Control, Cancun, Mexico, (December 9-11, 2008)
Altman, E., Avrachenkov, K., Garnaev, A.: Alpha-Fair Resource Allocation under Incomplete Information and Presence of a Jammer. In: Núñez-Queija, R., Resing, J. (eds.) NET-COOP 2009. LNCS, vol. 5894, pp. 219–233. Springer, Heidelberg (2009)
Bredel, M., Fidler, M.: Understanding Fairness and its Impact on Quality of Service in IEEE 802.11, Arxive (2008)
Ramaiyan, V., Kumar, A., Altman, E.: Fixed Point Analysis of Single Cell IEEE 802.11e WLANs: Uniqueness and Multistability. IEEE/ACM Transactions on Networking 16(5), 1080–1093 (2008)
Kelly, F.P., Maulloo, A.K., Tan, D.K.H.: Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49(3), 237–252 (1998)
Tidball, M., Lombardi, A., Pourtallier, O., Altman, E.: Continuity of optimal values and solutions for control of Markov chains with constraints. SIAM J. Control and Optimization 38(4), 1204–1222 (2000)
Filar, J., Krieger, H.A., Syed, Z.: Cesaro limits of analytically perturbed stochastic matrices. Lin. Alg. Appl. 353, 227–243 (2002)
Altman, E., Avrachenkov, K., Ramanath, S.: Multiscale Fairness and its Application to Dynamic Resource Allocation in Wireless Networks, INRIA research report number RR-7783, http://hal.inria.fr/inria-00515430/en/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 IFIP International Federation for Information Processing
About this paper
Cite this paper
Altman, E., Avrachenkov, K., Ramanath, S. (2011). Multiscale Fairness and Its Application to Resource Allocation in Wireless Networks. In: Domingo-Pascual, J., Manzoni, P., Palazzo, S., Pont, A., Scoglio, C. (eds) NETWORKING 2011. NETWORKING 2011. Lecture Notes in Computer Science, vol 6641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20798-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-20798-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20797-6
Online ISBN: 978-3-642-20798-3
eBook Packages: Computer ScienceComputer Science (R0)