【24h】

Dynamic Distributed Resource Allocation: A Distributed Constraint Satisfaction Approach

机译:动态分布式资源分配:一种分布式约束满足方法

获取原文
获取原文并翻译 | 示例

摘要

In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed sensor networks, disaster rescue, hospital scheduling and others. Despite the variety of approaches proposed for distributed resource allocation, a systematic formalization of the problem, explaining the different sources of difficulties, and a formal explanation of the strengths and limitations of key approaches is missing. We take a step towards this goal by proposing a formalization of distributed resource allocation that represents both dynamic and distributed aspects of the problem. We define four categories of difficulties of the problem. To address this formalized problem, the paper defines the notion of Dynamic Distributed Constraint Satisfaction Problem (DyDCSP). The central contribution of the paper is a generalized mapping from distributed resource allocation to DyDCSP. This mapping is proven to correctly perform resource allocation problems of specific difficulty. This theoretical result is verified in practice by an implementation on a real-world distributed sensor network.
机译:在分布式资源分配中,一组代理必须将其资源分配给一组任务。在许多实际领域中都会出现此问题,例如分布式传感器网络,灾难救援,医院调度等。尽管提出了多种用于分布式资源分配的方法,但仍未系统化地对问题进行形式化,解释了各种困难的根源以及对关键方法的优缺点的正式解释。我们朝着这一目标迈出了一步,提出了代表问题动态和分布式方面的分布式资源分配的形式化规范。我们定义问题的四类困难。为了解决这个形式化的问题,本文定义了动态分布式约束满足问题(DyDCSP)的概念。本文的主要贡献是从分布式资源分配到DyDCSP的广义映射。事实证明,这种映射可以正确执行特定难度的资源分配问题。该理论结果在实际中通过在现实世界中的分布式传感器网络上的实现得到了验证。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号