Online Auction of Cloud Resources in Support of the Internet of Things

Ammar Gharaibeh, Abdallah Khreishah, Mehdi Mohammadi, Ala Al-Fuqaha, Issa Khalil, Ammar Rayes

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Internet of Things (IoT) applications can benefit greatly from cloud-hosted message broker services that utilize publish-subscribe communications. The operators of IoT cloud-hosted services are often interested in delivering services that maximize their revenue given quality of service guarantees. In this paper, we formulate the problem of maximizing the profit of the service provider given the prior knowledge of the request sequence as an integer linear program and prove that it is strongly NP-complete, and thus there is no fully polynomial-time approximation scheme for the problem, unless P=NP. Due to the above-mentioned problem and the difficulty of obtaining the request sequence in advance in real-world scenarios, we propose an auction-based online algorithm that does not require the prior knowledge of the request sequence. We prove that the competitive ratio of the online algorithm is O(log (N)), where N is the number of cloud zones that host the publish-subscribe services. Moreover, we show that no online algorithm can achieve a competitive ratio better than Ω (log (N)). Therefore, our online algorithm achieves the optimal competitive ratio in the asymptotic sense. Our simulations, based on real data traces, show that our algorithm achieves up to 83% more profit compared to a heuristic approach, while consuming 60% less resources.

Original languageEnglish
Article number7972940
Pages (from-to)1583-1596
Number of pages14
JournalIEEE Internet of Things Journal
Volume4
Issue number5
DOIs
Publication statusPublished - 1 Oct 2017

Fingerprint

Profitability
Quality of service
Internet of things
Polynomials
Communication

Keywords

  • Auction
  • Internet of Things (IoT)
  • online algorithm
  • publish-subscribe communications

ASJC Scopus subject areas

  • Signal Processing
  • Information Systems
  • Hardware and Architecture
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Gharaibeh, A., Khreishah, A., Mohammadi, M., Al-Fuqaha, A., Khalil, I., & Rayes, A. (2017). Online Auction of Cloud Resources in Support of the Internet of Things. IEEE Internet of Things Journal, 4(5), 1583-1596. [7972940]. https://doi.org/10.1109/JIOT.2017.2724938

Online Auction of Cloud Resources in Support of the Internet of Things. / Gharaibeh, Ammar; Khreishah, Abdallah; Mohammadi, Mehdi; Al-Fuqaha, Ala; Khalil, Issa; Rayes, Ammar.

In: IEEE Internet of Things Journal, Vol. 4, No. 5, 7972940, 01.10.2017, p. 1583-1596.

Research output: Contribution to journalArticle

