Optimal server and service deployment for multi-tier edge cloud computing

Ahat B., BAKTIR A. C., Aras N., ALTINEL İ. K., Ozgovde A., ERSOY C.

COMPUTER NETWORKS, cilt.199, 2021 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 199
  • Basım Tarihi: 2021
  • Doi Numarası: 10.1016/j.comnet.2021.108393
  • Dergi Adı: COMPUTER NETWORKS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, PASCAL, ABI/INFORM, Aerospace Database, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Library and Information Science Abstracts, Library, Information Science & Technology Abstracts (LISTA), Metadex, zbMATH, Civil Engineering Abstracts
  • Anahtar Kelimeler: Network design, Server placement, Edge computing, Cloud computing, Network optimization, PLACEMENT, OPTIMIZATION
  • Galatasaray Üniversitesi Adresli: Evet

Özet

A wide variety of novel services have been envisioned lately due to wearable gadgets, autonomous vehicles, and IoT applications. These services cannot directly be implemented using centralized cloud computing infrastructure due to large Wide Area Network (WAN) delays. Recently, edge computing is proposed to comply with the requirements of these services, where resilient local servers are accessed through fast wireless links. With this approach, real-time service access can be achieved by handling the user requests at the edge computing infrastructure. Since edge and cloud servers may potentially cooperate, operators can maximize their revenues by optimally deploying the computational resources, distributing the services within the network, and assigning the tasks generated by the end-users. These decisions, each of which is a difficult task on its own, are integrated in this study and formulated as a mixed-integer linear programming (MILP) model to optimally design a multi-tier computation structure. Because of the scalability issue, a heuristic algorithm based on the Lagrangian relaxation of the MILP formulation is proposed to solve larger instances. Additionally, in order to provide an opportunity for the operators to find a feasible solution in a very short time, a greedy heuristic approach is presented. To evaluate the performance of the proposed methods, computational experiments are conducted on a broad suite of randomly generated topologies. The results indicate that the proposed approaches can obtain high-quality solutions within the given time limit.