4.8 Article

Optimal Placement of Cloudlets for Access Delay Minimization in SDN-Based Internet of Things Networks

期刊

IEEE INTERNET OF THINGS JOURNAL
卷 5, 期 2, 页码 1334-1344

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2018.2811808

关键词

Access delay minimization; cloudlets; Internet of Things (IoT) networks; software-defined networking (SDN)

资金

  1. National Natural Science Foundation of China [61771374, 61771373, 61601357]
  2. China 111 Project [B16037]
  3. Fundamental Research Fund for the Central Universities [JB171501, JB181506, JB181507, JB181508]

向作者/读者索取更多资源

Given the highly dynamic traffic loads of mobile Internet of Things (IoT) devices and their stringent quality-of-service requirements, i.e., access delay particularly, as well as the heterogeneous infrastructures among IoT networks, it is a nontrivial task to efficiently deploy cloudlets among large number of access points (APs) in IoT networks, especially for the access delay and network reliability, since different placement schemes would produce various network performances. To combat this issue, we are motivated to investigate in details the optimal placement of cloudlets to minimize the average access delay by applying software-defined networking (SDN) techniques to provide flexible and programmable management for cloudlets deployment in IoT networks with considering the complicated queuing process at numerous SDN-based APs. An enumeration-based optimal placement algorithm (EOPA) is first proposed as benchmark. Then we propose a ranking-based near-optimal placement algorithm (RNOPA) which is able to dynamically adapt to mobile IoT devices and their traffic loads, by treating each AP as a single server queue and adopting an efficient ranking mechanism. As corroborated by extensive simulation results, RNOPA reports access delay very close to that of EOPA. Note that RNOPA outperforms the famous K-medians clustering algorithm (KMCA) in both of average cloudlet access delay and reliability, while at the cost of a much lower computational complexity than KMCA.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据