Gharaibeh, A, Khreishah, A, Mohammadi, M, Al-Fuqaha, A, Khalil, I & Rayes, A 2017, 'Online Auction of Cloud Resources in Support of the Internet of Things', IEEE Internet of Things Journal, vol. 4, no. 5, 7972940, pp. 1583-1596. https://doi.org/10.1109/JIOT.2017.2724938
Gharaibeh, Ammar ; Khreishah, Abdallah ; Mohammadi, Mehdi ; Al-Fuqaha, Ala ; Khalil, Issa ; Rayes, Ammar. / Online Auction of Cloud Resources in Support of the Internet of Things. In: IEEE Internet of Things Journal. 2017 ; Vol. 4, No. 5. pp. 1583-1596.
@article{f16ca051f9034db48cb49034e22e46c5,
title = "Online Auction of Cloud Resources in Support of the Internet of Things",
abstract = "Internet of Things (IoT) applications can benefit greatly from cloud-hosted message broker services that utilize publish-subscribe communications. The operators of IoT cloud-hosted services are often interested in delivering services that maximize their revenue given quality of service guarantees. In this paper, we formulate the problem of maximizing the profit of the service provider given the prior knowledge of the request sequence as an integer linear program and prove that it is strongly NP-complete, and thus there is no fully polynomial-time approximation scheme for the problem, unless P=NP. Due to the above-mentioned problem and the difficulty of obtaining the request sequence in advance in real-world scenarios, we propose an auction-based online algorithm that does not require the prior knowledge of the request sequence. We prove that the competitive ratio of the online algorithm is O(log (N)), where N is the number of cloud zones that host the publish-subscribe services. Moreover, we show that no online algorithm can achieve a competitive ratio better than Ω (log (N)). Therefore, our online algorithm achieves the optimal competitive ratio in the asymptotic sense. Our simulations, based on real data traces, show that our algorithm achieves up to 83{\%} more profit compared to a heuristic approach, while consuming 60{\%} less resources.",
keywords = "Auction, Internet of Things (IoT), online algorithm, publish-subscribe communications",
author = "Ammar Gharaibeh and Abdallah Khreishah and Mehdi Mohammadi and Ala Al-Fuqaha and Issa Khalil and Ammar Rayes",
year = "2017",
month = "10",
day = "1",
doi = "10.1109/JIOT.2017.2724938",
language = "English",
volume = "4",
pages = "1583--1596",
journal = "IEEE Internet of Things Journal",
issn = "2327-4662",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Online Auction of Cloud Resources in Support of the Internet of Things

AU - Gharaibeh, Ammar

AU - Khreishah, Abdallah

AU - Mohammadi, Mehdi

AU - Al-Fuqaha, Ala

AU - Khalil, Issa

AU - Rayes, Ammar

PY - 2017/10/1

Y1 - 2017/10/1

N2 - Internet of Things (IoT) applications can benefit greatly from cloud-hosted message broker services that utilize publish-subscribe communications. The operators of IoT cloud-hosted services are often interested in delivering services that maximize their revenue given quality of service guarantees. In this paper, we formulate the problem of maximizing the profit of the service provider given the prior knowledge of the request sequence as an integer linear program and prove that it is strongly NP-complete, and thus there is no fully polynomial-time approximation scheme for the problem, unless P=NP. Due to the above-mentioned problem and the difficulty of obtaining the request sequence in advance in real-world scenarios, we propose an auction-based online algorithm that does not require the prior knowledge of the request sequence. We prove that the competitive ratio of the online algorithm is O(log (N)), where N is the number of cloud zones that host the publish-subscribe services. Moreover, we show that no online algorithm can achieve a competitive ratio better than Ω (log (N)). Therefore, our online algorithm achieves the optimal competitive ratio in the asymptotic sense. Our simulations, based on real data traces, show that our algorithm achieves up to 83% more profit compared to a heuristic approach, while consuming 60% less resources.

AB - Internet of Things (IoT) applications can benefit greatly from cloud-hosted message broker services that utilize publish-subscribe communications. The operators of IoT cloud-hosted services are often interested in delivering services that maximize their revenue given quality of service guarantees. In this paper, we formulate the problem of maximizing the profit of the service provider given the prior knowledge of the request sequence as an integer linear program and prove that it is strongly NP-complete, and thus there is no fully polynomial-time approximation scheme for the problem, unless P=NP. Due to the above-mentioned problem and the difficulty of obtaining the request sequence in advance in real-world scenarios, we propose an auction-based online algorithm that does not require the prior knowledge of the request sequence. We prove that the competitive ratio of the online algorithm is O(log (N)), where N is the number of cloud zones that host the publish-subscribe services. Moreover, we show that no online algorithm can achieve a competitive ratio better than Ω (log (N)). Therefore, our online algorithm achieves the optimal competitive ratio in the asymptotic sense. Our simulations, based on real data traces, show that our algorithm achieves up to 83% more profit compared to a heuristic approach, while consuming 60% less resources.

KW - Auction

KW - Internet of Things (IoT)

KW - online algorithm

KW - publish-subscribe communications

UR - http://www.scopus.com/inward/record.url?scp=85023199247&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85023199247&partnerID=8YFLogxK

U2 - 10.1109/JIOT.2017.2724938

DO - 10.1109/JIOT.2017.2724938

M3 - Article

VL - 4

SP - 1583

EP - 1596

JO - IEEE Internet of Things Journal

JF - IEEE Internet of Things Journal

SN - 2327-4662

IS - 5

M1 - 7972940

ER -