当前位置: X-MOL 学术Computing › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A probabilistic model for assigning queries at the edge
Computing ( IF 3.7 ) Pub Date : 2019-11-18 , DOI: 10.1007/s00607-019-00767-8
Kostas Kolomvatsos , Christos Anagnostopoulos

Data management at the edge of the network can increase the performance of applications as the processing is realized close to end users limiting the observed latency in the provision of responses. A typical data processing involves the execution of queries/tasks defined by users or applications asking for responses in the form of analytics. Query/task execution can be realized at the edge nodes that can undertake the responsibility of delivering the desired analytics to the interested users or applications. In this paper, we deal with the problem of allocating queries to a number of edge nodes. The aim is to support the goal of eliminating further the latency by allocating queries to nodes that exhibit a low load and high processing speed, thus, they can respond in the minimum time. Before any allocation, we propose a method for estimating the computational burden that a query/task will add to a node and, afterwards, we proceed with the final assignment. The allocation is concluded by the assistance of an ensemble similarity scheme responsible to deliver the complexity class for each query/task and a probabilistic decision making model. The proposed scheme matches the characteristics of the incoming queries and edge nodes trying to conclude the optimal allocation. We discuss our mechanism and through a large set of simulations and the adoption of benchmarking queries, we reveal the potentials of the proposed model supported by numerical results.

中文翻译:

在边缘分配查询的概率模型

网络边缘的数据管理可以提高应用程序的性能,因为处理是在靠近最终用户的地方实现的,从而限制了在提供响应时观察到的延迟。典型的数据处理涉及执行由用户或应用程序定义的查询/任务,以分析的形式请求响应。可以在边缘节点实现查询/任务执行,这些节点可以承担向感兴趣的用户或应用程序提供所需分析的责任。在本文中,我们处理将查询分配给多个边缘节点的问题。目的是通过将查询分配给表现出低负载和高处理速度的节点来支持进一步消除延迟的目标,因此它们可以在最短的时间内做出响应。在任何分配之前,我们提出了一种估计查询/任务将添加到节点的计算负担的方法,然后我们继续进行最终分配。在负责为每个查询/任务和概率决策模型提供复杂性类别的集成相似性方案的协助下,分配结束。所提出的方案匹配传入查询和尝试得出最优分配的边缘节点的特征。我们讨论了我们的机制,并通过大量模拟和基准查询的采用,揭示了数值结果支持的拟议模型的潜力。在负责为每个查询/任务和概率决策模型提供复杂性类别的集成相似性方案的协助下,分配结束。所提出的方案匹配传入查询和尝试得出最优分配的边缘节点的特征。我们讨论了我们的机制,并通过大量模拟和基准查询的采用,揭示了数值结果支持的拟议模型的潜力。在负责为每个查询/任务和概率决策模型提供复杂性类别的集成相似性方案的协助下,分配结束。所提出的方案匹配传入查询和尝试得出最优分配的边缘节点的特征。我们讨论了我们的机制,并通过大量模拟和基准查询的采用,揭示了数值结果支持的拟议模型的潜力。
更新日期:2019-11-18
down
wechat
bug