...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of parallel programming >A Map-Reduce Approach for the Dijkstra Algorithm in SDN Over Osmotic Computing Systems
【24h】

A Map-Reduce Approach for the Dijkstra Algorithm in SDN Over Osmotic Computing Systems

机译：渗透计系统SDN中DIJKSTRA算法的地图降低方法

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

摘要

Osmotic Computing represents a glue solution able to manage the deployment and orchestration of interconnected microelements across heterogeneous physical and virtual infrastructures (e.g., IoT, Edge and Cloud nodes) according to the behavior of hardware and software components during the time. The adoption of Osmotic Computing is challenging, but addressing networking issues is a key research topic due to the emergence of new problems in terms of QoS requirements. In this paper, we analyze how to exploit well-known networking solutions, such as the Dijkstra's algorithm, and Big Data oriented technologies, such as the Hadoop and MapReduce, to provide efficient newtorking functionalities in Osmotic Computing. In particular, our objective is to minimize the routing path computation time in the software defined network (SDN) at the basis of microelement networking, as well as to ensure a global view and a high level of dynamism of our network topology. To accomplish this task, we process routing tables through a MapReduce based implementation of the Dijkstra's algorithm whenever a topology change occurs, and we export routing results into the SDN. Our experimental results show that our networking strategy drastically reduces the best path computation time whenever the network of microelements is very large.
机译：渗透计代表了一种能够根据硬件和软件组件的行为管理在异构物理和虚拟基础架构（例如，IOT，EDGE和云节点）上管理互联微量元素的部署和编排的胶水解决方案。通过渗透计的采用是具有挑战性的，但是解决网络问题是一个关键的研究主题，因为在QoS要求方面出现了新问题。在本文中，我们分析了如何利用众所周知的网络解决方案，例如Dijkstra的算法和大数据导向技术，例如Hadoop和Mapreduce，以提供渗透计的有效的Newtorking功能。特别是，我们的目的是在微元素网络的基础上最小化软件定义网络（SDN）中的路由路径计算时间，以及确保我们网络拓扑的全球视图和高水平的动力。要完成此任务，请在发生拓扑更改时，通过基于MapReduce的实现，通过MapReduce的实现，从MapReduce的实现过程中，我们将路由结果导出到SDN中。我们的实验结果表明，每当微量元化网络非常大，我们的网络策略大大减少了最佳路径计算时间。

著录项

  • 来源
    《International journal of parallel programming》 |2021年第3期|347-375|共29页
  • 作者

    Maria Fazio; Alina Buzachis; Antonino Galletta; Antonio Celesti; Jiafu Wan; Antonella Longo; Massimo Villari;

  • 作者单位

    MIFT University of Messina Messina Italy Istituto Nazionale di Alta Matematica (INdAM) 'F. Severi' Gruppo Nazionale per il Calcolo Scientifico (GNCS) Rome Italy;

    MIFT University of Messina Messina Italy;

    MIFT University of Messina Messina Italy;

    MIFT University of Messina Messina Italy Istituto Nazionale di Alta Matematica (INdAM) 'F. Severi' Gruppo Nazionale per il Calcolo Scientifico (GNCS) Rome Italy;

    School of Mechanical and Automotive Engineering South China University of Technology Guangzhou China;

    Dipartimento di Ingegneria dell'Innovazione University of Salento Lecce Italy;

    MIFT University of Messina Messina Italy;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Osmotic computing; SDN; Dijkstra; Hadoop; Map-reduce;

    机译：渗透计;SDN;Dijkstra;hadoop;地图减少;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号