Fog computing has been advocated as an enabling technology for computationally intensive services in smart connected vehicles. Most existing works focus on analyzing the queueing and workload processing latencies associated with fog computing, ignoring the fact that wireless access latency can sometimes dominate the overall latency. This motivates the work in this paper, where we report on a five-month measurement study of the wireless access latency between connected vehicles and a fog/cloud computing system supported by commercially available LTE networks. We propose AdaptiveFog, a novel framework for autonomous and dynamic switching between different LTE networks that implement a fog/cloud infrastructure. AdaptiveFog's main objective is to maximize the service confidence level, defined as the probability that the latency of a given service type is below some threshold. To quantify the performance gap between different LTE networks, we introduce a novel statistical distance metric, called weighted Kantorovich-Rubinstein (K-R) distance. Two scenarios based on finite- and infinite-horizon optimization of short-term and long-term confidence are investigated. For each scenario, a simple threshold policy based on weighted K-R distance is proposed and proved to maximize the latency confidence for smart vehicles. Extensive analysis and simulations are performed based on our latency measurements. Our results show that AdaptiveFog achieves around 30% to 50% improvement in the confidence levels of fog and cloud latencies, respectively.
翻译:软化计算被提倡为智能连通车辆计算密集服务的赋能技术; 多数现有工作的重点是分析与雾计算相关的排队和工作量处理迟滞,忽视无线接入潜伏有时会主宰整个潜伏。 这促使本文件的工作,我们报告对连接车辆之间的无线接入潜伏和由商业上可用的LTE网络支持的雾/宽度计算系统进行为期五个月的测量研究; 我们提议调适Fog, 这是一个用于实施雾/云基础设施的不同LTE网络之间自主和动态转换的新框架。 适应Fog的主要目标是最大限度地提高服务信任度, 其定义是某一服务类型的延迟潜伏可能低于某种临界值。 为了量化不同LTE网络之间的性能差距,我们采用了一种新的统计距离测量标准,要求加权的Kantorovich-Rubinstein(K-R)距离。 我们提出了基于有限和无限比例优化短期和长期信任度的两种假设。 对于每一种假设, 以加权的K-RMerois宽度测量为基准的简单临界值政策, 将实现基于智能的智能的智能度的30-R距离测量结果。