WO2009117948A1 - 网络拓扑变化的通告方法及装置 - Google Patents

网络拓扑变化的通告方法及装置 Download PDF

Info

Publication number
WO2009117948A1
WO2009117948A1 PCT/CN2009/070985 CN2009070985W WO2009117948A1 WO 2009117948 A1 WO2009117948 A1 WO 2009117948A1 CN 2009070985 W CN2009070985 W CN 2009070985W WO 2009117948 A1 WO2009117948 A1 WO 2009117948A1
Authority
WO
WIPO (PCT)
Prior art keywords
topology change
network
router
network topology
change notification
Prior art date
Application number
PCT/CN2009/070985
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 华为技术有限公司
Publication of WO2009117948A1 publication Critical patent/WO2009117948A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12Discovery or management of network topologies
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/03Topology update or discovery by updating link state protocols

Definitions

  • the present invention relates to the field of network topology structure, and in particular to a method and apparatus for advertising network topology changes. Background technique
  • IGP Interior Gateway Protocol
  • FIG. 1 is a schematic diagram of a network topology of the prior art. As shown in FIG. 1, when the link between the router 2 and the router 3 changes, the router 1 must pass through all the internals of the router adjacent to the router 2 to be perceived. After the gateway protocol layer analyzes, it forwards it to the router adjacent to the router, and advertises the network topology change until the message is transmitted to Router 1. Router 1 then performs routing calculations based on topology changes, selecting paths that can reach or pass through destination router 3, thus reducing the convergence speed so that the convergence of router 1 is in seconds.
  • the prior art solution 1 improves the route calculation speed of the local machine by improving the route calculation algorithm, thereby achieving the requirement of improving the convergence speed.
  • the first technical solution is a technical solution combining a incremental route calculation (I-SPF), a partial route calculation (PRC), and a route prioritization convergence technique.
  • Incremental route calculations only compute a portion of the changed route at a time, rather than recalculating all routes.
  • the calculation of the route using the shortest path (Dijkstra) algorithm is defined in the International Organization for Standardization (ISO) 10589.
  • ISO International Organization for Standardization
  • the algorithm needs to be heavy. All nodes in the new computing network have a long calculation time and occupy too much central processing unit (CPU) resources, which affects the convergence speed of the entire network.
  • Incremental route calculation improves the algorithm. Except for the first calculation, all the nodes need to be calculated. In the future, only the nodes affected by the change are calculated, and the shortest path tree (SPT) and the original algorithm are generated. The calculated results are the same, which greatly reduces the amount of calculation and improves the network convergence speed.
  • SPT shortest path tree
  • the principle of partial route calculation is the same as the incremental route calculation, which is only the part that calculates the change. However, part of the route calculation does not require the calculation of the node path, but the leaf is updated based on the shortest path tree calculated by the partial route calculation.
  • the leaf represents the route and the node represents the router. If the shortest path tree is changed after the incremental route calculation, the partial route calculation only processes all the leaves on the changed node; if the shortest path tree calculated by the incremental route calculation does not change, the partial route calculation only processes the change.
  • Leaf information For example, if a node uses an intermediate system to an intermediate system (IS-IS) interface, the shortest path tree of the entire network topology is unchanged.
  • IS-IS intermediate system
  • part of the route calculation only updates the interface route of the node, thereby saving CPU usage.
  • the combination of partial routing calculation and incremental routing calculation can further improve the convergence performance of the network. It is an improvement of the original SPF algorithm, so it has replaced the original algorithm.
  • the route-prioritized convergence technology calculates the route with the highest priority and achieves the convergence of the network with the highest priority.
  • the amount of routing on the core routers has increased dramatically, with 100,000 routes, including tunneling protocols such as Multi-Protocol Label Switching (MPLS), which are used to establish critical routes in the path.
  • MPLS Multi-Protocol Label Switching
  • the convergence time depends on the change notification time and the route calculation time. As the CPU calculation speed increases, the route calculation time is recorded in milliseconds, but the change notification time is recorded in seconds. It improves the routing calculation speed of the machine very well, but does not solve the large amount of time that the change notification takes time in the network transmission, so the convergence speed is still very slow.
  • the multicast protocol packet still needs to be transmitted in a single hop in the network, that is, it needs to be transmitted from the neighbor closest to the change link to the next far neighbor, and then spread to the entire network.
  • the router of each router After the router of each router performs the parsing and processing of the link state, the timer is started to be sent out. Even if the packet is forwarded before the route calculation, the time is too long, and the convergence speed is too slow.
  • the purpose of the embodiments of the present invention is to provide a method and a device for advertising network topology changes, which can quickly notify the network topology change information to the entire network, and improve the convergence speed.
  • the embodiment of the invention provides a method for advertising network topology changes, including:
  • an embodiment of the present invention further provides an apparatus, including:
  • a processing module configured to collect node router information that needs to be advertised in the network, and generate a topology change notification list
  • An ear block is used to obtain a link state message containing network topology change information
  • An encapsulation module configured to block, according to the obtained link state packet with the network topology change information Install the topology change notification message
  • a sending module configured to send the topology change notification message to a node router in the topology change notification list.
  • the method by sending the foregoing topology change notification message directly to the node router in the topology change notification list, the method does not need to be single-hop in the network by using the multicast protocol packet. Passing, can quickly notify the network topology change information to the whole network, and improve the convergence speed.
  • FIG. 1 is a schematic diagram of a network topology of the prior art
  • Embodiment 1 is a flowchart of Embodiment 1 of a method for notifying a network topology change according to the present invention
  • Embodiment 3 is a flowchart of Embodiment 2 of a method for advertising a network topology change according to the present invention
  • Embodiment 4 is a schematic structural diagram of Embodiment 1 of an apparatus for notifying a network topology change according to the present invention
  • FIG. 5 is a schematic structural diagram of Embodiment 2 of an apparatus for notifying a network topology change according to the present invention. detailed description
  • the fast convergence techniques that have been promoted are focused on: First, improve the routing calculation algorithm, and increase the calculation speed by reducing the unnecessary calculation amount, such as incremental route calculation technology, partial route calculation technology, and route prioritization convergence technology. Hop separation technology, etc.; Second, preferentially disseminate updated link state messages; Third, through intelligent timers, quickly respond to network changes and circumvent network oscillations.
  • Embodiment 1 is a flowchart of Embodiment 1 of a method for advertising a network topology change according to the present invention. As shown in FIG. 2, if a link between a router 2 and a router 3 adjacent thereto in the network shown in FIG. 1 changes, Then there are the following operations:
  • Step 11 Collect node router information that needs to be advertised in the network, and generate a topology change notification list.
  • the node router information is an Internet Protocol (IP) address of the node router
  • the topology change notification list is a topology change start router.
  • IP Internet Protocol
  • the address list, the topology change start router may also be referred to as a topology change router.
  • the router 2 is a topology change start router, which is responsible for promptly advertising the change to the entire network.
  • Step 12 Obtain a link state packet containing network topology change information.
  • Step 13 Encapsulating the topology change notification message according to the obtained link state packet containing the network topology change information, where the topology change notification message is a unicast IP packet, and the unicast mode, the router 2 process specific If the destination router in the topology change notification list is adjacent to the router 2, the router 2 sends the topology change notification message to the protocol packet processing unit of the destination router, and the CPU of the destination router parses the packet.
  • topology change notification list if the destination router in the topology change notification list is not adjacent to the router 2, the router 2 sends the topology change notification message to the forwarding unit of the next router adjacent to the router 2, The router does not parse and process the packet, and directly forwards the topology change advertisement message to the forwarding unit of the next router adjacent to it, until the destination router in the topology change notification list receives the topology change notification report. Because each router passing through does not parse and process the message and forward it directly, so the topology The purpose of the advertisement list that topology changes router advertisement messages sent directly for the router 2, and the above-described process, shortening the extension time Park change notification packet transmitted in the network.
  • the topology change notification packet is an IP packet whose source IP address is the IP address of the interface of the topology change start router, that is, the IP address of the router 2, and the destination IP address is the interface IP of each node router in the topology change notification list. address.
  • the topology change notification packet carries a link state packet containing the network topology change information, and the link state packet containing the network topology change information is an open shortest path priority link state broadcast or an intermediate system to intermediate system link state.
  • the packet, the shortest path priority link state broadcast or the intermediate system to intermediate system link state message, which contains the adjacency relationship between router 2 and router 3, is the specific content that needs to be advertised.
  • the Open Shortest Path First (OSPF) Link State Broadcast uses the original IP protocol number, and the Intermediate System to Intermediate System (IS-IS) Link State Message (LSP) needs to define a new IP protocol number to support The notification method of this network topology change.
  • OSPF Open Shortest Path First
  • IS-IS Intermediate System to Intermediate System
  • LSP Link State Message
  • Step 14 Send the encapsulated topology change notification to the node router in the topology change notification list.
  • the node router in the change notification list receives the topology change notification message and parses it.
  • the internal gateway protocol can only receive packets sent directly from neighboring routers.
  • the internal gateway protocol can receive the topology change notification message sent by the remote node router that is not directly connected. For security reasons, it is necessary to verify whether the Internet Protocol address of the topology change notification message belongs to the interface Internet Protocol address of the topology change start router. After the routers in the network verify the packets, they quickly synchronize the network database and perform route calculation to achieve fast convergence.
  • the unicast IP packet that is, the topology change advertisement packet
  • the topology change router is sent by the topology change router, and the topology change notification message of the entire network is sent, so that the topology change information is sent. Notifying the entire network in a short period of time enables the network to quickly synchronize the network database, perform route calculations, and improve network convergence speed.
  • FIG. 3 is a flowchart of Embodiment 2 of the method for advertising the network topology change according to the embodiment of the present invention.
  • Step 21 Establish a fast notification router virtual adjacency relationship. As shown in Figure 3, establishing the fast notification router virtual adjacency can be achieved through a proprietary protocol, an authentication request, or a network administrator designation. The packets of the virtual adjacency of the router are advertised only once. They are used to establish a valid advertisement list to ensure the security of the network.
  • Step 22 Collect node router information that needs to be advertised in the network, and generate a topology change notification list.
  • Step 23 Obtain a link state packet containing network topology change information.
  • Step 24 Encapsulating the topology change advertisement message according to the obtained link state packet containing the network topology change information
  • Step 25 Send the encapsulated topology change notification message to the node router in the topology change notification list, and end the operation.
  • the topology change notification message of Router 2 can contain only packets destined for Router 1.
  • the advertisement list of Router 1 there are other node routers in the network, then the topology change notification of Router 2 The packet is sent to the router 1 only, and the router 1 re-sends the packet to the other node routers in the list.
  • the number of the topology nodes in the network is too large, which may result in the first embodiment of the present invention.
  • the list of advertisements in the list is too large, which affects the transmission efficiency.
  • FIG. 4 is a schematic structural diagram of Embodiment 1 of a network topology change notification apparatus according to the present invention. As shown in FIG. 4, the embodiment of the present invention includes:
  • the processing module 111 is configured to collect node router information that needs to be advertised in the network, and generate a topology change advertisement list.
  • the encapsulating module 113 is configured to encapsulate the topology change notification message according to the obtained link state packet containing the network topology change information;
  • the sending module 114 is configured to send the encapsulated topology change notification message to the node router in the topology change notification list.
  • FIG. 5 is a schematic structural diagram of Embodiment 1 of a network topology change notification apparatus according to the present invention. As shown in FIG. 5, the difference between the embodiment of the present invention and the first embodiment of the present invention is further included: a router virtual adjacency relationship establishing module 211, Used to establish a fast notification router virtual adjacency relationship.
  • a router virtual adjacency relationship establishing module 211 Used to establish a fast notification router virtual adjacency relationship.
  • the present invention can be implemented by hardware, or can be implemented by means of software and a necessary general hardware platform, and the technical solution of the present invention can be implemented.
  • the software product can be stored in a computer readable storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.), including a number of instructions for making a computer device (which can be an individual)
  • a computer, server, or network device, etc. performs the methods described in various embodiments of the present invention.

Description

网络拓朴变化的通告方法及装置 本申请要求于 2008 年 3 月 28 日提交中国专利局、 申请号为 200810090358.2、 发明名称为"网络拓朴变化的通告方法及装置"的中国专利 申请的优先权, 其全部内容通过引用结合在本申请中。 技术领域
本发明涉及网络拓朴结构领域, 尤其是涉及一种网络拓朴变化的通告方法 及装置。 背景技术
随着网络业务的丰富化, 对网络带宽的要求迅速增长, 促使网络部署以树 型方式向纵深方向扩展, 各省、 市、 自治区、 县的网络容量扩容趋势明显。
由于受到终端设备部署的限制, 内部网关协议 ( Interior Gateway Protocol, IGP )域内的路由器容量明显增加,并且网络拓朴变化导致的收敛速度问题过慢。
图 1为现有技术的网络拓朴结构图, 如图 1所示, 当路由器 2与路由器 3 之间链路发生变化, 路由器 1要想感知, 必须通过与路由器 2相邻的路由器 所有的内部网关协议层分析后再转发给与该路由器相邻的路由器, 通告网络 拓朴变化, 直到报文传输到路由器 1。 路由器 1再根据拓朴变化进行路由计 算, 选择可到达或者通过目的路由器 3的路径, 因此降低了收敛速度, 使得 路由器 1的收敛以秒记。
现有技术方案一通过改进路由计算算法来提高本机的路由计算速度, 从 而达到提高收敛速度的要求。 现有技术方案一是将增量路由计算(I-SPF ) 、 部分路由计算 (PRC )及路由分优先级收敛技术相结合的技术方案。
增量路由计算每次只对变化的一部分路由进行计算, 而不是对全部路由 重新计算。 在国际标准化组织 (ISO ) 10589中定义使用最短路径(Dijkstra ) 算法进行路由计算, 当网络拓朴中有一个节点发生变化时, 这种算法需要重 新计算网络中的所有节点, 计算时间长, 占用过多的中央处理器 (CPU ) 资 源, 影响整个网络的收敛速度。 增量路由计算改进了这个算法, 除了第一次 计算时需要计算全部节点外, 以后的每次只计算变化影响的节点, 而最后生 成的最短路径树(Shortest Path Tree , SPT )与原来的算法所计算的结果相同, 大大降低了计算量, 提高了网络收敛速度。
部分路由计算的原理与增量路由计算相同,都是只计算变化的那一部分。 但部分路由计算不需要计算节点路径, 而是根据部分路由计算算出的最短路 径树来更新叶子。 在路由计算中, 叶子代表路由, 节点则代表路由器。 如果 增量路由计算计算后的最短路径树改变, 部分路由计算只处理那个变化的节 点上的所有叶子; 如果经过增量路由计算计算后的最短路径树并没有变化, 则部分路由计算只处理变化的叶子信息。 例如一个节点使用一个中间系统到 中间系统(IS-IS )接口, 则整个网络拓朴的最短路径树是不变的, 这时部分 路由计算只更新这个节点的接口路由,从而节省 CPU占用率。部分路由计算 和增量路由计算配合使用可以将网络的收敛性能进一步提高, 它是原始 SPF 算法的改进, 所以已经代替了原有的算法。
路由分优先级收敛技术是先计算优先级高的路由, 达到优先级高的网络 先收敛的目的。 在网络资源日益兴盛的今天, 核心路由器上的路由量大幅增 加, 以十万路由记, 其中包含多协议标签交换 (MPLS ) 等隧道协议赖以建 立路径的关键路由, 在这种网络中, 当拓朴发生变化, 优先级计算关键路径 的路由会很好的降低拓朴变化带来的流量损失。
但是由于网络拓朴发生变化时, 收敛时间依赖于变化通告时间和路由计算 时间, 随着 CPU计算速度的提升, 路由计算时间以毫秒记, 但是变化通告时间 以秒记, 现有技术方案一虽然很好的提高了本机的路由计算速度, 但是没有解 决变化通告在网络传递耗费的大量时间,因此收敛速度仍然很慢。
在现有技术方案二中, 为了加快整个网络的收敛速度, 当中间系统到中间 系统(IS-IS )收到由其它路由器发来的链路状态报文(LSP )时, 如果此报文比 自己数据库中的要新, 原来的请求注解(RFC )协议规定是用一个定时器, 定时 将链路状态数据库内的链路状态报文扩散出去 , 使得链路状态数据库 (LSDB)的 同步比较緩慢。 链路状态快速扩散特性改进了这种方式, 配置此特性的路由器 收到一个或多个比较新的链路状态报文时, 在路由计算之前, 先将小于指定数 目的链路状态报文扩散出去, 加快链路状态数据库的同步过程。 这种方式在很 大程度上可以提高整个网络的收敛速度。
在现有技术方案中, 仍旧需要以组播协议报文的方式在网络中单跳传递, 也就是说需要从离变化链路最近的邻居传递到下一个较远的邻居 , 依次扩散到 全网, 途经每个路由器的 CPU进行链路状态的解析和处理后, 再启动定时器发 送出去, 即便考虑在路由计算之前就把报文转发出去, 期间也花费了不少时间, 使得收敛速度过慢。 发明内容
本发明实施例的目的是提供一种网络拓朴变化的通告方法及装置, 能够快 速将网络拓朴变化信息通告给全网, 提高收敛速度。
本发明实施例提供了一种网络拓朴变化的通告方法, 包括:
当网络拓朴发生变化时, 收集网络中需要通告的节点路由器信息, 并生成 拓朴变化通告列表;
获取含有网络拓朴变化信息的链路状态报文;
根据获取的所述含有网络拓朴变化信息的链路状态报文封装拓朴变化通告 报文;
向所述拓朴变化通告列表中的节点路由器发送所述拓朴变化通告报文。 同时, 本发明实施例还提供了一种装置, 包括:
处理模块, 用于收集网络中需要通告的节点路由器信息, 并生成拓朴变化 通告列表;
获耳 4莫块, 用于获取含有网络拓朴变化信息的链路状态报文;
封装模块, 用于根据获取的所述含有网络拓朴变化信息的链路状态报文封 装拓朴变化通告报文;
发送模块, 用于向所述拓朴变化通告列表中的节点路由器发送所述拓朴变 化通告报文。
本发明实施例通过引入上述的方法及装置, 通过直接向所述拓朴变化通告 列表中的节点路由器发送所述拓朴变化通告报文, 无需以组播协议报文的方式 在网络中单跳传递, 能够快速将网络拓朴变化信息通告给全网, 提高收敛速度。
下面通过附图和实施例, 对本发明实施例的技术方案做进一步的详细描述。 附图说明
图 1为现有技术的网络拓朴结构图;
图 2为本发明网络拓朴变化的通告方法实施例一的流程图;
图 3为本发明网络拓朴变化的通告方法实施例二的流程图;
图 4为本发明网络拓朴变化的通告装置实施例一的结构示意图;
图 5为本发明网络拓朴变化的通告装置实施例二的结构示意图。 具体实施方式
目前已经推广的快速收敛技术着眼于:第一, 改进路由计算算法, 通过减 少不必要的计算量提高计算速度, 比如增量路由计算技术、 部分路由计算技 术、 路由分优先级收敛技术, 下一跳分离技术等; 第二, 优先扩散更新的链 路状态报文; 第三, 通过智能定时器, 快速响应网络变化, 规避网络振荡。
网络拓朴变化的通告方法实施例一
图 2为本发明网络拓朴变化的通告方法实施例一的流程图, 如图 2所示, 若图 1所示的网络中路由器 2及与其相邻的路由器 3之间的链路发生变化, 则 有如下操作:
步骤 11 : 收集网络中需要通告的节点路由器信息, 并生成拓朴变化通告列 表; 其中, 节点路由器信息为节点路由器的互联网协议(IP )地址, 拓朴变化通 告列表为拓朴变化起始路由器的最短路径优先树上的节点路由器的互联网协议 地址列表, 拓朴变化起始路由器也可以称为拓朴变化的路由器, 本发明实施例 中路由器 2为拓朴变化起始路由器, 其负责迅速通告这个变化给全网。
步骤 12: 获取含有网络拓朴变化信息的链路状态报文;
步骤 13: 根据获取的含有网络拓朴变化信息的链路状态报文封装拓朴变化 通告报文; 其中, 拓朴变化通告报文为单播 IP报文, 通过单播方式, 路由器 2 过程具体为: 若拓朴变化通告列表中的目的路由器与路由器 2相邻, 则路由器 2 将拓朴变化通告报文发送给该目的路由器的协议报文处理单元, 该目的路由器 的 CPU对报文进行解析和处理, 获知拓朴变化信息; 若拓朴变化通告列表中的 目的路由器与路由器 2不相邻,路由器 2将拓朴变化通告报文发送给与路由器 2 相邻的下一个路由器的转发单元, 此路由器并不对报文进行解析和处理, 直接 将拓朴变化通告报文再转发给与其相邻的下一个路由器的转发单元, 直至拓朴 变化通告列表中的目的路由器收到拓朴变化通告报文, 因为途经的每个路由器 均不对报文进行解析和处理而直接转发, 所以拓朴变化通告列表中的目的路由 器认为拓朴变化通告报文为路由器 2直接发送, 并且采用上述过程, 缩短了拓 朴变化通告 文在网络中传输的时间。
拓朴变化通告报文为 IP报文,其源 IP地址为拓朴变化起始路由器的接口 IP 地址, 即路由器 2的 IP地址, 目的 IP地址为拓朴变化通告列表中各节点路由器 的接口 IP地址。拓朴变化通告报文携带含有网络拓朴变化信息的链路状态报文, 含有网络拓朴变化信息的链路状态报文为开放最短路径优先链路状态广播或中 间系统到中间系统链路状态报文, 开放最短路径优先链路状态广播或中间系统 到中间系统链路状态报文, 含有路由器 2和路由器 3邻接关系, 是需要通告的 具体内容。 开放最短路径优先(OSPF )链路状态广播(LSA )使用原有的 IP协 议号, 中间系统到中间系统( IS-IS )链路状态报文( LSP )需要定义新的 IP协 议号, 以支持本网络拓朴变化的通告方法。
步骤 14: 向拓朴变化通告列表中的节点路由器发送封装后的拓朴变化通告 报文, 结束操作。 变化通告列表中的节点路由器收到该拓朴变化通告报文, 便对其进行解析。 按 照原协议规定, 内部网关协议仅可接收直连邻居路由器发送的报文。 而在本发 明实施例中, 内部网关协议可接收非直连的远端节点路由器发送的拓朴变化通 告报文。 出于安全上的考虑, 要验证拓朴变化通告报文的互联网协议地址是否 属于拓朴变化起始路由器的接口互联网协议地址。 网络中的路由器通过报文验 证后, 快速同步网络数据库, 进行路由计算, 以达到快速收敛的目的。
本发明实施例通过单播 IP报文即拓朴变化通告报文,由拓朴变化的路由器, 通过收集的拓朴变化通告列表, 发送全网的拓朴变化通告报文, 使拓朴变化信 息在很短的时间内通告全网使得网络能够快速同步网络数据库, 进行路由计算, 提高网络收敛速度。
网络拓朴变化的通告方法实施例二
本发明实施例在本发明实施例一的基础上提供另一实施例, 图 3 为本发明 网络拓朴变化的通告方法实施例二的流程图, 如图 3所示包括:
步骤 21 : 建立快速通告路由器虚拟邻接关系。 如图 3所示, 建立该快速通 告路由器虚拟邻接关系可通过私有协议、 认证请求或网络管理员指定来实现。 快速通告路由器虚拟邻接关系的报文仅交互一次, 用于建立有效的通告列表, 确保网络的安全性。
步骤 22: 收集网络中需要通告的节点路由器信息, 并生成拓朴变化通告列 表;
步骤 23: 获取含有网络拓朴变化信息的链路状态报文;
步骤 24: 根据获取的含有网络拓朴变化信息的链路状态报文封装拓朴变化 通告报文;
步骤 25: 向拓朴变化通告列表中的节点路由器发送封装后的拓朴变化通告 报文, 结束操作。 如图 1所示, 路由器 2的拓朴变化通告报文中可以仅含有目的为路由器 1 的报文, 在路由器 1 的通告列表中有网络中的其他节点路由器, 那么路由器 2 的拓朴变化通告报文仅发送给路由器 1,路由器 1再重新进行报文封装发送给自 己列表中的其它节点路由器, 通过这样的分组, 可避免因网络中的拓朴节点数 量过多, 导致本发明实施例一中的通告列表过大, 而影响发送效率。
网络拓朴变化的通告装置实施例一
图 4为本发明网络拓朴变化的通告装置实施例一的结构示意图, 如图 4所 示, 本发明实施例包括:
处理模块 111 , 用于收集网络中需要通告的节点路由器信息, 并生成拓朴变 化通告列表;
获 ^莫块 112, 用于获取含有网络拓朴变化信息的链路状态报文;
封装模块 113,用于根据获取的含有网络拓朴变化信息的链路状态报文封装 拓朴变化通告报文;
发送模块 114,用于向拓朴变化通告列表中的节点路由器发送封装后的拓朴 变化通告报文。
网络拓朴变化的通告装置实施例二
图 5为本发明网络拓朴变化的通告装置实施例一的结构示意图, 如图 5所 示, 本发明实施例与本发明实施例一的区别在于, 还包括: 路由器虚拟邻接关 系建立模块 211 , 用于建立快速通告路由器虚拟邻接关系。
通过以上的实施方式的描述, 本领域的技术人员可以清楚地了解到本发 明可以通过硬件实现, 也可以借助软件和必要的通用硬件平台的方式来实现 基于这样的理解, 本发明的技术方案可以以软件产品的形式体现出来, 该软 件产品可以存储在一个计算机可读存储介质(可以是 CD-ROM, U盘, 移动 硬盘等) 中, 包括若干指令用以使得一台计算机设备(可以是个人计算机, 服务器, 或者网络设备等)执行本发明各个实施例所述的方法。
最后应说明的是: 以上实施例仅用以说明本发明的技术方案而非对其进行 限制, 尽管参照较佳实施例对本发明进行了详细的说明, 本领域的普通技术人 员应当理解: 其依然可以对本发明的技术方案进行修改或者等同替换, 而这些 修改或者等同替换亦不能使修改后的技术方案脱离本发明技术方案的精神和范 围。

Claims

权 利 要 求
1、 一种网络拓朴变化的通告方法, 包括:
当网络拓朴发生变化时, 收集网络中需要通告的节点路由器信息, 并生成 拓朴变化通告列表;
获取含有网络拓朴变化信息的链路状态报文;
根据获取的所述含有网络拓朴变化信息的链路状态报文封装拓朴变化通告 报文;
向所述拓朴变化通告列表中的节点路由器发送所述拓朴变化通告报文。
2、 根据权利要求 1所述的网络拓朴变化的通告方法, 其特征在于: 所述收 集网络中需要通告的节点路由器信息之前还包括建立快速通告路由器虚拟邻接 关系。
3、 根据权利要求 2所述的网络拓朴变化的通告方法, 其特征在于: 所述建 立路由器虚拟邻接关系通过私有协议、 认证请求或网络管理员指定实现。
4、 根据权利要求 1或 3所述的网络拓朴变化的通告方法, 其特征在于: 所 述通告列表为拓朴变化起始路由器的最短路径优先树上的节点路由器的互联网 协议地址列表。
5、 根据权利要求 4所述的网络拓朴变化的通告方法, 其特征在于: 所述拓朴变化通告报文携带所述含有网络拓朴变化信息的链路状态报文, 所述含有网络拓朴变化信息的链路状态报文为开放最短路径优先链路状态广播 或中间系统到中间系统链路状态报文。
6、 根据权利要求 1所述的网络拓朴变化的通告方法, 其特征在于: 根据获 取的所述含有网络拓朴变化信息的链路状态报文封装拓朴变化通告报文具体 为: 将所述拓朴变化通告报文封装为互联网协议报文; 所述拓朴变化通告报文 的源互联网协议地址为拓朴变化起始路由器接口的互联网协议地址; 目的互联
7、 根据权利要求 6所述的网络拓朴变化的通告方法, 其特征在于: 以单播 各节点路由器。
8、 根据权利要求 7所述的网络拓朴变化的通告方法, 其特征在于: 所述将 拓朴变化通告报文发送给所述拓朴变化通告列表中的节点路由器之后还包括: 在收到通告报文后, 验证所述拓朴变化通告报文的互联网协议地址是否属于拓 朴变化起始路由器的接口互联网协议地址。
9、 一种网络拓朴变化的通告装置, 包括:
处理模块, 用于收集网络中需要通告的节点路由器信息, 并生成拓朴变化 通告列表;
获取模块, 用于获取含有网络拓朴变化信息的链路状态报文;
封装模块, 用于根据获取的所述含有网络拓朴变化信息的链路状态报文封 装拓朴变化通告报文;
发送模块, 用于向所述拓朴变化通告列表中的节点路由器发送所述拓朴变 化通告报文。
10、 根据权利要求 9所述的网络拓朴变化的通告装置, 其特征在于: 还包 括路由器虚拟邻接关系建立模块, 用于建立快速通告路由器虚拟邻接关系。
PCT/CN2009/070985 2008-03-28 2009-03-24 网络拓扑变化的通告方法及装置 WO2009117948A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200810090358.2 2008-03-28
CN2008100903582A CN101547139B (zh) 2008-03-28 2008-03-28 网络拓扑变化的通告方法及装置

