Skip to main content
Erschienen in: Mobile Networks and Applications 2/2017

17.05.2016

UFalloc: Towards Utility Max-min Fairness of Bandwidth Allocation for Applications in Datacenter Networks

verfasst von: Fei Xu, Wangying Ye, Yuhan Liu, Wei Zhang

Erschienen in: Mobile Networks and Applications | Ausgabe 2/2017

Einloggen

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

search-config
loading …

Abstract

Providing fair bandwidth allocation for applications is becoming increasingly compelling in cloud datacenters, as different applications compete for the shared datacenter network resources. While existing solutions mainly provide bandwidth guarantees for virtual machines (VMs) or tenants with the aim of achieving the VM-level or tenant-level fairness of bandwidth allocation, scant attention has been paid to providing bandwidth guarantees for applications to achieve the fairness of application performance (utility). In this paper, we introduce a rigorous definition of application-level utility max-min fairness, which guides us to develop a non-linear model to investigate the relationship between the utility fairness and bandwidth allocation for applications. Based on such a model, we further arbitrate the intrinsic tradeoff between the network bandwidth utilization and utility fairness of application bandwidth allocation, using a tunable fairness relaxation factor. To improve the bandwidth utilization while maintaining the strict utility fairness of bandwidth allocation, we design UFalloc, an application-level Utility max-min Fair bandwidth allocation strategy in datacenter networks. With extensive experiments using OpenFlow in Mininet virtual network environment, we demonstrate that UFalloc can achieve high utilization of network bandwidth while maintaining the utility max-min fair share of bandwidth allocation with a certain degree of fairness relaxation, yet with an acceptable computational overhead.

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

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!

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!

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!

