Advanced search
2 files | 11.39 MB

Algorithms for network-aware application component placement for cloud resource allocation

Maryam Barshan (UGent) , Hendrik Moens (UGent) , Steven Latré (UGent) , Bruno Volckaert (UGent) and Filip De Turck (UGent)
Author
Organization
Abstract
Due to the soaring popularity of cloud-based services over the last years, the size and the complexity of cloud environments has been growing quickly. In the context of cloud systems, mapping a number of application components to a set of physical servers and assigning cloud resources to those components is challenging. Traditional resource allocation systems which rely on a centralized management paradigm suffer from scalability issues, making them inappropriate for large-scale cloud environments. Therefore, there is a need for providing new management solutions that scale well to large size cloud systems. In this article, we present optimal and heuristic solutions for network-aware placement of multicomponent applications with differing component characteristics. The optimal integer linear programming (ILP)-based solution minimizes the application rejection rate and the cost of mapping while respecting application component requirements and physical network limitations. As the execution time of the optimal model scales exponentially, we also offer scalable heuristic solutions for centralized and hierarchical application placement, which are thoroughly explained and evaluated and compared to the optimal solution. Our evaluations show that while the proposed centralized heuristic is near-optimal, the hierarchical approach is much faster and offers higher scalability compared to a centralized approach, e.g., mapping 2.7 million application components onto 512k servers. Moreover, the percentage of servers used and fully placed applications remain close to that of the centralized and optimal solutions.
Keywords
Application placement, cloud management, hierarchical management system, optimization, scalability

Downloads

  • 7170 i.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 5.58 MB
  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 5.81 MB

Citation

Please use this url to cite or link to this publication:

Chicago
Barshan, Maryam, Hendrik Moens, Steven Latré, Bruno Volckaert, and Filip De Turck. 2017. “Algorithms for Network-aware Application Component Placement for Cloud Resource Allocation.” Journal of Communications and Networks 19 (5): 493–508.
APA
Barshan, M., Moens, H., Latré, S., Volckaert, B., & De Turck, F. (2017). Algorithms for network-aware application component placement for cloud resource allocation. JOURNAL OF COMMUNICATIONS AND NETWORKS, 19(5), 493–508.
Vancouver
1.
Barshan M, Moens H, Latré S, Volckaert B, De Turck F. Algorithms for network-aware application component placement for cloud resource allocation. JOURNAL OF COMMUNICATIONS AND NETWORKS. 2017;19(5):493–508.
MLA
Barshan, Maryam, Hendrik Moens, Steven Latré, et al. “Algorithms for Network-aware Application Component Placement for Cloud Resource Allocation.” JOURNAL OF COMMUNICATIONS AND NETWORKS 19.5 (2017): 493–508. Print.
@article{8559972,
  abstract     = {Due to the soaring popularity of cloud-based services over the last years, the size and the complexity of cloud environments has been growing quickly. In the context of cloud systems, mapping a number of application components to a set of physical servers and assigning cloud resources to those components is challenging. Traditional resource allocation systems which rely on a centralized management paradigm suffer from scalability issues, making them inappropriate for large-scale cloud environments. Therefore, there is a need for providing new management solutions that scale well to large size cloud systems. In this article, we present optimal and heuristic solutions for network-aware placement of multicomponent applications with differing component characteristics. The optimal integer linear programming (ILP)-based solution minimizes the application rejection rate and the cost of mapping while respecting application component requirements and physical network limitations. As the execution time of the optimal model scales exponentially, we also offer scalable heuristic solutions for centralized and hierarchical application placement, which are thoroughly explained and evaluated and compared to the optimal solution. Our evaluations show that while the proposed centralized heuristic is near-optimal, the hierarchical approach is much faster and offers higher scalability compared to a centralized approach, e.g., mapping 2.7 million application components onto 512k servers. Moreover, the percentage of servers used and fully placed applications remain close to that of the centralized and optimal solutions.},
  author       = {Barshan, Maryam and Moens, Hendrik and Latr{\'e}, Steven and Volckaert, Bruno and De Turck, Filip},
  issn         = {1229-2370},
  journal      = {JOURNAL OF COMMUNICATIONS AND NETWORKS},
  language     = {eng},
  number       = {5},
  pages        = {493--508},
  title        = {Algorithms for network-aware application component placement for cloud resource allocation},
  url          = {http://dx.doi.org/10.1109/JCN.2017.000081},
  volume       = {19},
  year         = {2017},
}

Altmetric
View in Altmetric
Web of Science
Times cited: