Nothing Special   »   [go: up one dir, main page]

WO2018223945A1 - 一种网络路由发布的方法及装置 - Google Patents

一种网络路由发布的方法及装置 Download PDF

Info

Publication number
WO2018223945A1
WO2018223945A1 PCT/CN2018/089906 CN2018089906W WO2018223945A1 WO 2018223945 A1 WO2018223945 A1 WO 2018223945A1 CN 2018089906 W CN2018089906 W CN 2018089906W WO 2018223945 A1 WO2018223945 A1 WO 2018223945A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
network
route
traversal
listener
Prior art date
Application number
PCT/CN2018/089906
Other languages
English (en)
French (fr)
Inventor
石浩鸿
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to KR1020197038646A priority Critical patent/KR102353585B1/ko
Priority to RU2019143628A priority patent/RU2745420C1/ru
Priority to EP18813690.7A priority patent/EP3637699B1/en
Publication of WO2018223945A1 publication Critical patent/WO2018223945A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H04L41/122—Discovery or management of network topologies of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/20—Hop count for routing purposes, e.g. TTL
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service

Definitions

  • the present disclosure relates to the field of data communication technologies, and in particular, to a method and an apparatus for network route advertisement.
  • L3VPN L3Virtual Private Network
  • MP-BGP Multiprotocol-Border Gateway Protocol
  • the configuration of the architecture is as follows:
  • the neighbor relationship between the PEs (Provider Edges) nodes is configured, so that the PEs learn from the Interior Gateway Protocol (IGP) or statically configured local routes can be advertised to Other PE nodes.
  • the configuration of the neighbor relationship is shared between the L3VPN instances.
  • the route target technology is introduced in the L3VPN configuration. Only two neighbors are introduced.
  • the L3VPN instances have the same RT value to advertise routes to each other.
  • This publishing technology has many years of mature experience in router products, but the configuration is complex, the problem location is difficult, the protocol model is solidified, and the solution update deployment period is long. It has been integrated with the current SDN (Software Defined Network) centralized controller. The plane's thoughts don't match. Especially in the case of complex topologies, with the addition of route reflector technology, the overall solution is more complicated.
  • the method and device for publishing a static network route are provided for the problem that the distribution mode of the distributed architecture is relatively complicated and the deployment period of the solution is long.
  • a method for network route publishing including:
  • a network side route is generated, and the generated network side route is issued to a corresponding node in the network.
  • an apparatus for network route publishing including:
  • the traversing module is configured to traverse the preset network topology according to the maximum hop count according to the local route importing node in the network, and obtain a traversal result list including the traversed listener node and the reflector node;
  • the route issuing module is configured to generate a network side route according to the traversal result list, and advertise the generated network side route to a corresponding node in the network.
  • a computer readable storage medium having stored thereon computer executable instructions that, when executed by a processor, implement a method of network routing publishing as described above.
  • FIG. 1 is a flowchart of a method for network route publishing according to an embodiment of the present disclosure
  • FIG. 2 is a schematic diagram of an apparatus for network route advertisement according to an embodiment of the present disclosure
  • FIG. 3 is an overall architecture diagram of network static route publishing according to an embodiment of the present disclosure
  • FIG. 4 is a networking diagram of a network static route publishing example 1 according to an embodiment of the present disclosure
  • FIG. 5 is a networking diagram of a second example of network static route publishing according to an embodiment of the present disclosure.
  • FIG. 1 is a flowchart of a method for network route publishing according to an embodiment of the present disclosure. As shown in FIG. 1 , the method includes:
  • Step S101 Taking the local route importing node in the network as a starting point, performing traversal along the preset network topology according to the maximum hop count, and obtaining a traversal result list including the traversed listener node and the reflector node;
  • Step S102 Generate a network side route according to the traversal result list, and distribute the generated network side route to a corresponding node in the network.
  • the network topology includes a plurality of nodes; wherein the plurality of nodes includes a core node and an edge node.
  • the maximum hop count is configured by the service level metadata; the listener node is configured for each core node and each edge node by the node level metadata, and the reflector node is set for each core node.
  • the traversal result list including the traversed listener node and the reflector node is obtained by traversing the preset network topology according to the maximum hop count according to the maximum number of hops in the network.
  • the local routing import node in the network sequentially traverses each network branch in a step-by-step manner along the network topology; when traversing each network branch of the network topology, if the traversed node is determined to be listening to the local routing import node The node, then record it into the traversal result list, and complete the traversal according to whether the listener node is a reflector node and whether the maximum hop count arrives; when traversing each network branch of the network topology If the traversed node is determined not to be the listener node of the local route introduction node, the traversal is aborted.
  • completing the traversing includes: determining whether the listener node is a reflector node; and determining that the listener node is a reflector The node continues to traverse with it as a starting point, and records the listener node of the reflector node traversed in the traversal result list until the maximum hop count is reached; if it is determined that the listener node is not a reflector node, the traversal is aborted.
  • the advertised network-side route to the corresponding node in the network includes: if the local route importing node in the network is an edge node, the generated network-side route is advertised to all core nodes in the network; When the local route introduction node in the network is the core node, the generated network side route is advertised to all other core nodes except the core node that is the import node and the edge directly adjacent to the core node that is the import node. node.
  • FIG. 2 is a schematic diagram of a device for issuing a static network route according to an embodiment of the present disclosure.
  • the method includes: a traversal module 201, configured to start with a local route importing node in the network, according to a maximum hop count, Traversing along a preset network topology to obtain a traversal result list including the traversed listener node and the reflector node; the route issuing module 202 is configured to generate a network side route according to the traversal result list, and generate the generated The network side route is advertised to the corresponding node in the network.
  • the network topology includes a plurality of nodes; the plurality of nodes include a core node and an edge node.
  • the maximum hop count is configured by the service level metadata, and the listener node is configured for each core node and each edge node by the node level metadata, and the reflector node is set for each core node.
  • the traversal module 201 includes: a traversal unit, configured to traverse each network branch in a step-by-step manner along the network topology in a local routing import node in the network, and traverse each network branch of the network topology when traversing
  • the arriving node is determined to be the listener node of the local route introduction node, and then recorded into the traversal result list, and according to whether the listener node is a reflector node and whether the maximum hop count arrives, the completion is performed. Traversing, and when traversing each network branch of the network topology, if the traversed node is determined not to be the listener node of the local route import node, the traversal is aborted.
  • FIG. 3 is a schematic diagram of an overall architecture of a network static route advertisement according to an embodiment of the present disclosure. As shown in FIG. 3, the function is composed of two major components: a metadata and a publishing engine.
  • the metadata is divided into two parts, node level metadata and business level metadata.
  • the node-level metadata is in one-to-one correspondence with the core node or the edge node, and is configured for each core node or edge node to describe the policy control of the node during the route publishing process.
  • Service-level metadata is configured for the entire L3VPN and is used to describe the publishing policy of the entire service.
  • the node level metadata includes: a reflector node, an upstream node list, a downstream node list, a listener node list, and an IP FRR (Internet Protocol Fast Reroute) switch.
  • IP FRR Internet Protocol Fast Reroute
  • the publishing engine is a main implementation part of the entire routing device, and has a fixed publishing algorithm, and in the process of executing the publishing algorithm, the publishing engine reads the metadata information, and fine-tunes the publishing process according to the policy recorded therein, thereby Adapt to different application scenarios.
  • the publishing engine does not upgrade, but only the metadata configuration is modified to complete the deployment of the new release process.
  • the publishing engine is subject to the above metadata during the route publishing process.
  • the process is as follows:
  • the PE node of the L3VPN is used as a vertex, and the peer binding relationship is an edge to construct a network topology diagram.
  • the breadth-first traversal is performed. During the traversal process, the hop count is counted, and the maximum hop value set in the service-level metadata is determined at any time. If it is reached, the current branch is aborted. Traversal, continue the traversal of other branches according to the breadth-first principle, if all branches have been traversed completely, the algorithm is aborted.
  • the output of the traversal is a subgraph of the original graph, and each node in the subgraph is a candidate node that will generate a network side route.
  • the starting point is special. If there are two starting points and the IP FRR switch is turned on, the starting point should also generate the network side route; otherwise, the starting point has no new route except the local route input by the algorithm.
  • the network side route is generated on the other nodes according to the number of upstream nodes recorded.
  • the active/standby mode select the two upstream nodes with the lowest number of hops to generate a primary-slave network-side route.
  • the active/standby routes are determined according to a certain hash or by the external active-standby role list.
  • the foregoing solution of the embodiment of the present disclosure may also be extended to the public network IP route without the L3VPN.
  • the structure of the entire device is still composed of metadata and a publishing engine, where the service level metadata is replaced with network level metadata. Only one copy is configured for the entire network.
  • the publishing engine may not be based on the peer tunnel binding relationship, but the peer configuration between the network nodes, or other configurations that express the connection relationship between the nodes, may be included in the application of the embodiment of the present disclosure. range.
  • FIG. 4 is a networking diagram of a network static route publishing example 1 according to an embodiment of the present disclosure. As shown in FIG. 4, it is assumed that the publishing requirements are as follows:
  • Nodes 3, 4, 5, 6, 7, and 8 are defined as core nodes, and nodes 1, 2, 9, and a are defined as edge nodes.
  • Local routes introduced at edge nodes are advertised to all core nodes, but are not released to other nodes.
  • the edge node, the local route introduced at the core node is to be advertised to all other core nodes and the edge nodes directly adjacent to it, but not to the edge nodes that are not directly adjacent.
  • the listener nodes of 1, 2, 9, and a are all set to 3, 4, 5, 6, 7, and 8;
  • the IP FRR switches of all nodes are turned off;
  • the upstream nodes of all nodes are not set;
  • the downstream nodes of all nodes are not set;
  • the local route is introduced on nodes 1 and 2.
  • the release process is as follows:
  • the PE node of the L3VPN is used as a vertex, and the peer binding relationship is an edge, and a network topology diagram is constructed, as shown in FIG. 4 .
  • Node 3 has three upstream nodes: 1, 2, and 4, which take two smaller hops to generate two network-side routes. The next hop points to 1, 2, and the active/standby role is determined according to the hash algorithm. Request input determination;
  • Node 4 has three upstream nodes: 1, 2, and 3, which take two smaller hops to generate two network-side routes. The next hop points to 1, 2, and the active/standby role is determined according to the hash algorithm. Request input determination;
  • Nodes 5, 6, 7, and 8 have two upstream nodes: 3 and 4. Therefore, two network-side routes are generated. The next hops are respectively directed to 3 and 4.
  • the active and standby roles are determined according to the hash algorithm, and can also be based on external requests. Enter OK.
  • the graph on which the traversal is based is the same as when 1 and 2 are the starting points, and no repeated generation is required.
  • Nodes 1 and 2 have two upstream nodes: 3 and 4, which generate two network-side routes. The next hops point to 3 and 4 respectively.
  • the active and standby roles are determined according to the hash algorithm, and can also be determined according to external request input.
  • Nodes 3 and 4 are the starting nodes, and the ip frr switch is not turned on, so no network side route is generated.
  • Node 5 has five upstream nodes: 3, 4, 6, 7, and 8.
  • the two hops are the smallest: 3 and 4, and two network-side routes are generated.
  • the next hops point to 3 and 4 respectively.
  • the active and standby roles are based on The hash algorithm determines, and can also be determined according to an external request input;
  • Node 6 has five upstream nodes: 3, 4, 5, 7, and 8.
  • the two hops are the smallest: 3 and 4, and two network-side routes are generated.
  • the next hops are respectively directed to 3 and 4, and the active and standby roles are based on
  • the hash algorithm determines, and can also be determined according to an external request input;
  • Node 7 has five upstream nodes: 3, 4, 6, 5, and 8.
  • the two hops are the smallest: 3 and 4, and two network-side routes are generated.
  • the next hops are respectively directed to 3 and 4.
  • the active and standby roles are based on The hash algorithm determines, and can also be determined according to an external request input;
  • Node 8 has five upstream nodes: 3, 4, 6, 7, and 5.
  • the two hops are the smallest: 3 and 4, and two network-side routes are generated.
  • the next hops point to 3 and 4 respectively.
  • the hash algorithm determines that it can also be determined based on external request input.
  • a computer readable storage medium having stored thereon computer executable instructions that, when executed by a processor, implement a method of network routing publishing as described above.
  • the solution provided by the embodiment of the present disclosure has the following advantages: 1) the publishing scope and the publishing rule can be precisely controlled, and are applicable to multiple scenarios, including complex networking scenarios; 2) the software implementation algorithm of the publishing engine is unified, and does not need to be targeted to the scenario. Customization, customization for the scene is only reflected in the metadata configuration level. When supporting the new scenario, only the metadata configuration needs to be changed, and the engine software does not need to be upgraded. That is, the metadata is configured to customize the publishing rule to more flexibly and quickly adapt to the L3VPN route publishing algorithm of multiple networking scenarios.
  • computer storage medium includes volatile and nonvolatile, implemented in any method or technology for storing information, such as computer readable instructions, data structures, program modules or other data. Sex, removable and non-removable media.
  • Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridge, magnetic tape, magnetic disk storage or other magnetic storage device, or may Any other medium used to store the desired information and that can be accessed by the computer.
  • communication media typically includes computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and can include any information delivery media. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

公开了一种网络静态路由发布的方法及装置，所述方法包括：以所述网络中本地路由引入节点为起点，按照最大跳数，沿预置构建的网络拓扑进行遍历，得到包含遍历到的倾听者节点和反射器节点的遍历结果列表(S101)；根据所述遍历结果列表，生成网络侧路由，并将所生成的网络侧路由发布给网络中的相应节点(S102)。

Description

一种网络路由发布的方法及装置 技术领域
本公开涉及数据通讯技术领域，特别涉及一种网络路由发布的方法及装置。
背景技术
现如今，实现L3VPN(L3Virtual Private Network，三层虚拟专用网)路由发布的方法是路由器领域的MP-BGP(Multiprotocol-Border Gateway Protocol，多协议-边界网关协议)协议，这是一种基于分布式架构的发布方式，通过配置PE(Provider Edge，提供商边缘设备)节点间的邻居关系，使得各PE节点从IGP(Interior Gateway Protocol，内部网关协议)学习或者通过静态方式配置的本地路由可以发布到其他PE节点。由于邻居关系的配置在各个L3VPN实例间是共享的，为了控制每个L3VPN实例在一对邻居关系间是否发布路由，在L3VPN配置中引入了RT(Route Target，路由目标)技术，只有两个邻居间的L3VPN实例间拥有相同的RT值，才能相互发布路由。这种发布技术在路由器产品中有着多年的成熟经验，但是配置复杂，问题定位困难，协议模型固化，方案更新部署周期长，已经与现如今SDN(Software Defined Network，软件定义网络)集中式控制器平面的思想不符。特别是在复杂拓扑的情况下，要辅以路由反射器技术，整体方案更加复杂。
发明概述
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
针对分布式架构的发布方式比较复杂且方案更新部署周期长的问题，本公开实施例提供了一种网络静态路由发布的方法及装置。
根据本公开实施例，提供了一种网络路由发布的方法，包括：
以所述网络中本地路由引入节点为起点，按照最大跳数，沿预置构建的 网络拓扑进行遍历，得到包含遍历到的倾听者节点和反射器节点的遍历结果列表；
根据所述遍历结果列表，生成网络侧路由，并将所生成的网络侧路由发布给网络中的相应节点。
根据本公开实施例，提供了一种网络路由发布的装置，包括：
遍历模块，设置为以所述网络中本地路由引入节点为起点，按照最大跳数，沿预置构建的网络拓扑进行遍历，得到包含遍历到的倾听者节点和反射器节点的遍历结果列表；
路由发布模块，设置为根据所述遍历结果列表，生成网络侧路由，并将所生成的网络侧路由发布给网络中的相应节点。
根据本公开实施例，提供了一种计算机可读存储介质，其上存储有计算机可执行指令，所述计算机可执行指令被处理器执行时实现如上所述的网络路由发布的方法。
在阅读并理解了附图和详细描述后，可以明白其他方面。
附图概述
图1是本公开实施例提供的一种网络路由发布的方法流程图；
图2是本公开实施例提供的一种网络路由发布的装置示意图；
图3是本公开实施例提供的网络静态路由发布整体架构图；
图4是本公开实施例提供的网络静态路由发布示例一的组网图；
图5是本公开实施例提供的网络静态路由发布示例二的组网图。
详述
以下结合附图对本公开的示例性实施例进行详细说明，应当理解，以下所说明的示例性实施例仅用于说明和解释本公开，并不用于限定本公开。
图1是本公开实施例提供的一种网络路由发布的方法流程图，如图1所示，包括：
步骤S101：以所述网络中本地路由引入节点为起点，按照最大跳数，沿预置构建的网络拓扑进行遍历，得到包含遍历到的倾听者节点和反射器节点的遍历结果列表；
步骤S102：根据所述遍历结果列表，生成网络侧路由，并将所生成的网络侧路由发布给网络中的相应节点。
其中，所述网络拓扑包括多个节点；其中，所述多个节点包括核心节点和边缘节点。
其中，通过业务级元数据配置所述最大跳数；通过节点级元数据为每个核心节点和每个边缘节点配置倾听者节点，为每个核心节点设置反射器节点。
其中，所述的以所述网络中本地路由引入节点为起点，按照最大跳数，沿预置构建的网络拓扑进行遍历，得到包含遍历到的倾听者节点和反射器节点的遍历结果列表包括：网络中本地路由引入节点沿网络拓扑按照逐级跳方式依次遍历每个网络分支；在遍历所述网络拓扑的每个网络分支时，若遍历到的节点被判断为所述本地路由引入节点的倾听者节点，则将其记录到遍历结果列表中，并根据该倾听者节点是否为反射器节点以及所述最大跳数是否到达，完成所述遍历；在遍历所述网络拓扑的每个网络分支时，若遍历到的节点被判断为不是所述本地路由引入节点的倾听者节点，则中止遍历。
其中，所述的根据该倾听者节点是否为反射器节点以及所述最大跳数是否到达，完成所述遍历包括：判断该倾听者节点是否为反射器节点；若判断该倾听者节点为反射器节点，则以其为起点继续遍历，在并遍历结果列表中记录遍历到的该反射器节点的倾听者节点，直至达到最大跳数；若判断该倾听者节点不是反射器节点，则中止遍历。
其中，所述将所生成的网络侧路由发布给网络中的相应节点包括：若网络中本地路由引入节点为边缘节点时，则将所生成的网络侧路由发布给网络中的所有核心节点；若网络中本地路由引入节点为核心节点时，则将所生成的网络侧路由发布给网络中的除去作为引入节点的核心节点外的其他所有核心节点和与作为引入节点的核心节点直接相邻的边缘节点。
图2是本公开实施例提供的一种网络静态路由发布的装置示意图，如图2所示，包括：遍历模块201，设置为以所述网络中本地路由引入节点为起点，按照最大跳数，沿预置构建的网络拓扑进行遍历，得到包含遍历到的倾听者节点和反射器节点的遍历结果列表；路由发布模块202，设置为根据所述遍历结果列表，生成网络侧路由，并将所生成的网络侧路由发布给网络中的相应节点。
其中，所述网络拓扑包括多个节点；所述多个节点包括核心节点和边缘节点。
其中，通过业务级元数据配置所述最大跳数，以及通过节点级元数据为每个核心节点和每个边缘节点配置倾听者节点，为每个核心节点设置反射器节点。
其中，所述遍历模块201包括：遍历单元，设置为网络中本地路由引入节点沿网络拓扑按照逐级跳方式依次遍历每个网络分支，在遍历所述网络拓扑的每个网络分支时，若遍历到的节点被判断为所述本地路由引入节点的倾听者节点，则将其记录到遍历结果列表中，并根据该倾听者节点是否为反射器节点以及所述最大跳数是否到达，完成所述遍历，以及在遍历所述网络拓扑的每个网络分支时，若遍历到的节点被判断为不是所述本地路由引入节点的倾听者节点，则中止遍历。
图3是本公开实施例提供的网络静态路由发布整体架构图，如图3所示，从功能上由两大部分组成：元数据和发布引擎。
其中，元数据分为两部分，节点级元数据和业务级元数据。节点级元数据与核心节点或边缘节点一一对应，要针对每一个核心节点或边缘节点进行配置，用于描述该节点在路由发布过程中的策略控制。业务级元数据针对整个L3VPN只配置一份，用于描述整个业务的发布策略。例如，所述节点级元数据包括：是否反射器节点、上游节点列表、下游节点列表、倾听者节点列表以及IP FRR(Internet Protocol Fast Reroute，网络协议快速重路由)开关。所述业务级元数据主要包括：路由发布的最大跳数。
其中，发布引擎是整个路由发布装置的主体实现部分，有固定的发布算法，并且在发布算法被执行过程中，发布引擎会读取元数据信息，根据其中 记载的策略对发布过程进行微调，从而适应不同的应用场景。当应用场景发生变化时，发布引擎不升级，而只对元数据配置进行修改，即可完成新的发布流程的部署。
发布引擎在路由发布过程中会受上述元数据的制约，其过程如下：
1)首先，以L3VPN的PE节点为顶点，peer绑定关系为边，构造一个网络拓扑图。
2)以本地路由引入节点为起点，基于图做广度优先遍历，遍历过程中要对跳数计数，随时判断是否达到业务级元数据中设定的最大跳数值，若达到，则“中止当前分支的遍历，按广度优先原则继续其他分支的遍历，若所有分支已遍历完全，算法中止”。
3)遍历中每到达一个节点，在决定是否继续遍历前，要判断该节点是否是起点的倾听者节点，若不是倾听者节点，该节点不出现在遍历结果中，“中止当前分支的遍历，按广度优先原则继续其他分支的遍历，若所有分支已遍历完全，算法中止”。
4)遍历中每到达一个节点，在决定是否继续遍历前，要判断该节点是否反射器，不是反射器，则“中止当前分支的遍历，按广度优先原则继续其他分支的遍历，若所有分支已遍历完全，算法中止”；是反射器，则判断上一个节点是否该反射器的上游节点，若不在，则也“中止当前分支的遍历，按广度优先原则继续其他分支的遍历，若所有分支已遍历完全，算法中止”；若在，则继续遍历。注：起点不需要是反射器。
5)遍历中沿反射器遍历相邻节点时，还要判断相邻节点是否反射器的下游节点，若是，才遍历该节点，否则，不遍历该节点，继续尝试其他节点。(注：元数据中如果上游节点列表为空，则说明所有相邻节点都可以做该反射器节点的上游节点；下游节点也一样。)
6)遍历中，每遍历节点一次，都记录一个上游节点，相同的上游节点不需重复记录。另外还要记录本次到达该节点距离起点的跳数。相同上游节点合并时，跳数取较小的值。
7)对于两个节点同时引入本地路由的情况，则以每个节点为起点，重复 两次上述过程。
8)遍历的输出是一个原始图的子图，子图中每个节点都是即将生成网络侧路由的候选节点。起点比较特殊，若起点有两个，且打开了IP FRR开关，则起点也要生成网络侧路由；否则，起点除了算法输入的本地路由外，没有新路由产生。
9)其他节点上根据记录的上游节点数，生成网络侧路由。
10)对于主备方式，选取跳数最小的两个上游节点，生成一主一备网络侧路由，主备路由按照某种原则hash或者由外部传入的主备角色列表确定。
本公开实施例的上述方案也可以拓展到不带L3VPN的公网IP路由的发布，整个装置的结构仍是由元数据和发布引擎构成，其中，业务级元数据要替换为网络级元数据，整个网络只配置一份。发布引擎在构造网络拓扑图的时候，依据的可能不是peer隧道绑定关系，而是网络节点间的对等体配置，或者其他表达节点间连接关系的配置，都可以纳入本公开实施例的适用范围。
图4是本公开实施例提供的网络静态路由发布示例一的组网图，如图4所示，假定发布需求如下：
节点3、4、5、6、7、8定义为核心节点，节点1、2、9、a定义为边缘节点，在边缘节点引入的本地路由要发布给所有的核心节点，但不发布给其他的边缘节点，在核心节点引入的本地路由要发布给所有其他的核心节点和与其直接相邻的边缘节点，但是不发布给不直接相邻的边缘节点。
基于上述需求，本公开的应用情况如下：
节点级元数据配置：
3、4的倾听者节点均设置为1、2、5、6、7、8；
5、6的倾听者节点均设置为a、3、4、7、8；
7、8的倾听者节点均设置为9、3、4、5、6；
1、2、9、a的倾听者节点均设置为3、4、5、6、7、8；
3、4、5、6、7、8设置为反射器；
所有节点的IP FRR开关都关闭；
所有节点的上游节点均不设置；
所有节点的下游节点均不设置；
业务级元数据配置：最大跳数：2
先以在1、2节点引入本地路由为例。如图4所示，发布流程如下：
11)首先，以L3VPN的PE节点为顶点，peer绑定关系为边，构造一个网络拓扑图，如图4所示。
12)先以节点1为起点，基于图做广度优先遍历，第1跳遍历到3、4，判断3、4是1的倾听者节点，将3、4压入遍历结果列表中。判断3、4是反射器，且总跳数还未达到最大跳数2，继续遍历。
13)以3为起点，遍历到4、5、6、7、8，由于它们均为节点1的倾听者节点，也都与节点3满足互为上下游节点的要求(所有节点的上下游节点都未设置)，遂将它们压入遍历结果列表中。由于总跳数已经达到最大跳数2，遍历中止。
14)以4为起点，重复步骤13)。
15)再以节点2为起点，重复12)-14)步骤。
16)遍历过程结束，根据遍历结果生成网络侧路由。如下：
节点3有三个上游节点：1、2、4，取跳数较小的两个，生成两条网络侧路由，下一跳分别指向1、2，主备角色根据hash算法确定，也可以根据外部请求输入确定；
节点4有三个上游节点：1、2、3，取跳数较小的两个，生成两条网络侧路由，下一跳分别指向1、2，主备角色根据hash算法确定，也可以根据外部请求输入确定；
节点5、6、7、8都有两个上游节点：3和4，所以都生成两条网络侧路由，下一跳分别指向3、4，主备角色根据hash算法确定，也可以根据外部请求输入确定。
再以在3、4节点引入本地路由为例。如图5所示，发布流程如下：
21)遍历所基于的图与1、2为起点时一样，不用重复生成。
22)先以节点3为起点，基于图做广度优先遍历，第1跳遍历到1、2、4、5、6、7、8，由于4不是3的倾听者节点，将其提出，将剩下的1、2、5、6、7、8压入遍历结果列表中。
23)由于1、2不是反射器节点，所以不需要继续遍历。
24)5是反射器节点，继续遍历，遍历到4、6、7、8、a，由于a不是3的倾听者节点，将其剔除，将剩余的4、6、7、8压入遍历结果列表中。
25)对节点6、7、8重复步骤24)。
26)跳数已达最大跳数，遍历结束。
27)再以节点4为起点，重复步骤22)-26)。
28)整个遍历过程结束，根据遍历结果生成网络侧路由。如下：
节点1、2都有两个上游节点：3、4，生成两条网络侧路由，下一跳分别指向3、4，主备角色根据hash算法确定，也可以根据外部请求输入确定；
节点3、4是起始节点，没有打开ip frr开关，所以不生成网络侧路由；
节点5有5个上游节点：3、4、6、7、8，取跳数最小的两个：3和4，生成两条网络侧路由，下一跳分别指向3和4，主备角色根据hash算法确定，也可以根据外部请求输入确定；
节点6有5个上游节点：3、4、5、7、8，取跳数最小的两个：3和4，生成两条网络侧路由，下一跳分别指向3和4，主备角色根据hash算法确定，也可以根据外部请求输入确定；
节点7有5个上游节点：3、4、6、5、8，取跳数最小的两个：3和4，生成两条网络侧路由，下一跳分别指向3和4，主备角色根据hash算法确定，也可以根据外部请求输入确定；
节点8有5个上游节点：3、4、6、7、5，取跳数最小的两个：3和4，生成两条网络侧路由，下一跳分别指向3和4，主备角色根据hash算法确定，也可以根据外部请求输入确定。
根据本公开实施例，提供了一种计算机可读存储介质，其上存储有计算机可执行指令，所述计算机可执行指令被处理器执行时实现如上所述的网络路由发布的方法。
根据本公开实施例提供的方案，具有以下优点：1)发布范围和发布规则可以精确控制，适用于多种场景，包括复杂组网场景；2)发布引擎的软件实现算法统一，不需要针对场景定制，针对场景的定制仅体现在元数据配置层面，支持新场景时，仅需要改变元数据配置，不需要升级引擎软件。即，通过元数据配置，对发布规则进行定制，以更加灵活快捷地适应多种组网场景的L3VPN路由发布算法。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统、装置中的功能模块/单元可以被实施为软件、固件、硬件及其适当的组合。在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些组件或所有组件可以被实施为由处理器，如数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
尽管上文对本公开进行了详细说明，但是本公开不限于此，本技术领域 技术人员可以根据本公开的原理进行各种修改。因此，凡按照本公开原理所作的修改，都应当理解为落入本公开的保护范围。

Claims (11)

  1. 一种网络路由发布的方法，包括：
    以所述网络中本地路由引入节点为起点，按照最大跳数，沿预置构建的网络拓扑进行遍历，得到包含遍历到的倾听者节点和反射器节点的遍历结果列表(S101)；
    根据所述遍历结果列表，生成网络侧路由，并将所生成的网络侧路由发布给网络中的相应节点(S102)。
  2. 根据权利要求1所述的方法，其中，所述网络拓扑包括多个节点；其中，所述多个节点包括核心节点和边缘节点。
  3. 根据权利要求2所述的方法，其中，通过业务级元数据配置所述最大跳数；通过节点级元数据为每个核心节点和每个边缘节点配置倾听者节点，为每个核心节点设置反射器节点。
  4. 根据权利要求1所述的方法，其中，所述的以所述网络中本地路由引入节点为起点，按照最大跳数，沿预置构建的网络拓扑进行遍历，得到包含遍历到的倾听者节点和反射器节点的遍历结果列表(S101)包括：
    网络中本地路由引入节点沿网络拓扑按照逐级跳方式依次遍历每个网络分支；
    在遍历所述网络拓扑的每个网络分支时，若遍历到的节点被判断为所述本地路由引入节点的倾听者节点，则将其记录到遍历结果列表中，并根据该倾听者节点是否为反射器节点以及所述最大跳数是否到达，完成所述遍历；
    在遍历所述网络拓扑的每个网络分支时，若遍历到的节点被判断为不是所述本地路由引入节点的倾听者节点，则中止遍历。
  5. 根据权利要求4所述的方法，其中，所述的根据该倾听者节点是否为反射器节点以及所述最大跳数是否到达，完成所述遍历包括：
    判断该倾听者节点是否为反射器节点；
    若判断该倾听者节点为反射器节点，则以其为起点继续遍历，在并遍历结果列表中记录遍历到的该反射器节点的倾听者节点，直至达到最大跳数；
    若判断该倾听者节点不是反射器节点，则中止遍历。
  6. 根据权利要求2所述的方法，其中，所述将所生成的网络侧路由发布给网络中的相应节点包括：
    若网络中本地路由引入节点为边缘节点时，则将所生成的网络侧路由发布给网络中的所有核心节点；
    若网络中本地路由引入节点为核心节点时，则将所生成的网络侧路由发布给网络中的除去作为引入节点的核心节点外的其他所有核心节点和与作为引入节点的核心节点直接相邻的边缘节点。
  7. 一种网络路由发布的装置，包括：
    遍历模块(201)，设置为以所述网络中本地路由引入节点为起点，按照最大跳数，沿预置构建的网络拓扑进行遍历，得到包含遍历到的倾听者节点和反射器节点的遍历结果列表；
    路由发布模块(202)，设置为根据所述遍历结果列表，生成网络侧路由，并将所生成的网络侧路由发布给网络中的相应节点。
  8. 根据权利要求7所述的装置，其中，所述网络拓扑包括多个节点；其中，所述多个节点包括核心节点和边缘节点。
  9. 根据权利要求7所述的装置，其中，通过业务级元数据配置所述最大跳数；通过节点级元数据为每个核心节点和每个边缘节点配置倾听者节点，为每个核心节点设置反射器节点。
  10. 根据权利要求7所述的装置，其中，所述遍历模块(201)包括：
    遍历单元，设置为网络中本地路由引入节点沿网络拓扑按照逐级跳方式依次遍历每个网络分支，在遍历所述网络拓扑的每个网络分支时，若遍历到的节点被判断为所述本地路由引入节点的倾听者节点，则将其记录到遍历结果列表中，并根据该倾听者节点是否为反射器节点以及所述最大跳数是否到达，完成所述遍历，以及在遍历所述网络拓扑的每个网络分支时，若遍历到的节点被判断为不是所述本地路由引入节点的倾听者节点，则中止遍历。
  11. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令被处理器执行时实现权利要求1-6中任一项所述的方法。
PCT/CN2018/089906 2017-06-05 2018-06-05 一种网络路由发布的方法及装置 WO2018223945A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
KR1020197038646A KR102353585B1 (ko) 2017-06-05 2018-06-05 네트워크 라우트 퍼블리싱 방법 및 장치
RU2019143628A RU2745420C1 (ru) 2017-06-05 2018-06-05 Способ и устройство для отправки сетевого маршрута
EP18813690.7A EP3637699B1 (en) 2017-06-05 2018-06-05 Method and device for publishing network route

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710415056.7A CN108989222B (zh) 2017-06-05 2017-06-05 一种网络路由发布的方法及装置
CN201710415056.7 2017-06-05

Publications (1)

Publication Number Publication Date
WO2018223945A1 true WO2018223945A1 (zh) 2018-12-13

Family

ID=64501300

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/089906 WO2018223945A1 (zh) 2017-06-05 2018-06-05 一种网络路由发布的方法及装置

Country Status (5)

Country Link
EP (1) EP3637699B1 (zh)
KR (1) KR102353585B1 (zh)
CN (1) CN108989222B (zh)
RU (1) RU2745420C1 (zh)
WO (1) WO2018223945A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115865697A (zh) * 2022-11-28 2023-03-28 浙江中控技术股份有限公司 网络拓扑信息处理方法、装置、电子设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104104531A (zh) * 2013-04-07 2014-10-15 中兴通讯股份有限公司 设置l3vpn网络侧路由的方法及装置
US9246804B1 (en) * 2012-11-30 2016-01-26 Hewlett Packard Enterprise Development Lp Network routing
CN105337870A (zh) * 2014-08-15 2016-02-17 杭州华三通信技术有限公司 一种路由发布方法和装置
CN105681202A (zh) * 2014-11-19 2016-06-15 中兴通讯股份有限公司 三层虚拟专用网络中路由的生成方法及网管系统

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6910090B1 (en) * 1999-09-21 2005-06-21 Sony Corporation Maintaining communications in a bus bridge interconnect
KR20010039083A (ko) * 1999-10-28 2001-05-15 서평원 망관리 시스템 상에서의 망 구성도 탐색 방법
CN1238991C (zh) * 2002-03-28 2006-01-25 华为技术有限公司 一种网络拓扑信息收集方法
US7848278B2 (en) * 2006-10-23 2010-12-07 Telcordia Technologies, Inc. Roadside network unit and method of organizing, managing and maintaining local network using local peer groups as network groups
KR101055416B1 (ko) * 2007-02-04 2011-08-08 아주대학교산학협력단 무선 센서 네트워크에서의 라우팅 경로 설정 방법 및 이를 수행하기 위한 장치
CN101277252A (zh) * 2007-03-30 2008-10-01 迈普（四川）通信技术有限公司 多分支Trie树的遍历方法
CN100514918C (zh) * 2007-10-15 2009-07-15 清华大学 一种ip主干网的拓扑发现方法
US8320361B2 (en) * 2009-02-27 2012-11-27 Cisco Technology, Inc. Advertising alternate paths at border gateway protocol route reflectors
US8467403B2 (en) * 2010-04-29 2013-06-18 Cisco Technology, Inc. Coordinated updating of forwarding information bases in a multistage packet switching device
CN102131268A (zh) * 2011-04-26 2011-07-20 上海左岸芯慧电子科技有限公司 一种gem路由选择的改进方法
CN102195883A (zh) * 2011-05-23 2011-09-21 北京星网锐捷网络技术有限公司 组播路由确定方法、组播报文转发方法及装置
US8824274B1 (en) * 2011-12-29 2014-09-02 Juniper Networks, Inc. Scheduled network layer programming within a multi-topology computer network
US9641422B2 (en) * 2013-10-17 2017-05-02 Telefonaktiebolaget Lm Ericsson (Publ) X2 son for LTE networks through automated X2 address discovery
US9660897B1 (en) * 2013-12-04 2017-05-23 Juniper Networks, Inc. BGP link-state extensions for segment routing
CN105282025A (zh) * 2014-07-11 2016-01-27 中兴通讯股份有限公司 一种确定端到端路由的方法及装置
US10015073B2 (en) * 2015-02-20 2018-07-03 Cisco Technology, Inc. Automatic optimal route reflector root address assignment to route reflector clients and fast failover in a network environment

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9246804B1 (en) * 2012-11-30 2016-01-26 Hewlett Packard Enterprise Development Lp Network routing
CN104104531A (zh) * 2013-04-07 2014-10-15 中兴通讯股份有限公司 设置l3vpn网络侧路由的方法及装置
CN105337870A (zh) * 2014-08-15 2016-02-17 杭州华三通信技术有限公司 一种路由发布方法和装置
CN105681202A (zh) * 2014-11-19 2016-06-15 中兴通讯股份有限公司 三层虚拟专用网络中路由的生成方法及网管系统

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3637699A4 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115865697A (zh) * 2022-11-28 2023-03-28 浙江中控技术股份有限公司 网络拓扑信息处理方法、装置、电子设备及存储介质

