Open Shortest Path First extension for the support of multiarea networks with arbitrary topologies

IF 1.3 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

IET Networks Pub Date : 2024-01-23 DOI:10.1049/ntw2.12112

Xavier Gomes, João Fonseca, Rui Valadas

引用次数: 0

Abstract

Open Shortest Path First (OSPF) currently supports multiarea networking with two severe limitations: the multiarea topology is restricted to a two-level hierarchy, and globally optimal routing may not be achieved. An OSPF extension that overcomes these limitations is proposed by introducing a routing overlay for the dissemination of multiarea routing information. It applies to both OSPFv2 (IPv4) and OSPFv3 (IPv6) and is transparent to area-internal routers. The extension was fully implemented and tested, and the results show that the added functionality is completely achieved, at the cost of a small penalty in terms of convergence times for small networks.

Abstract Image

查看原文本刊更多论文

开放式最短路径优先扩展，支持任意拓扑结构的多区域网络

开放式最短路径优先（OSPF）目前支持多区域联网，但有两个严重的局限性：多区域拓扑结构仅限于两级层次结构，而且可能无法实现全局最优路由选择。本文提出了一种 OSPF 扩展，通过引入路由覆盖来传播多区域路由信息，从而克服了这些局限性。它适用于 OSPFv2（IPv4）和 OSPFv3（IPv6），对区域内部路由器是透明的。对该扩展进行了全面实施和测试，结果表明，新增功能已完全实现，但小型网络的收敛时间会略有减少。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IET Networks COMPUTER SCIENCE, INFORMATION SYSTEMS-

CiteScore

5.00

自引率

0.00%

发文量

审稿时长

33 weeks

期刊介绍： IET Networks covers the fundamental developments and advancing methodologies to achieve higher performance, optimized and dependable future networks. IET Networks is particularly interested in new ideas and superior solutions to the known and arising technological development bottlenecks at all levels of networking such as topologies, protocols, routing, relaying and resource-allocation for more efficient and more reliable provision of network services. Topics include, but are not limited to: Network Architecture, Design and Planning, Network Protocol, Software, Analysis, Simulation and Experiment, Network Technologies, Applications and Services, Network Security, Operation and Management.