Provisioning QoS-Aware and Robust Applications in Internet of Things: A Network Perspective

Provisioning QoS-Aware and Robust Applications in Internet of Things: A Network Perspective
复制标题

DOI:
10.1109/tnet.2019.2936015
复制
发表时间:
2019-08
期刊:
IEEE/ACM Transactions on Networking
影响因子:
--
通讯作者:
Ruozhou Yu;G. Xue;Xiang Zhang
Ruozhou Yu;G. Xue;Xiang Zhang
中科院分区:
其他
文献类型:
--
作者:
Ruozhou Yu;G. Xue;Xiang Zhang

文献摘要

相似文献

物联网(IoT)自发明以来激发了许多新的应用。然而,在各种应用场景中,其开发和利用一直受到资源有限的限制。在本文中,我们研究了实时物联网应用的资源配置问题,即,处理来自网络中数据源的并发数据流的应用程序。我们研究联合应用程序放置和数据路由,以支持具有服务质量和鲁棒性要求的物联网应用程序。我们制定了四个版本的供应问题,跨越两个重要的实时应用程序(可并行化和非并行化),和两个供应方案(单个应用程序和多个应用程序)。所有的版本都被证明是NP难的。我们提出了四个版本中的三个版本的完全多项式时间近似方案,以及第四个版本的随机算法。通过仿真实验,分析了并行性和鲁棒性对供应性能的影响,表明本文提出的算法可以大大提高物联网应用的服务质量。
The Internet-of-Things (IoT) has inspired numerous new applications ever since its invention. Nevertheless, its development and utilization have always been restricted by the limited resources in various application scenarios. In this paper, we study the problem of resource provisioning for real-time IoT applications, i.e., applications that process concurrent data streams from data sources in the network. We investigate joint application placement and data routing to support IoT applications that have both quality-of-service and robustness requirements. We formulate four versions of the provisioning problem, spanning across two important classes of real-time applications (parallelizable and non-parallelizable), and two provisioning scenarios (single application and multiple applications). All versions are proved to be NP-hard. We propose fully polynomial-time approximation schemes for three of the four versions, and a randomized algorithm for the forth. Through simulation experiments, we analyze the impact of parallelizability and robustness on the provisioning performance, and show that our proposed algorithms can greatly improve the quality-of-service of the IoT applications.