Mobile clients that consume and produce data are abundant in fog environments and low latency access to this data can only be achieved by storing it in their close physical proximity. To adapt data replication in fog data stores in an efficient manner and make client data available at the fog node that is closest to the client, the systems need to predict both client movement and pauses in data consumption. In this paper, we present variations of Markov model algorithms that can run on clients to increase the data availability while minimizing excess data. In a simulation, we find the availability of data at the closest node can be improved by 35% without incurring the storage and communication overheads of global replication.
翻译:消费和生成数据的移动客户在雾环境中非常丰富,只有将数据储存在距离更近的地方,才能获得低潜伏的这些数据。要有效地将数据复制到雾数据储存库,并在离客户最近的雾节点提供客户数据,这些系统需要预测客户的移动和数据消耗暂停。在本文中,我们介绍了Markov模型算法的变异,这些算法可以让客户增加数据的可用性,同时尽量减少多余的数据。在模拟中,我们发现在最接近节点提供的数据可以增加35%,而不必考虑全球复制的储存和通信间接费用。