• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>13th ACM international conference on modeling, analysis and simulation of wireless and mobile systems 2010 >Performance Evaluation of Service Execution in Opportunistic Computing
【24h】

Performance Evaluation of Service Execution in Opportunistic Computing

机译：机会计算中服务执行的性能评估

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Opportunistic computing has emerged as a new paradigm in computing, leveraging the advances in pervasive computing and opportunistic networking. Nodes in an opportunistic network avail of each others' connectivity and mobility to overcome network partitions. In opportunistic computing, this concept is generalised, as nodes avail of any resource available in the environment. Here we focus on computational resources, assuming mobile nodes opportunistically invoke services on each other. Specifically, resources are abstracted as services contributed by providers and invoked by seekers. In this paper, we present an analytical model that depicts the service invocation process between seekers and providers. Specifically, we derive the optimal number of replicas to be spawned on encountered nodes, in order to minimise the execution time and optimise the computational and bandwidth resources used. Performance results show that a policy operating in the optimal configuration largely outperforms policies that do not consider resource constraints.
机译：利用普适计算和机会网络的进步，机会计算已成为一种新的计算范式。机会网络中的节点利用彼此的连通性和移动性来克服网络分区。在机会计算中，由于节点可利用环境中可用的任何资源，因此可以概括此概念。在这里，我们集中在计算资源上，假设移动节点在机会上相互调用服务。具体来说，资源被抽象为提供者提供的服务，并由搜寻者调用。在本文中，我们提出了一个分析模型，该模型描述了搜寻者和提供者之间的服务调用过程。具体来说，我们得出要在遇到的节点上生成的副本的最佳数量，以最小化执行时间并优化所使用的计算和带宽资源。性能结果表明，以最佳配置运行的策略在很大程度上要优于不考虑资源限制的策略。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号