Weitere Produktempfehlungen anzeigen
Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
Zurück zum Zitat Roy A, Zeng H, Bagga J, Porter G, Snoeren AC (2015) Inside the social network’s (datacenter) network. In: Proceedings of SIGCOMM, pp 123–137 Roy A, Zeng H, Bagga J, Porter G, Snoeren AC (2015) Inside the social network’s (datacenter) network. In: Proceedings of SIGCOMM, pp 123–137
2.
Zurück zum Zitat Yi X, Liu F, Liu J, Jin H (2014) Building a network highway for big data: architecture and challenges. IEEE Network Magazine 28(4):5–13CrossRef Yi X, Liu F, Liu J, Jin H (2014) Building a network highway for big data: architecture and challenges. IEEE Network Magazine 28(4):5–13CrossRef
3.
Zurück zum Zitat Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107–113CrossRef Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107–113CrossRef
4.
Zurück zum Zitat Wang H, Chen L, Chen K, Li Z, Zhang Y, Guan H, Qi Z, Li D, Geng Y (2015) Flowprophet: generic and accurate traffic prediction for data-parallel cluster computing. In: Prof. of ICDCS, pp 349–358 Wang H, Chen L, Chen K, Li Z, Zhang Y, Guan H, Qi Z, Li D, Geng Y (2015) Flowprophet: generic and accurate traffic prediction for data-parallel cluster computing. In: Prof. of ICDCS, pp 349–358
5.
Zurück zum Zitat Xu F, Liu F, Jin H, Vasilakos AV (2014) Managing performance overhead of virtual machines in cloud computing: a survey, state of art and future directions. Proc IEEE 102(1):11–31CrossRef Xu F, Liu F, Jin H, Vasilakos AV (2014) Managing performance overhead of virtual machines in cloud computing: a survey, state of art and future directions. Proc IEEE 102(1):11–31CrossRef
6.
Zurück zum Zitat Bertsekas DP, Gallager RG (1992) Data network, 2nd edn. Prentice-Hall, LondonMATH Bertsekas DP, Gallager RG (1992) Data network, 2nd edn. Prentice-Hall, LondonMATH
7.
Zurück zum Zitat Kelly FP, Maulloo AK, Tan DKH (1998) Rate control for communication networks: shadow price, proportional fairness and stability. J Oper Res Soc 49(3):237–252CrossRefMATH Kelly FP, Maulloo AK, Tan DKH (1998) Rate control for communication networks: shadow price, proportional fairness and stability. J Oper Res Soc 49(3):237–252CrossRefMATH
8.
Zurück zum Zitat Guo J, Liu F, Tang H, Lian Y, Jin H, Lui J (2013) Falloc: fair network bandwidth allocation in IaaS datacenters via a bargaining game approach. In: Proceedings of ICNP, pp 1–10 Guo J, Liu F, Tang H, Lian Y, Jin H, Lui J (2013) Falloc: fair network bandwidth allocation in IaaS datacenters via a bargaining game approach. In: Proceedings of ICNP, pp 1–10
9.
Zurück zum Zitat Yu L, Cai Z (2016) Dynamic scaling of virtual clusters with bandwidth guarantee in cloud data centers. In: Proceedings of infocom Yu L, Cai Z (2016) Dynamic scaling of virtual clusters with bandwidth guarantee in cloud data centers. In: Proceedings of infocom
10.
Zurück zum Zitat Popa L, Kumar G, Chowdhury M, Krishnamurthy A, Ratnasamy S, Stoica I (2012) Faircloud: Sharing the Network in Cloud Computing. In: Proceedings of SIGCOMM, pp 187–198 Popa L, Kumar G, Chowdhury M, Krishnamurthy A, Ratnasamy S, Stoica I (2012) Faircloud: Sharing the Network in Cloud Computing. In: Proceedings of SIGCOMM, pp 187–198
11.
Zurück zum Zitat Lam T, Radhakrishnan S, Vahdat A, Varghese G (2010) Netshare: virtualizing data center networks across services. Technical Report CS2010-0957, Department of Computer Science and Engineering, University of California, San Diego Lam T, Radhakrishnan S, Vahdat A, Varghese G (2010) Netshare: virtualizing data center networks across services. Technical Report CS2010-0957, Department of Computer Science and Engineering, University of California, San Diego
12.
Zurück zum Zitat Xie D, Ding N, Hu YC, Kompella R (2012) The only constant is change: incorporating time-varying network reservations in data centers. ACM SIGCOMM Computer Communication Review 42(4):199–210CrossRef Xie D, Ding N, Hu YC, Kompella R (2012) The only constant is change: incorporating time-varying network reservations in data centers. ACM SIGCOMM Computer Communication Review 42(4):199–210CrossRef
13.
Zurück zum Zitat Wang XH, Han DF, Sun FY (1990) Point estimates on deformation newton’s iterations. Mathematica Numerica Sinica 1(2):145–156MathSciNetMATH Wang XH, Han DF, Sun FY (1990) Point estimates on deformation newton’s iterations. Mathematica Numerica Sinica 1(2):145–156MathSciNetMATH
14.
Zurück zum Zitat Ye W, Xu F, Zhang W (2015) Achieving application-level utility max-min fairness of bandwidth allocation in datacenter networks. In: Proceedings of collaboratecom Ye W, Xu F, Zhang W (2015) Achieving application-level utility max-min fairness of bandwidth allocation in datacenter networks. In: Proceedings of collaboratecom
15.
Zurück zum Zitat Jalaparti V, Bodik P, Menache I, Rao S, Makarychev K, Caesar M (2015) Network-aware scheduling for data-parallel jobs: plan when you can. In: Proceedings of SIGCOMM, pp 407–420 Jalaparti V, Bodik P, Menache I, Rao S, Makarychev K, Caesar M (2015) Network-aware scheduling for data-parallel jobs: plan when you can. In: Proceedings of SIGCOMM, pp 407–420
16.
Zurück zum Zitat Shenker S (1995) Fundamental design issues for the future internet. IEEE J Sel Areas Commun 13(7):1176–1187CrossRef Shenker S (1995) Fundamental design issues for the future internet. IEEE J Sel Areas Commun 13(7):1176–1187CrossRef
17.
Zurück zum Zitat Cao Z, Zegura E (1999) Utility max-min: an application-oriented allocation scheme. In: Proceedings of infocom, pp 793–801 Cao Z, Zegura E (1999) Utility max-min: an application-oriented allocation scheme. In: Proceedings of infocom, pp 793–801
18.
Zurück zum Zitat Al-Fares M, Loukissas A, Vahdat A (2008) A scalable, commodity data center network architecture. ACM SIGCOMM Computer Communication Review 38(4):63–74CrossRef Al-Fares M, Loukissas A, Vahdat A (2008) A scalable, commodity data center network architecture. ACM SIGCOMM Computer Communication Review 38(4):63–74CrossRef
19.
Zurück zum Zitat Mo J, Walrand J (2000) Fair end-to-end window-based congestion control. IEEE/ACM Trans Networking 8(5):556–567CrossRef Mo J, Walrand J (2000) Fair end-to-end window-based congestion control. IEEE/ACM Trans Networking 8(5):556–567CrossRef
20.
Zurück zum Zitat Kuhn HW (2014) Nonlinear programming: a historical view. Traces and Emergence of Nonlinear Programming:393– 414 Kuhn HW (2014) Nonlinear programming: a historical view. Traces and Emergence of Nonlinear Programming:393– 414
21.
22.
Zurück zum Zitat Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press
23.
Zurück zum Zitat Boţ R, Kassay G, Wanka G (2005) Strong duality for generalized convex optimization problems. J Optim Theory Appl 127(1):45–70MathSciNetCrossRefMATH Boţ R, Kassay G, Wanka G (2005) Strong duality for generalized convex optimization problems. J Optim Theory Appl 127(1):45–70MathSciNetCrossRefMATH
24.
25.
Zurück zum Zitat Rosen JB (1960) The gradient projection method for nonlinear programming. Part i. Linear constraints. J Soc Ind Appl Math 8(1):181–217CrossRefMATH Rosen JB (1960) The gradient projection method for nonlinear programming. Part i. Linear constraints. J Soc Ind Appl Math 8(1):181–217CrossRefMATH
26.
Zurück zum Zitat Yaïche H, Mazumdar RR, Rosenberg C (2000) A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Trans Networking 8(5):667–678CrossRef Yaïche H, Mazumdar RR, Rosenberg C (2000) A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Trans Networking 8(5):667–678CrossRef
29.
Zurück zum Zitat Kelly F (2003) Fairness and stability of end-to-end congestion control*. Eur J Control 9(2):159–176CrossRefMATH Kelly F (2003) Fairness and stability of end-to-end congestion control*. Eur J Control 9(2):159–176CrossRefMATH
30.
Zurück zum Zitat Wang W, Palaniswami M, Low S (2006) Application-Oriented Flow control fundamentals algorithms and fairness. IEEE/ACM Trans Networking 14(6):1282–1291CrossRef Wang W, Palaniswami M, Low S (2006) Application-Oriented Flow control fundamentals algorithms and fairness. IEEE/ACM Trans Networking 14(6):1282–1291CrossRef
31.
Zurück zum Zitat Jin J, Wang W, Palaniswami M (2007) Utility Max-Min fair flow control for multipath communication networks. In: Proceedings of ICSPCS, pp 61–66 Jin J, Wang W, Palaniswami M (2007) Utility Max-Min fair flow control for multipath communication networks. In: Proceedings of ICSPCS, pp 61–66
32.
Zurück zum Zitat Xu F, Liu F, Liu L, Jin H, Li B, Li B (2014) iAware: making live migration of virtual machines interference-aware in the cloud. IEEE Trans Comput 63(12):3012–3025MathSciNetCrossRef Xu F, Liu F, Liu L, Jin H, Li B, Li B (2014) iAware: making live migration of virtual machines interference-aware in the cloud. IEEE Trans Comput 63(12):3012–3025MathSciNetCrossRef
33.
Zurück zum Zitat Xu F, Liu F, Jin H (2015) Heterogeneity and interference-aware virtual machine provisioning for predictable performance in the cloud. IEEE Trans Comput Xu F, Liu F, Jin H (2015) Heterogeneity and interference-aware virtual machine provisioning for predictable performance in the cloud. IEEE Trans Comput
34.
Zurück zum Zitat Ballani H, Costa P, Karagiannis T, Rowstron A (2011) Towards predictable datacenter networks. ACM SIGCOMM Computer Communication Review 41(4):242–253CrossRef Ballani H, Costa P, Karagiannis T, Rowstron A (2011) Towards predictable datacenter networks. ACM SIGCOMM Computer Communication Review 41(4):242–253CrossRef
35.
Zurück zum Zitat Hu S, Bai W, Chen K, Tian C, Zhang Y, Wu H (2016) Providing bandwidth guarantees, work conservation and low latency simultaneously in the cloud. In: Proceedings of infocom Hu S, Bai W, Chen K, Tian C, Zhang Y, Wu H (2016) Providing bandwidth guarantees, work conservation and low latency simultaneously in the cloud. In: Proceedings of infocom
36.
Zurück zum Zitat Shieh A, Kandula S, Greenberg A, Kim C, Saha B (2011) Sharing the data center network. In: Proceedings of NSDI, pp 309–322 Shieh A, Kandula S, Greenberg A, Kim C, Saha B (2011) Sharing the data center network. In: Proceedings of NSDI, pp 309–322
37.
Zurück zum Zitat Guo J, Liu F, Huang X, Lui J, Hu M, Gao Q, Jin H (2014) On efficient bandwidth allocation for traffic variability in datacenters. In: Proceedings of infocom, pp 1572–1580 Guo J, Liu F, Huang X, Lui J, Hu M, Gao Q, Jin H (2014) On efficient bandwidth allocation for traffic variability in datacenters. In: Proceedings of infocom, pp 1572–1580
38.
Zurück zum Zitat Li D, Chen C, Guan J, Zhang Y, Zhu J, Yu R (2015) Dcloud: deadline-aware resource allocation for cloud computing jobs. IEEE Trans Parallel Distrib Syst Li D, Chen C, Guan J, Zhang Y, Zhu J, Yu R (2015) Dcloud: deadline-aware resource allocation for cloud computing jobs. IEEE Trans Parallel Distrib Syst
39.
Zurück zum Zitat Li D, Liao X, Jin H, Zhou B, Zhang Q (2013) A new disk I/O model of virtualized cloud environment. IEEE Trans Parallel Distrib Syst 24(6):1129–1138CrossRef Li D, Liao X, Jin H, Zhou B, Zhang Q (2013) A new disk I/O model of virtualized cloud environment. IEEE Trans Parallel Distrib Syst 24(6):1129–1138CrossRef
40.
Zurück zum Zitat Kumar G, Chowdhury M, Ratnasamy S, Stoica I (2012) A case for performance-centric network allocation. In: Proceedings of hotcloud, pp 9–9 Kumar G, Chowdhury M, Ratnasamy S, Stoica I (2012) A case for performance-centric network allocation. In: Proceedings of hotcloud, pp 9–9
41.
Zurück zum Zitat Lee J, Turner Y, Lee M, Popa L, Banerjee S, Kang JM, Sharma P (2014) Application-driven bandwidth guarantees in datacenters. In: Proceedings of SIGCOMM, pp 467–478 Lee J, Turner Y, Lee M, Popa L, Banerjee S, Kang JM, Sharma P (2014) Application-driven bandwidth guarantees in datacenters. In: Proceedings of SIGCOMM, pp 467–478
42.
Zurück zum Zitat Chen L, Feng Y, Li B, Li B (2014) Towards performance-centric fairness in datacenter networks. In: Proceedings of infocom, pp 1599–1607 Chen L, Feng Y, Li B, Li B (2014) Towards performance-centric fairness in datacenter networks. In: Proceedings of infocom, pp 1599–1607
Metadaten
Titel
UFalloc: Towards Utility Max-min Fairness of Bandwidth Allocation for Applications in Datacenter Networks
verfasst von
Fei Xu
Wangying Ye
Yuhan Liu
Wei Zhang
Publikationsdatum
17.05.2016
Verlag
Springer US
Erschienen in
Mobile Networks and Applications / Ausgabe 2/2017
Print ISSN: 1383-469X
Elektronische ISSN: 1572-8153
DOI
https://doi.org/10.1007/s11036-016-0739-z

Weitere Artikel der Ausgabe 2/2017

Mobile Networks and Applications 2/2017 Zur Ausgabe

Neuer Inhalt