nach oben

Annals of Telecommunications

Erschienen in:

01.02.2012

On the optimality of max–min fairness in resource allocation

verfasst von: Angelo Coluccia, Alessandro D’Alconzo, Fabio Ricciato

Erschienen in: Annals of Telecommunications | Ausgabe 1-2/2012

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

In this work, a basic resource allocation (RA) problem is considered, where a fixed capacity must be shared among a set of users. The RA task can be formulated as an optimization problem, with a set of simple constraints and an objective function to be minimized. A fundamental relation between the RA optimization problem and the notion of max–min fairness is established. A sufficient condition on the objective function that ensures the optimal solution is max–min fairness is provided. Notably, some important objective functions like least squares and maximum entropy fall in this case. Finally, an application of max–min fairness for overload protection in 3G networks is considered.

Vorheriger Artikel Toward automatic GIS–video initial registration

Nächster Artikel Performances of chaos-coded modulation concatenated with Alamouti’s space–time block code

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Nur mit Berechtigung zugänglich

Several other iterative or exact algorithms exist, see e.g., [5, 11, 13, 17, 18].

This definition is consistent because due to constraint (2) it follows that \(0<\frac{c_{\!j}}{C} <1\) and \(\sum_j \frac{c_{\!j}}{C} =1\).

Obviously, from Theorem 2 we know that f _PF and f _ME yields the same max–min fair allocation as f _LS.

Keshav S (1997) An engineering approach to computer networking. Addison-Wesley, Reading, pp 215–217

Bertsekas D, Gallager R (1992) Data networks. Prentice-Hall, Englewood CliffsMATH

Gafni EM, Bertsekas DP (1984) Dynamic control of session input rates in communication networks. IEEE Trans Automat Contr AC-29(11):1009–1016MathSciNetCrossRef

Salles RM, Barria JA (2008) Lexicographic maximin optimisation for fair bandwidth allocation in computer networks. Eur J Oper Res 185:778–794MATHCrossRef

Uchida M (2007) Information theoretic aspects of fairness criteria in network resource allocation problems. In: GameComm ’07, Nantes, France, 22 Oct 2007

Le Baudec, J-Y (2007) Rate adaptation, congestion control and fairness: a tutorial. Ecole Polytechnique Fédérale de Lausanne (EPFL)

Kelly F (1997) Charging and rate control for elastic traffic. Eur Trans Telecommun 8:33–37CrossRef

Mo J, Walrand J (2000) Fair end-to-end window-based congestion control. IEEE/ACM Trans Netw 8(8): 556–567CrossRef

Dianati M, Shen X, Naik S (2005) A new fairness index for radio resource allocation in wireless networks. Proc. IEEE wireless communications and networking conference (WCNC 2005), vol 2. IEEE Commun 772 Society/WCNC, pp 712–717

10.

Malla A, El-Kadi M, Olariu S, Todorova P (2003) A fair resource allocation protocol for multimedia wireless networks. IEEE Trans Parallel Distrib Syst 14(1):63–71CrossRef

11.

Aoun B, Boutaba R (2006) Max–min fair capacity of wireless mesh networks. In: IEEE Int’l Conf. on mobile ad hoc and sensor systems (MASS)

12.

Boche H, Wiczanowski M, Stanczak S (2005) Unifying view on min–max fairness and utility optimization in cellular networks. Proc. IEEE wireless communications and networking conference (WCNC 2005), vol 3. IEEE Commun Society/WCNC, pp 1280–1285

13.

Pérez D, Rodríguez Fonollosa J (2005) Practical algorithms for a family of waterfilling solutions. IEEE Trans Signal Process 53(2):686–695MathSciNetCrossRef

14.

Marsic I (2011) Computer networks: performance and QoS. Available at: www.caip.rutgers.edu/simmarsic/books/QoS/book-QoS_marsic.pdf

15.

The ATM Forum Technical Committee (1996) Traffic management specification. Technical report

16.

Cao Z, Zegura E W (1999) Utility max–min: an application-oriented bandwidth allocation scheme In: IEEE INFOCOM ’99, pp 793–801

17.

Radunović B, Le Boudec J-Y (2007) A unified framework for max–min and min–max fairness With applications. IEEE/ACM Trans Netw 15(5):1073–1083CrossRef

18.

Cioffi JM (2011) EE379C advanced digital communications. Available at: http://www.stanford.edu/class/ee379c

19.

Johansson M, Sternad M (2005) Resource allocation under uncertainty using the maximum entropy principle. IEEE Trans Inf Theory 51(12):4103–4117MathSciNetCrossRef

20.

Berger A, Della Pietra S, Della Pietra V (1996) A maximum entropy approach to natural language processing. Comput Linguist 22:39–68

21.

Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, CambridgeMATH

22.

Massoulié L, Proutière A, Virtamo J (2006) A queueing analysis of max–min fairness, proportional fairness and balanced fairness. Queueing Syst: Theory and Applications 53(1–2)

23.

Ladiwalaa S, Ramaswamya R, Wolf T (2009) Transparent TCP acceleration. Comput Commun 32(4):691–702CrossRef

24.

Huang J, Subramanian VG, Agrawal R, Berry RA (2009) Downlink scheduling and resource allocation for OFDM systems. IEEE Trans Wirel Commun 8(1):39–71CrossRef

25.

Subramanian VG, Berry RA, Agrawal R (2010) Joint scheduling and resource allocation in CDMA systems. IEEE Trans Inf Theory 56(5):2416–2432MathSciNetCrossRef

26.

Madan R, Boyd SP, Lall S (2010) Fast algorithms for resource allocation in wireless cellular networks. IEEE/ACM Trans Netw 18(3):973–984CrossRef

Titel: On the optimality of max–min fairness in resource allocation
verfasst von: Angelo Coluccia
Alessandro D’Alconzo
Fabio Ricciato
Publikationsdatum: 01.02.2012
Verlag: Springer-Verlag
Erschienen in: Annals of Telecommunications / Ausgabe 1-2/2012
Print ISSN: 0003-4347
Elektronische ISSN: 1958-9395
DOI: https://doi.org/10.1007/s12243-011-0246-y

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 1-2/2012

Design and implementation for integrated services orchestration bus using SCA over heterogeneous networks

Performances of chaos-coded modulation concatenated with Alamouti’s space–time block code

Toward automatic GIS–video initial registration

An analytical model for jitter in IP networks

Spatio-temporal channel characterization: theoretical framework and applications in MIMO system design

Satellite image compression by concurrent representations of wavelet blocks