Publications (1)

Publication Number Publication Date
WO2009117948A1 true WO2009117948A1 (zh) 2009-10-01

Family

ID=41112971

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2009/070985 WO2009117948A1 (zh) 2008-03-28 2009-03-24 网络拓扑变化的通告方法及装置

Country Status (2)

Country Link
CN (1) CN101547139B (zh)
WO (1) WO2009117948A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114640593A (zh) * 2020-12-16 2022-06-17 中国科学院声学研究所 一种用于sdn与ip混合网络的加速路由信息传播的方法

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104468158B (zh) * 2013-09-16 2018-07-13 华为技术有限公司 一种节点间状态通告的方法和设备
CN104767687B (zh) * 2014-01-03 2019-04-23 国际商业机器公司 传播关键路由以及建立和更新路由表的方法和设备
CN105376162B (zh) * 2014-08-30 2019-05-10 华为技术有限公司 一种链路状态信息通告方法和设备
CN104702503B (zh) * 2015-03-26 2018-05-18 中国电子科技集团公司第七研究所 网络路由方法和系统
CN107181684A (zh) * 2016-03-11 2017-09-19 中兴通讯股份有限公司 一种响应网络拓扑变化的方法和装置
US10063457B2 (en) * 2016-03-29 2018-08-28 Juniper Networks, Inc. Method, system, and apparatus for improving forwarding capabilities during route convergence
CN107040607A (zh) * 2017-05-19 2017-08-11 郑州云海信息技术有限公司 一种服务器数据分配系统
CN108111423B (zh) * 2017-12-28 2020-11-17 迈普通信技术股份有限公司 流量传输管理方法、装置及网络分路设备
CN112272143B (zh) * 2020-12-12 2021-03-30 广东睿江云计算股份有限公司 一种路由学习和转发方法
CN113225403B (zh) * 2021-07-08 2021-08-31 苏州浪潮智能科技有限公司 一种拓扑感知的负载均衡方法、装置及计算机设备

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1642129A (zh) * 2004-01-14 2005-07-20 电子科技大学 一种新型核心树自组织动态路由算法
CN1889520A (zh) * 2006-07-25 2007-01-03 华为技术有限公司 一种基于ospf的路由信息更新方法和网络设备
CN1905512A (zh) * 2006-08-17 2007-01-31 北京邮电大学 开放最短路径优先路由协议的监测与分析系统及工作方法

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI280764B (en) * 2005-11-02 2007-05-01 Inst Information Industry Method for rapidly linking mobile node and access point in wireless local area network
CN1825836B (zh) * 2006-04-04 2010-06-23 中兴通讯股份有限公司 避免网络设备拥塞的系统和方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1642129A (zh) * 2004-01-14 2005-07-20 电子科技大学 一种新型核心树自组织动态路由算法
CN1889520A (zh) * 2006-07-25 2007-01-03 华为技术有限公司 一种基于ospf的路由信息更新方法和网络设备
CN1905512A (zh) * 2006-08-17 2007-01-31 北京邮电大学 开放最短路径优先路由协议的监测与分析系统及工作方法

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114640593A (zh) * 2020-12-16 2022-06-17 中国科学院声学研究所 一种用于sdn与ip混合网络的加速路由信息传播的方法
CN114640593B (zh) * 2020-12-16 2023-10-31 中国科学院声学研究所 一种用于sdn与ip混合网络的加速路由信息传播的方法