Also Published As

Publication number Publication date
KR102353585B1 (ko) 2022-01-19
EP3637699B1 (en) 2023-03-08
CN108989222B (zh) 2022-02-25
CN108989222A (zh) 2018-12-11
RU2745420C1 (ru) 2021-03-25
EP3637699A4 (en) 2021-03-10
KR20200012950A (ko) 2020-02-05
EP3637699A1 (en) 2020-04-15

Similar Documents

Publication Publication Date Title
US11716202B2 (en) Techniques for secure blockchain routing
US10116593B1 (en) Transmission and storage of routing path information and routing topology information using a single routing protocol
CN102142970B (zh) 二层以太网络的组播树构建方法和网络节点设备
CN105024844B (zh) 一种计算跨域路由的方法、服务器以及系统
US9246794B2 (en) Label distribution and route installation in a loop-free routing topology using routing arcs
US20150016242A1 (en) Method and Apparatus for Optimized LFA Computations by Pruning Neighbor Shortest Path Trees
US9363179B2 (en) Multi-publisher routing protocol for named data networks
CN100372337C (zh) 一种实现跨域约束路由的选路方法
US10404576B2 (en) Constrained shortest path determination in a network
WO2018103737A1 (zh) 一种路由建立方法和装置
WO2018103738A1 (zh) 一种路由建立方法和装置
WO2010127527A1 (zh) 在邻接节点间多边条件下实现k优路径算法的方法及装置
CN113973026B (zh) 一种站点互连方法、中央控制器和路由反射器
WO2021004277A1 (zh) 路由管理方法、装置、网络设备和可读存储介质
CN108243102B (zh) 一种快速重路由的实现方法和pe设备
US20160315855A1 (en) Open Shortest Path First for Temporal Tunnel Services
WO2018223945A1 (zh) 一种网络路由发布的方法及装置
WO2016123904A1 (zh) 路由收敛方法、装置及虚拟专用网vpn系统
US20190334814A1 (en) Path establishment method and device, and network node
CN110971521A (zh) 路由路径计算方法、系统、设备及计算机可读存储介质
KR20160092382A (ko) 계층화된 도메인 기반의 네트워크 구조에서 라우터의 도메인 라우팅 테이블 관리 방법
JP3977791B2 (ja) マルチキャスト転送経路設定方法および装置
CN104065578A (zh) 一种基于ason光网络的ip路由处理方法和装置
WO2018113460A1 (zh) 一种多层lsp控制方法和装置
US20200084158A1 (en) Methods and apparatus for path computation in a telecommunications network

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18813690

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 20197038646

Country of ref document: KR

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2018813690

Country of ref document: EP

Effective date: 20200107