TY - GEN
T1 - Application Provisioning in FOG Computing-enabled Internet-of-Things
T2 - 2018 IEEE Conference on Computer Communications, INFOCOM 2018
AU - Yu, Ruozhou
AU - Xue, Guoliang
AU - Zhang, Xiang
N1 - Funding Information:
Yu, Xue and Zhang ({ruozhouy, xue, xzhan229}@asu.edu) are all with Arizona State University, Tempe, AZ 85287. This research was supported in part by NSF grants 1461886 and 1704092. The information reported here does not reflect the position or the policy of the funding agency.
Publisher Copyright:
© 2018 IEEE.
PY - 2018/10/8
Y1 - 2018/10/8
N2 - S-The emergence of the Internet-of-Things (IoT) has inspired numerous new applications. However, due to the limited resources in current IoT infrastructures and the stringent quality-of-service requirements of the applications, providing computing and communication supports for the applications is becoming increasingly difficult. In this paper, we consider IoT applications that receive continuous data streams from multiple sources in the network, and study joint application placement and data routing to support all data streams with both bandwidth and delay guarantees. We formulate the application provisioning problem both for a single application and for multiple applications, with both cases proved to be NP-hard. For the case with a single application, we propose a fully polynomial-time approximation scheme. For the multi-application scenario, if the applications can be parallelized among multiple distributed instances, we propose a fully polynomial-time approximation scheme; for general non-parallelizable applications, we propose a randomized algorithm and analyze its performance. Simulations show that the proposed algorithms greatly improve the quality-of-service of the IoT applications compared to the heuristics.
AB - S-The emergence of the Internet-of-Things (IoT) has inspired numerous new applications. However, due to the limited resources in current IoT infrastructures and the stringent quality-of-service requirements of the applications, providing computing and communication supports for the applications is becoming increasingly difficult. In this paper, we consider IoT applications that receive continuous data streams from multiple sources in the network, and study joint application placement and data routing to support all data streams with both bandwidth and delay guarantees. We formulate the application provisioning problem both for a single application and for multiple applications, with both cases proved to be NP-hard. For the case with a single application, we propose a fully polynomial-time approximation scheme. For the multi-application scenario, if the applications can be parallelized among multiple distributed instances, we propose a fully polynomial-time approximation scheme; for general non-parallelizable applications, we propose a randomized algorithm and analyze its performance. Simulations show that the proposed algorithms greatly improve the quality-of-service of the IoT applications compared to the heuristics.
KW - Approximation algorithms
KW - Fog computing
KW - Internet-of-things
KW - Quality-of-service
KW - Service provisioning
UR - http://www.scopus.com/inward/record.url?scp=85055964755&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85055964755&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2018.8486269
DO - 10.1109/INFOCOM.2018.8486269
M3 - Conference contribution
AN - SCOPUS:85055964755
T3 - Proceedings - IEEE INFOCOM
SP - 783
EP - 791
BT - INFOCOM 2018 - IEEE Conference on Computer Communications
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 15 April 2018 through 19 April 2018
ER -