Also Published As

Publication number Publication date
CN101547139A (zh) 2009-09-30
CN101547139B (zh) 2012-03-07

Similar Documents

Publication Publication Date Title
WO2009117948A1 (zh) 网络拓扑变化的通告方法及装置
EP3783849B1 (en) Multicast data transmission method, related apparatus and system
CN109756425B (zh) 组播转发方法、装置以及bfr
WO2018072704A1 (zh) 报文传输方法、装置、节点和计算机存储介质
WO2018228490A1 (zh) 组播跨域方法、装置、系统及计算机可读存储介质
US20160006614A1 (en) Source Routing Using Path Computation Elements
EP2869512A1 (en) Dynamic area filtering for link-state routing protocols
US20030037162A1 (en) Spanning tree protocol traffic in a transparent LAN
US7969867B2 (en) Backup route generation in border gateway protocol
TW201134151A (en) RSVP-TE graceful restart under fast re-route conditions
WO2009012688A1 (fr) Procédé, système et appareil de réacheminement de message dans un réseau privé virtuel à trois couches
JP2013541896A (ja) 階層的ラベルスタッキングを用いてldpの収束を改善するための方法及び装置
WO2014008820A1 (zh) 业务处理方法、设备及系统
WO2011044828A1 (zh) 一种路由撤销的方法、装置和系统
WO2009036678A1 (fr) Procédé, dispositif et système de réseau pour acheminer un message
WO2013026384A1 (zh) 业务数据传输的方法、网络节点及系统
WO2012109837A1 (zh) 单播数据帧传输方法及装置
WO2011103759A1 (zh) 关联的双向标签交换路径的创建方法及系统
WO2013113285A1 (en) Routing generation for implementation of fiber channel over ethernet
KR101699643B1 (ko) 다중 프로토콜 라벨 스위칭에 기반한 oam 방법 및 장치
WO2013139270A1 (zh) 实现三层虚拟专用网络的方法、设备及系统
Luo et al. Efficient integration of software defined networking and information-centric networking with CoLoR
WO2012163219A1 (zh) 一种lsp网络拥塞处理的方法、装置及系统
WO2014187429A1 (zh) 一种实现流表配置的方法及装置
WO2011140921A1 (zh) 虚拟专用局域网业务vpls的数据帧的转发方法、设备和系统

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: 09724839

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09724839

Country of ref document: EP

Kind code of ref document: A1