• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of Parallel and Distributed Computing >Optimal and approximate approaches for selecting proxy agents mobile IP based network backbones
【24h】

Optimal and approximate approaches for selecting proxy agents mobile IP based network backbones

机译：选择代理基于移动IP的网络主干的最佳和近似方法

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

摘要

In a mobile environment, each mobile host should have a home agent on its home network that maintains a registry of the current location of the mobile host. This registry is normally updated every time a mobile host moves from one subnet to another. We study the tradeoff between the cost of updating the registry and the cost of searching for a mobile host while it is away from home. Using a set of special agents, called proxy agents, which implement a two-tier update process, the cost of updates could be reduced; however, the search cost might increase. We study different approaches to identify a set of proxy agents that minimizes the cost of search. In this paper, we use mathematical programming to obtain optimal solutions to the problem. We consider two situations: the cost of search measured by the sum of all search message costs, and the cost of search measured by the maximum cost of such messages. For these two respective cases we formulate the minimization of the cost of search as Min-Sum and Min-Max problems. For large networks in which the optimization problem may be intractable, we study three different approximate approaches: (1) clustering, (2) genetic algorithms, and (3) simulated annealing. Results of a large set of experiments are presented.
机译：在移动环境中，每个移动主机应在其本地网络上具有一个本地代理，该代理维护移动主机当前位置的注册表。通常，每次移动主机从一个子网移动到另一个子网时，都会更新此注册表。我们研究了更新注册表的成本与在移动主机不在家时搜索移动主机之间的权衡。使用一组称为两层更新过程的特殊代理（称为代理），可以降低更新成本；但是，搜索成本可能会增加。我们研究了不同的方法来识别一组代理代理，以最大程度地降低搜索成本。在本文中，我们使用数学编程来获得该问题的最佳解决方案。我们考虑两种情况：以所有搜索消息成本之和衡量的搜索成本，以及以此类消息的最大成本衡量的搜索成本。对于这两种情况，我们将最小化搜索成本公式化为最小和最小和最大-最大问题。对于优化问题可能难以解决的大型网络，我们研究了三种不同的近似方法：（1）聚类，（2）遗传算法和（3）模拟退火。给出了大量实验的结果。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号