Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Ergebnis 8 von 346
Journal of network and computer applications, 2021-04, Vol.180, p.102994, Article 102994
2021
Volltextzugriff (PDF)

Details

Autor(en) / Beteiligte
Titel
A heuristic scheduling approach for fog-cloud computing environment with stationary IoT devices
Ist Teil von
  • Journal of network and computer applications, 2021-04, Vol.180, p.102994, Article 102994
Ort / Verlag
Elsevier Ltd
Erscheinungsjahr
2021
Quelle
Access via ScienceDirect (Elsevier)
Beschreibungen/Notizen
  • The emergence of the Internet of Things (IoT) paradigm has led to the rise of a variety of applications with different characteristics and Quality of Service (QoS) requirements. Those applications require computational power and have time sensitive requirements. Cloud computing paradigm provides an illusion to consumers with unlimited computation resource power. However, cloud computing fails to deliver on the time-sensitive requirements of applications. The main challenge in the cloud computing paradigm is the associated delays from the edge IoT device to the cloud data center and from the cloud data center back to the edge device. Fog computing extends limited computational services closer to the edge device to achieve the time sensitive requirement of applications. This work proposes a scheduling solution which adopts the three-tier fog computing architecture in order to satisfy the maximum number of requests given their deadline requirements. In this work, an optimization model using mixed integer programming is introduced to minimize deadline misses. The model is validated with an exact solution technique. The scheduling problem is known to be an NP-hard, and hence, exact optimization solutions are inadequate for a typical size problem in fog computing. Given the complex nature of the problem, a heuristic approach using the genetic algorithm (GA) is presented. The performance of the proposed GA was evaluated and compared against round robin and priority scheduling. The results show that the deadline misses of the proposed approach is 20%–55% better than the other techniques.
Sprache
Englisch
Identifikatoren
ISSN: 1084-8045
eISSN: 1095-8592
DOI: 10.1016/j.jnca.2021.102994
Titel-ID: cdi_crossref_primary_10_1016_j_jnca_2021_102994

Weiterführende Literatur

Empfehlungen zum selben Thema automatisch vorgeschlagen von bX