首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >New Memoryless Online Routing Algorithms for Delaunay Triangulations
【24h】

New Memoryless Online Routing Algorithms for Delaunay Triangulations

机译:用于Delaunay三角剖分的新的无记忆在线路由算法

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

摘要

Memoryless online routing (MOR) algorithms are suitable for the applications only using local information to find paths, and Delaunay triangulations (DTs) are the class of geometric graphs widely proposed as network topologies. Motivated by these two facts, this paper reports a variety of new MOR algorithms that work for Delaunay triangulations, thus greatly enriching the family of such algorithms. This paper also evaluates and compares these new algorithms with three existing MOR algorithms. The experimental results shed light on their performance in terms of both Euclidean and link metrics, and also reveal certain properties of Delaunay triangulations. Finally, this paper poses three open problems, with their importance explained.
机译:无内存在线路由(MOR)算法仅适用于仅使用本地信息来查找路径的应用程序,而Delaunay三角剖分(DT)是被广泛提议作为网络拓扑的几何图类。基于这两个事实,本文报告了适用于Delaunay三角剖分的各种新的MOR算法,从而极大地丰富了此类算法的系列。本文还评估并比较了这些新算法与现有的三种MOR算法。实验结果揭示了它们在欧几里得度量和链接度量方面的性能,并且还揭示了Delaunay三角剖分的某些属性。最后,本文提出了三个未解决的问题,并说明了它们的重要性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号