WO2023098703A1 - 路径通告方法、拓扑算法组合生成方法、路径计算方法、数据传输方法、电子设备和计算机可读存储介质 - Google Patents

路径通告方法、拓扑算法组合生成方法、路径计算方法、数据传输方法、电子设备和计算机可读存储介质 Download PDF

Info

Publication number
WO2023098703A1
WO2023098703A1 PCT/CN2022/135306 CN2022135306W WO2023098703A1 WO 2023098703 A1 WO2023098703 A1 WO 2023098703A1 CN 2022135306 W CN2022135306 W CN 2022135306W WO 2023098703 A1 WO2023098703 A1 WO 2023098703A1
Authority
WO
WIPO (PCT)
Prior art keywords
topology
algorithm
combination
flexible
path
Prior art date
Application number
PCT/CN2022/135306
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 WO2023098703A1 publication Critical patent/WO2023098703A1/zh

Links

Images

Classifications

    • 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
    • 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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/04—Arrangements for maintaining operational condition

Definitions

  • the present application relates to the communication field, and in particular, relates to a path notification method, a topology algorithm combination generation method, a path calculation method, a data transmission method, an electronic device, and a computer-readable storage medium.
  • Network slicing is one of the key technologies of the 5th Generation Mobile Communication Technology (5G, 5th Generation Mobile Communication Technology) network.
  • 5G 5th Generation Mobile Communication Technology
  • Multiple virtual networks can be segmented on the same network infrastructure, so that different business traffic can be logically isolated on network resources during transmission, thereby adapting to the characteristic requirements of various types of services.
  • the Internal Gateway Protocol uses the metric value (metric) for path calculation to obtain the optimal path to the destination node.
  • metric metric
  • this path calculation method cannot meet the path calculation requirements of 5G network slicing.
  • the link delay requirements are very high, and it is expected that traffic can be transmitted according to the path with the shortest delay when forwarding.
  • FA Flexible Algorithm
  • FA-ID Flexible Algorithm Identification
  • FAD Flexible Algorithm Definition
  • FAD and FA-ID information are flooded in the entire network through the IGP protocol, and the devices in the network receive the corresponding information, and then perform path calculation according to the FA-ID supported locally and the FAD configured in the network.
  • the present application provides a path notification method, including: judging whether there is a topology algorithm combination, where the topology algorithm combination includes information about at least one topology on the current device and information about a flexible algorithm corresponding to the topology; And when the topology algorithm combination exists, notify the topology algorithm combination according to a preset notification policy.
  • the present application provides a method for generating a topology algorithm combination, including: configuring a flexible algorithm for at least one topology on the current device; and generating a topology algorithm combination according to the topology and the flexible algorithm configured for the topology .
  • the present application provides a path calculation method, including: receiving a message containing a combination of topology algorithms; the combination of topology algorithms includes topology information and flexible algorithm information; Calculate the path to get the path.
  • the present application provides a data transmission method, including: querying a routing table according to the received data, and the path in the routing table is the path calculated by the path calculation method described in the third aspect; and Transfer data according to the queried path.
  • the present application provides an electronic device, the electronic device comprising: at least one processor; a memory, on which at least one computer program is stored, when the at least one computer program is executed by the at least one processor , so that the at least one processor implements the path notification method according to the first aspect, or the topology algorithm combination generation method according to the second aspect, or the path calculation method according to the third aspect, or The data transmission method according to the fourth aspect; and at least one I/O interface, connected between the processor and the memory, configured to realize information exchange between the processor and the memory.
  • the present application provides a computer-readable storage medium storing a computer program.
  • the computer program is executed by a processor, the path notification method according to the first aspect is implemented, or the path notification method according to the second aspect is implemented.
  • FIG. 1 is a flow chart of a route advertisement method provided by an embodiment of the present application.
  • Fig. 2 is a flow chart of a method for generating a combination of topology algorithms provided by an embodiment of the present application.
  • FIG. 3 is a flow chart of a path calculation method provided by an embodiment of the present application.
  • Fig. 4 is a flowchart of a data transmission method provided by an embodiment of the present application.
  • FIG. 5 is a schematic network topology diagram of a multi-topology FA slicing scenario provided by an embodiment of the present application.
  • FIG. 6 is an IS-IS extended TLV format including MT-ID and FA-ID provided by the embodiment of the present application.
  • Fig. 7 is a schematic diagram of an electronic device provided by an embodiment of the present application.
  • Fig. 8 is a schematic diagram of a computer-readable storage medium provided by an embodiment of the present application.
  • the current flexible algorithm (FA) sharding mechanism may have flaws.
  • the topology described in this article is a logical topology except for the physical topology.
  • the FA-ID is notified through the segment routing algorithm subtype length value (SR-Algorithm Sub-TLV, Segment Routing Algorithm Sub Type-Length-Value) defined in RFC8667, and the information is notified only to the FA supported by the device -ID, without notifying its corresponding multi-topology identification (MT-ID, Multi-Topology Identification), nor distinguishing which topology among multiple topologies the FA-ID belongs to.
  • SR-Algorithm Sub-TLV Segment Routing Algorithm Sub Type-Length-Value
  • the IS-IS protocol configures two logical topologies, IPv4 and IPv6.
  • the solid line marks the topology of IPv4, and the dotted line marks the topology of IPv6.
  • the FA information supported by each device is marked as shown in the figure.
  • this application proposes a multi-topology-based FA path calculation scheme.
  • the sending device transmits the message of routing protocols such as IS-IS and OSPF, or other
  • the corresponding relationship between each topology and the flexible algorithm on the device is notified to the neighbors;
  • the receiving device summarizes the corresponding relationship between each topology and the flexible algorithm on each device, and performs path calculation based on the same topology and the same flexible algorithm, so as to effectively solve the above-mentioned problems.
  • the problem of path calculation errors avoids the problem of path calculation errors caused by different slices supported by devices under multi-topology.
  • the embodiment of the present application provides a route advertisement method, as shown in FIG. 1 , the method includes the following steps S110 and S120.
  • step S110 it is judged whether there is a topology algorithm combination, and the topology algorithm combination includes information of at least one topology on the current device and information of a flexible algorithm corresponding to the topology.
  • step S120 when the topology algorithm combination exists, the topology algorithm combination is notified according to a preset notification policy.
  • the devices described in this application are all nodes that can support flexible algorithms. In terms of form, it may not be limited to a physical form of equipment, but may also be a node in a software-defined network, or multiple virtual nodes divided by one node.
  • the multi-topology described in this application is not limited to IPv4 and IPv6, and can be subdivided into IPv4 unicast, IPv4 multicast, IPv6 unicast, IPv6 multicast, etc. as required.
  • public MT-IDs and private MT-IDs can be set according to commonly used topology division methods.
  • the so-called public MT-ID is the MT-ID used by various equipment forms of various manufacturers, which facilitates the intercommunication between equipment of various manufacturers.
  • the so-called private MT-ID is a self-defined MT-ID set by agreement within the predetermined network range. For the internal network, the private MT-ID can be more flexible in defining the topology type.
  • the technical solution of this application can be used in multi-topology scenarios, but is not limited to multi-topology scenarios.
  • some devices may be configured with multiple logical topologies, while other devices may only be configured with one logical topology. If only If there is a topology configured, the technical solution provided by this application can still be used to combine the topology with the corresponding flexible algorithm to generate the topology algorithm and publish it.
  • the IS-IS protocol is used as an example here.
  • a new message notification format is added to the IS-IS protocol to support the notification of the relationship between multi-topologies and the flexible algorithms they support.
  • a new TLV format is added to notify the corresponding relationship, that is, ⁇ MT-ID,FA-ID 1,FA-ID 2,...,FA -ID n>.
  • the numbers above indicate the number of digits occupied by each field in the message. For example, the type (Type) occupies 8 digits from 0 to 7, the length (Length) occupies 8 digits from 8 to 15, and so on.
  • the multi-topology identifier MT-ID is used to identify different topologies, and each topology can support multiple different flexible algorithms, corresponding to the flexible algorithm identifiers FA-ID 1, FA-ID 2, and FA in the message format. -ID n etc.
  • the TLV format of the newly added topology algorithm combination under the extended IS-IS protocol message is used as an example for convenience of description. But in fact, when notifying the topology algorithm combination to the neighbors, there is no limit to the form of the message that can be selected, as long as the topology algorithm combination can be notified to the neighbor device in time, it is not limited to this method.
  • the receiving end device After notifying the neighbors of the corresponding relationship between each topology and flexible algorithm on the device, the receiving end device can summarize the corresponding relationship between each topology and flexible algorithm on each device in the network, and perform routing based on the same topology and the same flexible algorithm. Calculation, so as to effectively solve the problem of path calculation errors caused by different slices supported under multi-topology.
  • the notifying the topology algorithm combination according to the preset notification policy includes: judging whether all the routing devices within the predetermined network range support the topology algorithm combination; and if all the routing devices support the The topology algorithm combination is notified to all neighbors within the predetermined network range of the topology algorithm combination.
  • the TLV structure of the device's notification topology algorithm combination may not depend on the SR-Algorithm Sub-TLV defined in RFC8667, that is, the device may not notify the SR-Algorithm Sub-TLV, but directly advertise according to the topology algorithm combination TLV in this application . It can also decide to advertise the SR-Algorithm Sub-TLV, or the topology algorithm combination TLV, or both according to the preset policy.
  • the flexible algorithm combination only carries the flexible algorithm information of the current device, and does not carry topology information.
  • both the topology algorithm combination and the flexible algorithm combination can be published, and the device receiving the message can determine whether to calculate the path according to the topology algorithm combination or the flexible algorithm combination.
  • the device receiving the message can determine whether to calculate the path according to the topology algorithm combination or the flexible algorithm combination.
  • the device receiving the message can determine whether to calculate the path according to the topology algorithm combination or the flexible algorithm combination.
  • all routing devices within a predetermined network range support topology algorithm combinations, only topology algorithm combinations are released, and flexible algorithm combinations are not released, so as to reduce the number of message releases.
  • the preset notification strategy can be set according to specific requirements. In addition to the above judgment conditions, it can also be set on the device or controller to publish or not to publish the topology algorithm combination, and can also be set to both Publishing the topological algorithm combination also publishes the flexible algorithm combination. It is not listed here one by one, and anyone who can judge whether to publish the topology algorithm combination according to the preset notification strategy falls within the scope of protection of this application.
  • the notifying the topology algorithm combination according to a preset notification strategy includes: notifying the topology algorithm combination to all neighbors within a predetermined network range.
  • the current device has a flexible algorithm combination
  • the flexible algorithm combination includes information about at least one flexible algorithm on the current device
  • the path notification method further includes: Notifying all neighbors within a predetermined network range The flexible algorithm combination.
  • the topology information includes a topology identifier
  • the flexible algorithm information includes a flexible algorithm identifier
  • a Type-Length-Value (TLV, Type-Length-Value) structure of the topology algorithm combination may be generated for each topology identifier.
  • TLV Type-Length-Value
  • the current device uses different TLV structures to advertise different topology identifiers. Only one topology identifier is included in a TLV structure, and at the same time, the flexible algorithm identifier supported by the topology on the current device is also filled in the TLV structure.
  • all flexible algorithm identifiers supported by a topology may be included, or only part of the flexible algorithm identifiers supported by the topology may be included.
  • each topology only carries the TLV structure of one topology algorithm combination. That is, for each topology, the TLV structure of the topology algorithm combination carries all the flexible algorithm identifiers corresponding to the topology on the current device.
  • the advantage of this is that it simplifies the complexity of judgment at the receiving end. If a topology corresponds to multiple TLV structures, after receiving the message, the receiving end needs to judge whether it has received all the TLV structures of the topology, and also needs to judge whether the newly received TLV structure is a supplement to the previously received TLV structure , or an update to the previously received TLV structure.
  • each topology only generates a TLV structure of topology algorithm combination, and the receiving end can use the topology and flexible algorithm in the TLV structure of topology algorithm combination for path calculation immediately after receiving the The TLV structure of the topology is considered to be an update of the previously received TLV structure.
  • the topology algorithm combination is carried in a message of any of the following protocols: intermediate system to intermediate system (IS -IS) protocol, open shortest path first OSPF protocol.
  • IS -IS intermediate system to intermediate system
  • OSPF open shortest path first OSPF protocol
  • the combination of topology algorithms is flooded in the network through IS-IS protocol or OSPF protocol packets, so that devices in the network can quickly obtain the information supported by each topology on each device Flexible algorithm information, and calculate paths based on multiple topologies and flexible algorithms.
  • the physical topology changes, the logical topology changes, or the configuration of the flexible algorithm changes it can be quickly sensed and updated through the IS-IS protocol or OSPF protocol to achieve rapid path calculation convergence.
  • the present application provides a method for generating a topology algorithm combination, as shown in FIG. 2 , including steps S210 and S220.
  • step S210 a flexible algorithm is configured for at least one topology on the current device.
  • step S220 a topology algorithm combination is generated according to the topology and the flexible algorithm configured for the topology.
  • the topology algorithm combination carries a topology identifier and a flexible algorithm identifier of a flexible algorithm configured for the topology indicated by the topology identifier.
  • step S210 in the configuring the flexible algorithm for at least one topology on the current device (step S210), multiple flexible algorithms are configured for one topology.
  • the configuration of the flexible algorithm is based on the unit of equipment, and the identification of the flexible algorithm is notified to the outside world by the unit of the device, not the unit of topology.
  • the same device supports different flexible algorithms in different topologies, other devices in the network cannot distinguish which FA slice is supported by the device in which topology. Therefore, flexible algorithms must be configured on the device at the sending end first, and then the topologies on the device and those configured under each topology can be configured through messages from routing protocols such as IS-IS and OSPF, or through other message forms.
  • the corresponding relationship of the flexible algorithm is notified to neighbors through the path notification method in the first aspect of the present application.
  • the present application provides a path calculation method, as shown in FIG. 3 , including steps S310 and S320.
  • step S310 a message containing a topology algorithm combination is received; the topology algorithm combination includes topology information and flexible algorithm information.
  • step S320 the link is calculated according to the matching topology and the flexible algorithm to obtain the path.
  • the path calculation further includes: after receiving the packet containing the topology algorithm combination, storing the topology algorithm combination in the received packet into a database;
  • the matching topology and flexible algorithm to calculate the link includes: performing calculation according to the mutually matching topology information, flexible algorithm information and link state information stored in the database.
  • the receiver device When the receiver device performs FA slice path calculation based on multiple topologies, it distinguishes between topologies and flexible algorithms. For the devices passed by the path calculation, it is necessary to check whether the device supports the corresponding topology and flexible algorithm in the database. If the device does not support the corresponding topology or flexible algorithm, it needs to be excluded from the path calculation.
  • the path calculation method further includes:
  • the multiple topology algorithm combinations containing the same topology identifier received from the same device are not stored in the database middle.
  • This application does not limit whether there are multiple identical topology identifiers in the combination of topology algorithms carried in the message issued by one device at a time, but in this implementation mode, as mentioned above, in order to simplify the complexity of the judgment of the receiving end,
  • each topology In received packets with the same sequence number, each topology only generates a TLV structure combined with topology algorithms.
  • TLV of the ID appears multiple times, all TLVs corresponding to the MT-ID need to be ignored. Because if multiple TLV structures containing the same topology identifier are received, it is considered that the publishing strategy of the sending end does not match the receiving device, or the message is considered untrustworthy, so it is not stored in the database. All topology algorithm combinations containing the same topology ID will not be able to participate in path calculation.
  • the received topology information, flexible algorithm information and link state information will be stored in the corresponding database, and then according to the matching topology information, flexible algorithm information and link status information in the database, State information is calculated. Not being stored in the database means that such information cannot participate in path calculation.
  • topology algorithm combinations containing the same topology identifier received from the device should be deleted even if they have already been stored in the database.
  • the flexible algorithm combination includes at least one flexible algorithm identifier
  • the path calculation method further includes:
  • step S320 If the flexible algorithm identification in the flexible algorithm combination includes the flexible algorithm identification in the topology algorithm combination, perform the calculation of the link according to the matching topology and the flexible algorithm to obtain the path (step S320 );
  • the topology algorithm combination is not stored in the database.
  • some devices may be configured with multiple logical topologies, while other devices may be configured with only one logical topology.
  • the flexible algorithm combination based on the protocol standard can be released at the same time, or the flexible algorithm combination proposed by this application can be released at the same time.
  • Topological Algorithm Composition in Path Advertisement Methods Therefore, it is possible to receive the combination of flexible algorithms and the combination of topological algorithms at the same time on the receiving end device.
  • each flexible algorithm in the transmitted topology algorithm combination should be included in all the flexible algorithms in the flexible algorithm combination. There should be no abnormal situation in which a certain flexible algorithm in the topological algorithm combination is not included in all the flexible algorithms in the flexible algorithm combination. When an abnormal situation occurs, it is considered that there is an error in the topology algorithm combination released by the sender, so the topology algorithm combination is ignored and excluded from the path calculation.
  • the devices within the predetermined network range After receiving the topology algorithm combination TLV, the devices within the predetermined network range parse the corresponding ⁇ MT-ID, FA-ID> information and record it in the database.
  • the devices within the predetermined network range parse the corresponding ⁇ MT-ID, FA-ID> information and record it in the database.
  • the FA slice route based on multi-topology is finally calculated, which can solve the problem of FA slice path calculation error in the multi-topology scenario described above, that is, the receiving end device can easily identify the topology corresponding to a certain device in the network
  • the FA-ID supported by the network can be added to the FA path calculation to avoid path calculation errors, increase the applicable scenarios of the FA slicing scheme, ensure the stable operation of the business, and improve the reliability of the network.
  • the following uses an example to introduce the process of applying the path advertisement method described in the first aspect of the present application and the path calculation method described in the second aspect to perform path calculation in a multi-topology network slicing scenario.
  • the IS-IS protocol is taken as an example, and the route advertisement method and the route calculation method provided by this application are mainly described. The specific planning of slicing, the establishment of neighbors in the IS-IS protocol, specific route calculation and other steps will not be described here.
  • IS-IS is configured with two logical topologies, IPv4 and IPv6.
  • the solid line represents the topology of IPv4, and the dotted line represents the topology of IPv6.
  • the FA information identification supported by each node is shown in the figure.
  • Nodes in the network perform FA configuration based on multi-topology, and then notify IS-IS Link State Protocol Data Unit (LSP, Link State Protocol Data Units) messages for flooding, using the type length value in this application ( TLV, Type-Length-Value) structure.
  • LSP Link State Protocol Data Unit
  • TLV Type-Length-Value
  • DUT1 will advertise two TLVs, corresponding to ⁇ IPv4,128/129> and ⁇ IPv6,129>, that is, slices that support two flexible algorithms of 128 and 129 under the IPv4 logical topology, and support 129 under the IPv6 logical topology.
  • the DUT6 node Due to the flooding of IS-IS LSP packets, all nodes in the network will receive information about flexible algorithm support based on multiple topologies from other nodes.
  • the DUT6 node receives the multi-topology FA TLV information notified by other nodes in the network, analyzes the received multi-topology FA TLV information notified by other nodes, forms the mapping relationship between the topology on the node and the FA-ID it supports, and saves In the database, the corresponding relationship is shown in Table 1 below.
  • DUT6 When DUT6 performs path calculation, it performs path calculation for IPv4 and IPv6 topologies.
  • shortest path first Short Path First, SPF
  • SPF Short Path First
  • the present application provides a data transmission method, as shown in FIG. 4 , including steps S410 and S420.
  • step S410 according to the received data, the routing table is queried, and the path in the routing table is the path calculated by the path calculation method described in the third aspect.
  • step S420 data is transmitted according to the queried path.
  • Data packets look up the routing table according to the matching flexible algorithm, and are forwarded according to the path calculated by the corresponding flexible algorithm, so as to realize traffic engineering based on FA slicing.
  • the embodiment of the present application provides an electronic device, including: at least one processor 501; a memory 502, on which at least one computer program is stored, when at least one computer program is executed by at least one processor During execution, at least one processor is made to implement the path notification method described in the first aspect, or the topology algorithm combination generation method described in the second aspect, or the path calculation method described in the third aspect, or The data transmission method according to the fourth aspect; and at least one I/O interface 503 connected between the processor and the memory and configured to realize information exchange between the processor and the memory.
  • Processor 501 is a device with data processing capability, including but not limited to central processing unit (CPU) etc.
  • memory 502 is a device with data storage capability, including but not limited to random access memory (RAM, more specifically SDRAM, DDR etc.), read-only memory (ROM), electrified erasable programmable read-only memory (EEPROM), flash memory (FLASH);
  • I/O interface (read-write interface) 503 is connected between processor 501 and memory 502, can realize processing Information interaction between the device 501 and the memory 502, including but not limited to a data bus (Bus).
  • Buss data bus
  • the processor 501 , the memory 502 and the I/O interface 503 are connected to each other through a bus 504 , and are further connected to other components of the computing device.
  • the embodiment of the present application provides a computer-readable storage medium. As shown in FIG. 8, a computer program is stored on the computer-readable storage medium. When the computer program is executed by a processor, the computer program according to the first aspect is implemented.
  • the path notification method and path calculation method proposed in the embodiment of the present application can perform slice route calculation based on different topologies in the multi-topology FA slicing scenario, avoiding path calculation errors caused by different slices supported by devices under multi-topology This problem increases the applicable scenarios of the FA slicing solution, ensures the stable operation of services, and improves the reliability of the network.
  • the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be composed of several physical components. Components cooperate to execute.
  • Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit circuit.
  • a processor such as a central processing unit, digital signal processor, or microprocessor
  • Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media).
  • computer storage media includes both volatile and nonvolatile media implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules, or other data. permanent, 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 disk (DVD) or other optical disk storage, magnetic cartridges, tape, magnetic disk storage or other magnetic storage devices, or can Any other medium used to store desired information and which can be accessed by a computer.
  • communication media typically embodies 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 may 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

本申请提供一种路径通告方法、一种拓扑算法组合生成方法、一种路径计算方法、一种数据传输方法、一种电子设备和一种计算机可读存储介质。所述路径通告方法包括：判断是否存在拓扑算法组合，所述拓扑算法组合包括当前设备上的至少一个拓扑的信息以及与所述拓扑对应的灵活算法的信息；以及当存在所述拓扑算法组合时，根据预设的通告策略通告所述拓扑算法组合。

Description

路径通告方法、拓扑算法组合生成方法、路径计算方法、数据传输方法、电子设备和计算机可读存储介质
相关申请的交叉引用
本申请要求于2021年11月30日提交的中国专利申请NO.202111445323.8的优先权，该中国专利申请的内容通过引用的方式整体合并于此。
技术领域
本申请涉及通信领域，尤其涉及路径通告方法、拓扑算法组合生成方法、路径计算方法、数据传输方法、电子设备和计算机可读存储介质。
背景技术
网络切片是第五代移动通信技术(5G，5th Generation Mobile Communication Technology)网络的关键技术之一，其目的是为了在承载网上提供定制化、相互隔离、质量可靠的端到端专属网络，该技术可以在同一个网络基础设施上切分出多个虚拟的网络，使得不同业务流量传输时在网络资源上逻辑隔离，从而适配各种不同类型服务的特征需求。
相关的网络中，内部网关协议(IGP，Internal Gateway Protocol)使用度量值(metric)进行路径计算以获得到达目的节点的最优路径。但是，这种路径计算方式无法满足5G网络切片的路径计算需求，比如在金融网络或者工业网络中，对链路的时延要求很高，期望流量转发时能够按照最短时延的路径进行传输。
为了能够满足不同业务的路径转发需求，互联网工程任务组织(IETF，The Internet Engineering Task Force)提出了灵活算法(FA，Flexible Algorithm)的概念。网络中FA使用灵活算法标识 (FA-ID，Flexible Algorithm Identification)进行唯一标识，FA-ID是一个字节，取值范围为128至255；每个FA-ID标识一种路径计算策略，该计算策略由用户进行自主定义，定义的路径计算策略称为灵活算法定义(FAD，Flexible Algorithm Definition)；目前的FAD内容主要包括两类：路径计算使用的度量值类型(metric-type)以及拓扑的约束条件；FAD以及FA-ID信息通过IGP协议在整个网络中进行泛洪，网络中的设备接收到对应的信息，然后根据本地支持的FA-ID，按照网络中配置的FAD，分别进行路径计算，得到用户期望的转发信息，指导不同的业务流量进行转发。
公开内容
第一方面，本申请提供了一种路径通告方法，包括：判断是否存在拓扑算法组合，所述拓扑算法组合包括当前设备上的至少一个拓扑的信息以及与所述拓扑对应的灵活算法的信息；以及当存在所述拓扑算法组合时，根据预设的通告策略通告所述拓扑算法组合。
第二方面，本申请提供了一种拓扑算法组合生成方法，包括：针对当前设备上的至少一个拓扑配置灵活算法；以及根据所述拓扑以及为该拓扑配置的所述灵活算法，生成拓扑算法组合。
第三方面，本申请提供了一种路径计算方法，包括：接收到包含拓扑算法组合的报文；所述拓扑算法组合包括拓扑信息和灵活算法信息；以及根据互相匹配的拓扑以及灵活算法对链路进行计算，得到路径。
第四方面，本申请提供了一种数据传输方法，包括：根据接收到的数据，查询路由表，所述路由表中的路径为第三方面中所述的路径计算方法计算获得的路径；以及根据查询到的路径传输数据。
第五方面，本申请提供了一种电子设备，所述电子设备包括：至少一个处理器；存储器，其上存储有至少一个计算机程序，当所述至少一个计算机程序被所述至少一个处理器执行，使得所述至少一个处理器实现根据第一方面中所述的路径通告方法、或根据第二方面中所述的拓扑算法组合生成方法、或根据第三方面中所述的路径计算方 法、或根据第四方面所述的数据传输方法；以及至少一个I/O接口，连接在所述处理器与存储器之间，配置为实现所述处理器与存储器的信息交互。
第六方面，本申请提供了一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时实现根据第一方面中所述的路径通告方法，或根据第二方面中所述的拓扑算法组合生成方法，或根据第三方面中所述的路径计算方法，或根据第四方面所述的数据传输方法。
附图说明
图1是本申请实施例提供的一种路径通告方法的流程图。
图2是本申请实施例提供的一种拓扑算法组合生成方法的流程图。
图3是本申请实施例提供的一种路径计算方法的流程图。
图4是本申请实施例提供的一种数据传输方法的流程图。
图5是本申请实施例提供的多拓扑FA切片场景的网络拓扑示意图。
图6是本申请实施例提供的包含MT-ID与FA-ID的IS-IS扩展TLV格式。
图7是本申请实施例提供的一种电子设备的示意图。
图8是本申请实施例提供的一种计算机可读存储介质的示意图。
具体实施方式
应当理解，此处所描述的具体实施例仅仅用以解释本申请，并不限定本申请。
在后续的描述中，使用用于表示元件的诸如“模块”、“部件”或“单元”的后缀仅为了有利于本申请的说明，其本身没有特有的意义。因此，“模块”、“部件”或“单元”可以混合地使用。
在一个物理拓扑划分多个逻辑拓扑的场景下，当前的灵活算法(FA)分片机制可能存在缺陷。(为描述方便，本文中所述的拓扑， 除特别说明是物理拓扑之外，均为逻辑拓扑)以中间系统到中间系统(IS-IS，Intermediate System-to-Intermediate System)协议为例，其通过RFC8667中定义的分段路由算法子类型长度值(SR-Algorithm Sub-TLV，Segment Routing Algorithm Sub Type-Length-Value)来通告FA-ID，该信息在通告时只通告该设备所支持的FA-ID，而不通告其对应的多拓扑标识(MT-ID，Multi-Topology Identification)，也不区分FA-ID属于多个拓扑中的哪一个拓扑。即某台设备一旦通告某个FA-ID，则网络上其它设备就会认为该设备在所有的拓扑中都支持该FA-ID。这种通告方式，在IS-IS仅配置一个拓扑时，或者在网络中IS-IS同时配置多个拓扑，但是多个拓扑要求生效的FA-ID相同时，是没有问题的。但是，如果在网络中IS-IS配置了多个拓扑，且在某个拓扑内，该设备支持的FA-ID存在差异时，就可能会导致路径计算错误。
如图5所示的网络中，IS-IS协议配置了IPv4与IPv6两种逻辑拓扑，实线标识IPv4的拓扑，虚线标识IPv6的拓扑，每台设备支持的FA信息标识如图所示，对于IPv4，每台设备都支持FA-ID＝128/129，但是对于IPv6，设备DUT5是不支持FA＝129；由于IS-IS协议在通告设备支持的FA-ID信息时不区分拓扑，所以每台设备通告时的信息都是FA-ID＝128/129；以DUT6为例，其收到DUT5通告的信息后，无法得知DUT5的IPv6是不支持FA-ID＝129的，所以在基于IPv6拓扑进行FA-ID＝129路径计算时，仍然会将DUT5加入到路径计算中，从而导致路径计算错误，比如到达DUT4，其计算出来的路径为DUT6--->DUT5--->DUT4，此时由于DUT5的IPv6不支持FA-ID＝129，所以流量就会在DUT5被丢弃。
基于上述场景中描述的路径计算错误的问题，关键在于灵活算法标识是以设备为单位对外通告，而不是以拓扑为单位进行通告，导致网络中其它设备无法区分DUT5是在哪个拓扑下支持FA-ID＝129的切片。因此，为了解决上述场景的问题，本申请提出了一种基于多拓扑的FA路径计算方案，发送端设备通过IS-IS、OSPF等路由协议的报文，或者通过其它的报文形式，将设备上的各个拓扑与灵活算法的 对应关系通告给邻居；接收端设备将各台设备上的各个拓扑与灵活算法的对应关系汇总起来，基于相同拓扑、相同灵活算法进行路径计算，从而可以有效解决上述路径计算错误的问题，避免了设备由于在多拓扑下所支持的切片不同而导致的路径计算错误的问题。
第一方面，本申请实施例提供一种路径通告方法，如图1所示，所述方法包括如下步骤S110和S120。
在步骤S110中，判断是否存在拓扑算法组合，所述拓扑算法组合包括当前设备上的至少一个拓扑的信息以及与所述拓扑对应的灵活算法的信息。
在步骤S120中，当存在所述拓扑算法组合时，根据预设的通告策略通告所述拓扑算法组合。
需要说明的是，本申请中所述的设备，均为可以支持灵活算法的节点。在形态上，可以不限于物理形态上的设备，也可以是软件定义网络中的节点，还可以是由一个节点划分出的多个虚拟节点。
需要说明的是，本申请所述的多拓扑不限于IPv4和IPv6，根据需要可以细分为IPv4单播、IPv4组播、IPv6单播、IPv6组播等。在一些实施方式中，可以根据常用的拓扑划分方式设置公有的MT-ID和私有的MT-ID。所谓公有的MT-ID就是各个厂商的各种设备形态均采用的MT-ID，方便实现各厂商设备之间的互通。所谓私有的MT-ID则是在预定的网络范围内自行约定设置的自定义的MT-ID，对于内部网络来说，私有的MT-ID对拓扑类型的定义可以更加灵活。
本申请的技术方案可用于多拓扑场景，但并不限于多拓扑场景，在预定的网络范围内，有可能部分设备配置有多逻辑拓扑，另一部分设备仅配置有一种逻辑拓扑，若设备上仅配置有一种拓扑，依然可以采用本申请提供的技术方案，将拓扑与对应的灵活算法生成拓扑算法组合，进行发布。
当前设备在配置灵活算法时，针对每个拓扑分别进行配置。不同的拓扑可以配置不同的灵活算法。
为了方便说明，此处以IS-IS协议为例。在IS-IS协议中新增一种报文通告格式，以支持通告多拓扑与其支持的灵活算法之间的关 系。例如，如图6所示，在扩展的IS-IS报文中，新增一种TLV格式通告该对应关系，即<MT-ID,FA-ID 1,FA-ID 2,...,FA-ID n>。对于该TLV格式，上方的数字表示各字段在报文中所占的位数，例如类型(Type)占0至7共8位，长度(Length)占8至15共8位，依此类推，不再赘述；多拓扑标识MT-ID用于标识不同的拓扑，每个拓扑可以支持多个不同的灵活算法，分别对应报文格式中的灵活算法标识FA-ID 1、FA-ID 2、FA-ID n等。
需要说明的是，此处只是为了说明方便，以扩展的IS-IS协议报文下新增拓扑算法组合的TLV格式为例。但实际上，向邻居通告所述拓扑算法组合时，可以选用的报文形式不限，只要能及时将所述拓扑算法组合通告到邻居设备即可，并不限于此方式。
将设备上的各个拓扑与灵活算法的对应关系通告给邻居后，接收端设备就可以将网络中各台设备上的各个拓扑与灵活算法的对应关系汇总起来，基于相同拓扑、相同灵活算法进行路径计算，从而有效解决由于在多拓扑下所支持的切片不同而导致的路径计算错误的问题。
在一些实施方式中，所述根据预设的通告策略通告所述拓扑算法组合包括：判断预定网络范围内所有的路由设备是否均支持所述拓扑算法组合；以及若所述所有的路由设备均支持所述拓扑算法组合，向所述预定网络范围内的所有邻居通告所述拓扑算法组合。
设备通告拓扑算法组合的TLV结构，可以不依赖于RFC8667中定义的SR-Algorithm Sub-TLV，即设备可以不通告SR-Algorithm Sub-TLV，而是直接按照本申请中的拓扑算法组合TLV进行通告。也可以根据预设的策略决定通告SR-Algorithm Sub-TLV，或通告拓扑算法组合TLV，或是两者都进行通告。
需要说明的是，与协议标准中的灵活算法组合相比，所述灵活算法组合中仅携带当前设备的灵活算法的信息，并不携带拓扑的信息。本实施方式是先判断在预定网络范围内，所有的路由设备是否均支持所述拓扑算法组合，若均支持，则发布所述拓扑算法组合；若非均支持，则按照协议标准中的灵活算法组合进行发布。
当然，可以既发布所述拓扑算法组合，又发布灵活算法组合，由收到报文的设备自行判断按照拓扑算法组合还是按照灵活算法组合去计算路径。也可以在预定网络范围内所有路由设备均支持拓扑算法组合时，只发布拓扑算法组合，不发布灵活算法组合，以减少报文发布数量。
因此，所述预设的通告策略，可以根据具体的需求进行设置，除上述的判断条件之外，也可以在设备或控制器上设置发布或不发布所述拓扑算法组合，还可以设置为既发布所述拓扑算法组合又发布灵活算法组合。此处不一一列举，凡是能根据所述预设的通告策略，判断是否发布所述拓扑算法组合的，均落入本申请保护范围内。
在一些实施方式中，所述根据预设的通告策略通告所述拓扑算法组合包括：向预定网络范围内的所有邻居通告拓扑算法组合。
在此类实施方式中，不判断在预定网络范围内的所有路由设备是否均支持所述拓扑算法组合，也不关心是否会发布协议标准中的灵活算法组合，而是均发布所述拓扑算法组合，以简化判断，减少耦合，即，只要当前设备是针对拓扑配置的灵活算法，就发布拓扑算法组合。至于接收端选择使用本申请提供的路径通告方法中的拓扑算法组合还是协议标准的灵活算法组合，则由接收端自行判断。
在一些实施方式中，当前设备存在灵活算法组合，所述灵活算法组合包括所述当前设备上的至少一种灵活算法的信息，所述路径通告方法还包括：向预定网络范围内的所有邻居通告所述灵活算法组合。
在此类实施方式中，不判断在预定网络范围内的所有路由设备是否均支持所述拓扑算法组合，也不关心是否会发布所述拓扑算法组合，而是均发布灵活算法组合。即无论本申请新增了什么步骤，协议标准的行为均要执行，并不因为拓扑算法组合的发布与否，而影响灵活算法组合的发布。至于接收端选择使用本申请提供的路径通告方法中的拓扑算法组合还是协议标准的灵活算法组合，则由接收端自行判断。
在一些实施方式中，拓扑的信息包括拓扑标识，灵活算法的信息包括灵活算法标识。
为了使所述拓扑算法组合在报文结构中更清晰，可以针对每个拓扑标识生成一个拓扑算法组合的类型长度值(TLV，Type-Length-Value)结构。当前设备在通告信息时，对于不同的拓扑标识，使用不同的TLV结构分别进行通告。在一个TLV结构中仅包含一个拓扑标识，同时在该TLV结构中填入的还有当前设备上该拓扑所支持的灵活算法标识。
在一些实施方式中，在一个TLV结构中，可以包括一个拓扑所支持的全部灵活算法标识，也可以只包括该拓扑所支持的部分灵活算法标识。
在一些实施方式中，在一个报文中，每一个拓扑仅携带一个拓扑算法组合的TLV结构。即对于每一个拓扑，在拓扑算法组合的TLV结构中，携带该拓扑在当前设备上所对应的所有灵活算法标识。这样做的好处是，简化接收端判断的复杂度。若一个拓扑对应多个TLV结构，接收端收到报文后需要判断是否已完成对该拓扑所有TLV结构的接收，而且要判断新收到的TLV结构是对前次收到的TLV结构的补充，还是对前次收到的TLV结构的更新。而在本实施方式中，每个拓扑仅生成一个拓扑算法组合的TLV结构，接收端收到后立刻可以将该拓扑算法组合的TLV结构中的拓扑和灵活算法用于路径计算，再次收到该拓扑的TLV结构时，均认为是对前次收到的TLV结构的更新。
在一些实施方式中，在所述根据预设的通告策略通告所述拓扑算法组合(步骤S120)中，通过以下任一种协议的报文携带所述拓扑算法组合：中间系统到中间系统(IS-IS)协议、开放式最短路径优先OSPF协议。
利用IS-IS协议或OSPF协议对灵活算法的支持，将拓扑算法组合通过IS-IS协议或OSPF协议报文在网络内泛洪，使网络内的设备快速获取各台设备上各个拓扑所支持的灵活算法信息，并基于多拓扑及灵活算法计算路径。并且，当物理拓扑发生变化、逻辑拓扑发生变化、或是灵活算法的配置发生变化时，均能通过IS-IS协议或OSPF协议快速感知快速更新，实现路径计算的快速收敛。
第二方面，本申请提供了一种拓扑算法组合生成方法，如图2 所示，包括步骤S210和S220。
在步骤S210中，针对当前设备上的至少一个拓扑配置灵活算法。
在步骤S220中，根据所述拓扑以及为该拓扑配置的所述灵活算法，生成拓扑算法组合。
进一步地，所述拓扑算法组合携带有拓扑标识以及为该拓扑标识表示的拓扑所配置的灵活算法的灵活算法标识。
在一些实施方式中，在所述针对当前设备上的至少一个拓扑配置灵活算法(步骤S210)中，为一个拓扑配置多个灵活算法。
在协议标准中，灵活算法的配置是以设备为单位，灵活算法标识也是以设备为单位对外通告，而不是以拓扑为单位通告。在同一台设备在不同拓扑下支持的灵活算法不同时，网络中其它设备无法区分该设备具体是在哪个拓扑下支持哪种FA切片。因此，发送端设备上首先要针对拓扑进行灵活算法的配置，然后才能通过IS-IS、OSPF等路由协议的报文，或者通过其它的报文形式，将设备上的各个拓扑与各拓扑下配置的灵活算法的对应关系，通过本申请第一方面的路径通告方法通告给邻居。
第三方面，本申请提供了一种路径计算方法，如图3所示，包括步骤S310和S320。
在步骤S310中，接收到包含拓扑算法组合的报文；所述拓扑算法组合包括拓扑信息和灵活算法信息。
在步骤S320中，根据互相匹配的拓扑以及灵活算法对链路进行计算，得到路径。
在一些实施方式中，所述路径计算还包括：在所述接收到包含拓扑算法组合的报文之后，将接收到的所述报文中的所述拓扑算法组合存入数据库；所述根据互相匹配的拓扑以及灵活算法对链路进行计算(步骤S320)包括：根据所述数据库中保存的互相匹配的所述拓扑信息、灵活算法信息以及链路状态信息进行计算。
在接收端设备基于多拓扑进行FA切片路径计算时，是既区分拓扑又区分灵活算法的。对于路径计算所经过的设备，需要在数据库中检查该设备是否支持对应的拓扑和灵活算法，如果该设备不支持对应 的拓扑或灵活算法，则需要在路径计算中排除。例如，接收端的拓扑算法组合中有<MT-ID1,FA-ID1,FA-ID2>，<MT-ID2,FA-ID1,FA-ID2>，则分别对数据库中支持<MT-ID1,FA-ID1>、<MT-ID1,FA-ID2>、<MT-ID2,FA-ID1>、<MT-ID2,FA-ID2>的设备进行路径计算。
在一些实施方式中，所述路径计算方法还包括：
若从同一台设备收到多个包含相同的拓扑标识的所述拓扑算法组合，则所述从同一台设备收到的多个包含相同的拓扑标识的所述拓扑算法组合不存入所述数据库中。
本申请对一台设备一次发布的报文中携带拓扑算法组合中是否存在多个相同的拓扑标识不做限制，但在此实施方式中，如前所述，为了简化接收端判断的复杂度，在收到的同一序列号的报文中，每个拓扑仅生成一个拓扑算法组合的TLV结构。换言之，在一台设备一次发布的各个拓扑算法组合中，不应出现多个TLV结构中携带有相同的拓扑标识。因此，接收端设备接收到拓扑算法组合TLV后，需要对该TLV进行有效性检查，对于同一个节点通告的携带某个MT-ID的拓扑算法组合，仅允许通告一次，如果携带相同的MT-ID的TLV出现多次，则需要忽略掉该MT-ID对应的所有的TLV。因为若收到多个包含相同的拓扑标识的TLV结构，则认为发送端的发布策略与本接收设备不匹配，或者认为此报文不可信，因此，不存入所述数据库中，本次收到的所有包含此相同拓扑标识的拓扑算法组合将无法参与路径计算。
以IS-IS协议为例，收到的拓扑信息、灵活算法信息以及链路状态信息均会存入相应的数据库中，然后根据数据库中的互相匹配的所述拓扑信息、灵活算法信息以及链路状态信息进行计算。而不存入所述数据库中，也就意味着，这些信息无法参与路径计算。
进一步地，从该设备收到的所有包含此相同拓扑标识的拓扑算法组合，即使已经有存入数据库中的，也应删除。
在一些实施方式中，若从同一台设备同时收到所述拓扑算法组合与灵活算法组合，所述灵活算法组合包括至少一个灵活算法标识，所述路径计算方法还包括：
若所述灵活算法组合中的所述灵活算法标识包含所述拓扑算法 组合中的所述灵活算法标识，则执行所述根据互相匹配的拓扑以及灵活算法对链路进行计算，得到路径(步骤S320)；
若所述灵活算法组合中的所述灵活算法标识未包含所述拓扑算法组合中的所述灵活算法标识，则该拓扑算法组合不存入所述数据库中。
在预定的网络范围内，有可能部分设备配置有多逻辑拓扑，另一部分设备仅配置有一种逻辑拓扑。当网路中存在部分不支持拓扑算法组合的设备时，在发送端设备上，根据发布策略，可以同时发布基于协议标准的灵活算法组合，也可以在发布灵活算法组合的同时发布本申请提出的路径通告方法中的拓扑算法组合。因此，在接收端设备上有可能同时收到灵活算法组合和拓扑算法组合。因为灵活算法组合是以设备为单位发布，拓扑算法组合是以该设备上的各个拓扑为单位发布，因此，可以理解为灵活算法组合是该设备所支持的灵活算法的全集，拓扑算法组合是该设备所支持的灵活算法的子集。所以，对于同一台设备来说，发出的拓扑算法组合中的各个灵活算法，均应包含在灵活算法组合中的所有灵活算法之中。不应存在拓扑算法组合中的某个灵活算法，未包含在灵活算法组合中的所有灵活算法之中的异常情况。当异常情况发生时，则认为发送端所发布的拓扑算法组合存在错误，因此忽略该拓扑算法组合，将其排除在路径计算之外。
在预定的网络范围内的设备接收到拓扑算法组合TLV后，解析对应的<MT-ID,FA-ID>信息，并记录到数据库中。在本地基于多拓扑进行FA切片路径计算时，对于路径计算所经过的设备，需要在数据库中检查其是否支持对应的FA-ID，如果该设备不支持，则需要在路径计算中排除。
通过上述步骤，最终计算出基于多拓扑的FA切片路由，可以解决之前描述的多拓扑场景下的FA切片路径计算错误的问题，即接收端设备可以方便地识别出网络中某台设备对应的拓扑上支持的FA-ID，从而将其加入到FA路径计算中，避免路径计算错误，增加了FA切片方案可适用的场景，保障了业务稳定运行，提升了网络的可靠性。
下面结合1个示例，对本申请第一个方面所述的路径通告方法和第二方面所述的路径计算方法应用在多拓扑网络切片场景下进行路径计算的过程进行介绍。
需要说明的是，本示例中以IS-IS协议为例，主要针对本申请提供的路径通告方法和路径计算方法进行说明。关于切片的具体规划、IS-IS协议的邻居建立、具体的路由计算等步骤，在此不做过多描述。
如图5所示，IS-IS配置了IPv4与IPv6两个逻辑拓扑，实线表示IPv4的拓扑，虚线表示IPv6的拓扑，每个节点支持的FA信息标识如图所示，对于IPv4，每个节点都支持FA-ID＝128/129，但是对于IPv6，节点DUT5是不支持FA＝129。定义FA＝129按照链路的流量工程度量值(te-metric)进行计算，假设链路的te-metric都为10。
网络中的节点基于多拓扑进行FA的配置，然后通告IS-IS链路状态协议数据单元(LSP，Link State Protocol Data Units)报文进行泛洪，泛洪时使用本申请中的类型长度值(TLV，Type-Length-Value)结构。以DUT1为例，DUT1将通告两个TLV，分别对应<IPv4,128/129>和<IPv6,129>，即IPv4逻辑拓扑下支持128和129两种灵活算法的切片，IPv6逻辑拓扑下支持129一种灵活算法的切片；而对于DUT5，虽然支持IPv6，但不支持基于IPv6逻辑拓扑的切片，则仅通告一个TLV<IPv4,128/129>，无需通告IPv6的FA-ID支持情况。其它节点类似，在此不再赘述。
由于IS-IS的LSP报文的泛洪，在网络内的节点均会收到来自其它节点的基于多拓扑的灵活算法支持情况。以DUT6节点为例，接收网络中其它节点通告的多拓扑FA TLV信息，对接收到的其他节点通告的多拓扑FA TLV信息进行解析，形成节点上拓扑与其支持的FA-ID的映射关系，保存在数据库中，其对应关系如下表1所示。
表1
Figure PCTCN2022135306-appb-000001
Figure PCTCN2022135306-appb-000002
DUT6在进行路径计算时，分别针对IPv4和IPv6拓扑进行路径计算。在进行IPv6拓扑的路径计算时，由于本地支持FA-ID＝129，所以会按照FA-ID＝129的路径计算规则进行计算(例如按照te-metric选择一个最优的路径)。
在计算过程中，按照最短路径优先(Short Path First，SPF)算法遍历网络中所有的节点信息，并到数据库中查询该节点是否支持对应的FA-ID，如果支持则认为该节点可以作为转发的下一跳继续计算，如果未查询到该节点支持对应的FA-ID，则将该节点排除，不作为转发的下一跳。
当遍历到节点DUT5时，DUT6查找数据库发现DUT5的IPv6拓扑并不支持FA-ID＝129，所以DUT6不会将其加入到路径计算中，因此DUT6计算到达网络中其它节点的路径是不会包括DUT5的，DUT5本身在FA-ID＝129的计算中也是不可达的。
通过上述方案，可以实现预期的路径计算目的，即在FA-ID＝129的IPv6切片计算中，剔除了节点DUT5，避免了流量转发至DUT5并丢包，引起业务中断。
第四方面，本申请提供了一种数据传输方法，如图4所示，包括步骤S410和S420。
在步骤S410中，根据接收到的数据，查询路由表，所述路由表中的路径为第三方面中所述的路径计算方法计算获得的路径。
在步骤S420中，根据查询到的路径传输数据。
数据报文根据所匹配的灵活算法查路由表，按照对应的灵活算 法计算的路径进行转发，以实现基于FA切片的流量工程。
第五方面，如图7所示，本申请实施例提供一种电子设备，包括：至少一个处理器501；存储器502，其上存储有至少一个计算机程序，当至少一个计算机程序被至少一个处理器执行时，使得至少一个处理器实现根据第一方面中所述的路径通告方法，或根据第二方面中所述的拓扑算法组合生成方法，或根据第三方面中所述的路径计算方法，或根据第四方面所述的数据传输方法；以及至少一个I/O接口503，连接在处理器与存储器之间，配置为实现处理器与存储器的信息交互。
处理器501为具有数据处理能力的器件，包括但不限于中央处理器(CPU)等；存储器502为具有数据存储能力的器件，包括但不限于随机存取存储器(RAM，更具体如SDRAM、DDR等)、只读存储器(ROM)、带电可擦可编程只读存储器(EEPROM)、闪存(FLASH)；I/O接口(读写接口)503连接在处理器501与存储器502间，能实现处理器501与存储器502的信息交互，包括但不限于数据总线(Bus)等。
在一些实施方式中，处理器501、存储器502和I/O接口503通过总线504相互连接，进而与计算设备的其它组件连接。
第六方面，本申请实施例提供一种计算机可读存储介质，如图8所示，计算机可读存储介质上存储有计算机程序，计算机程序被处理器执行时实现根据第一方面中所述的路径通告方法，或根据第二方面中所述的拓扑算法组合生成方法，或根据第三方面中所述的路径计算方法，或根据第四方面所述的数据传输方法。
本申请实施例提出的路径通告方法和路径计算方法，在多拓扑的FA切片场景下，能够基于不同拓扑进行切片路由计算，避免了设备由于在多拓扑下所支持的切片不同而导致路径计算错误的问题，增加了FA切片方案可适用的场景，保障了业务稳定运行，提升了网络的可靠性。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统、设备中的功能模块/单元可以被实施为软件、固件、 硬件及其适当的组合。
在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些物理组件或所有物理组件可以被实施为由处理器(如中央处理器、数字信号处理器或微处理器)执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
以上参照附图说明了本申请的优选实施例，并非因此局限本申请的权利范围。本领域技术人员不脱离本申请的范围和实质内所作的任何修改、等同替换和改进，均应在本申请的权利范围之内。

Claims (16)

  1. 一种路径通告方法，包括：
    判断是否存在拓扑算法组合，所述拓扑算法组合包括当前设备上的至少一个拓扑的信息以及与所述拓扑对应的灵活算法的信息；以及
    当存在所述拓扑算法组合时，根据预设的通告策略通告所述拓扑算法组合。
  2. 根据权利要求1所述的路径通告方法，其中，所述根据预设的通告策略通告所述拓扑算法组合包括：
    判断预定网络范围内所有的路由设备是否均支持所述拓扑算法组合；以及
    若所述所有的路由设备均支持所述拓扑算法组合，向所述预定网络范围内的所有邻居通告所述拓扑算法组合。
  3. 根据权利要求1所述的路径通告方法，其中，所述根据预设的通告策略通告所述拓扑算法组合包括：
    向预定网络范围内的所有邻居通告所述拓扑算法组合。
  4. 根据权利要求1所述的路径通告方法，其中，当前设备存在灵活算法组合，所述灵活算法组合包括所述当前设备上的至少一种灵活算法的信息，所述路径通告方法还包括：
    向预定网络范围内的所有邻居通告所述灵活算法组合。
  5. 根据权利要求1所述的路径通告方法，其中，所述拓扑的信息包括拓扑标识，所述灵活算法的信息包括灵活算法标识。
  6. 根据权利要求1至5中任意一项所述的路径通告方法，其中，在所述根据预设的通告策略通告所述拓扑算法组合中，通过以下任一 种协议的报文携带所述拓扑算法组合：
    中间系统到中间系统(IS-IS)协议、开放式最短路径优先(OSPF)协议。
  7. 一种拓扑算法组合生成方法，包括：
    针对当前设备上的至少一个拓扑配置灵活算法；以及
    根据所述拓扑以及为所述拓扑配置的所述灵活算法，生成拓扑算法组合。
  8. 根据权利要求7所述的拓扑算法组合生成方法，其中，所述拓扑算法组合携带有拓扑标识以及为所述拓扑标识表示的拓扑所配置的灵活算法的灵活算法标识。
  9. 根据权利要求7或8所述的拓扑算法组合生成方法，其中，所述针对当前设备上的至少一个拓扑配置灵活算法包括为一个拓扑配置多个灵活算法。
  10. 一种路径计算方法，包括：
    接收到包含拓扑算法组合的报文；其中，所述拓扑算法组合包括拓扑信息和灵活算法信息；以及
    根据互相匹配的拓扑以及灵活算法对链路进行计算，得到路径。
  11. 根据权利要求10所述的路径计算方法，还包括：
    在所述接收到包含拓扑算法组合的报文之后，将接收到的所述报文中的所述拓扑算法组合存入数据库；
    所述根据互相匹配的拓扑以及灵活算法对链路进行计算包括：
    根据所述数据库中保存的互相匹配的所述拓扑信息、灵活算法信息以及链路状态信息进行计算。
  12. 根据权利要求11所述的路径计算方法，还包括：
    若从同一台设备收到多个包含相同的拓扑标识的所述拓扑算法组合，则所述从同一台设备收到的多个包含相同的拓扑标识的所述拓扑算法组合不存入所述数据库中。
  13. 根据权利要求11所述的路径计算方法，其中，若从同一台设备同时收到所述拓扑算法组合与灵活算法组合，所述灵活算法组合包括至少一个灵活算法标识，所述方法还包括：
    若所述灵活算法组合中的所述灵活算法标识包含所述拓扑算法组合中的所述灵活算法标识，则执行所述根据互相匹配的拓扑以及灵活算法对链路进行计算，得到路径；
    若所述灵活算法组合中的所述灵活算法标识未包含所述拓扑算法组合中的所述灵活算法标识，则该拓扑算法组合不存入所述数据库中。
  14. 一种数据传输方法，包括：
    根据接收到的数据，查询路由表，所述路由表中的路径为权利要求10至13中任意一项所述的路径计算方法计算获得的路径；以及
    根据查询到的路径传输数据。
  15. 一种电子设备，所述电子设备包括：
    至少一个处理器；
    存储器，其上存储有至少一个计算机程序，当所述至少一个计算机程序被所述至少一个处理器执行时，使得所述至少一个处理器实现根据权利要求1至6中任意一项所述的路径通告方法，或根据权利要求7至9中任意一项所述的拓扑算法组合生成方法，或根据权利要求10至13中任意一项所述的路径计算方法，或根据权利要求14所述的数据传输方法；以及
    至少一个I/O接口，连接在所述处理器与存储器之间，配置为实现所述处理器与存储器的信息交互。
  16. 一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时实现根据权利要求1至6中任意一项所述的路径通告方法，或根据权利要求7至9中任意一项所述的拓扑算法组合生成方法，或根据权利要求10至13中任意一项所述的路径计算方法，或根据权利要求14所述的数据传输方法。
PCT/CN2022/135306 2021-11-30 2022-11-30 路径通告方法、拓扑算法组合生成方法、路径计算方法、数据传输方法、电子设备和计算机可读存储介质 WO2023098703A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111445323.8A CN116208542A (zh) 2021-11-30 2021-11-30 路径通告方法、路径计算方法、电子设备和可读存储介质
CN202111445323.8 2021-11-30

Publications (1)

Publication Number Publication Date
WO2023098703A1 true WO2023098703A1 (zh) 2023-06-08

Family

ID=86506473

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/135306 WO2023098703A1 (zh) 2021-11-30 2022-11-30 路径通告方法、拓扑算法组合生成方法、路径计算方法、数据传输方法、电子设备和计算机可读存储介质

Country Status (2)

Country Link
CN (1) CN116208542A (zh)
WO (1) WO2023098703A1 (zh)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10601724B1 (en) * 2018-11-01 2020-03-24 Cisco Technology, Inc. Scalable network slice based queuing using segment routing flexible algorithm
CN112054960A (zh) * 2019-02-13 2020-12-08 华为技术有限公司 一种路径计算方法、装置及设备
CN114866454A (zh) * 2021-02-04 2022-08-05 诺基亚通信公司 基于约束网络拓扑切片的服务区分

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10601724B1 (en) * 2018-11-01 2020-03-24 Cisco Technology, Inc. Scalable network slice based queuing using segment routing flexible algorithm
CN112054960A (zh) * 2019-02-13 2020-12-08 华为技术有限公司 一种路径计算方法、装置及设备
CN114866454A (zh) * 2021-02-04 2022-08-05 诺基亚通信公司 基于约束网络拓扑切片的服务区分

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
IJ. WIJNANDS INDIVIDUAL K. RAZA M. MISHRA A. BUDHIRAJA CISCO SYSTEMS, INC. Z. ZHANG JUNIPER NETWORKS A. GULKO EDWARD JONES WEALTH : "mLDP Extensions for Multi-Topology Routing draft-wijnands-mpls-mldp-multi-topology-03; draft-wijnands-mpls-mldp-multi-topology-03.txt", MLDP EXTENSIONS FOR MULTI-TOPOLOGY ROUTING DRAFT-WIJNANDS-MPLS-MLDP-MULTI-TOPOLOGY-03; DRAFT-WIJNANDS-MPLS-MLDP-MULTI-TOPOLOGY-03.TXT; INTERNET-DRAFT: MPLS WORKING GROUP, INTERNET ENGINEERING TASK FORCE, IETF; STANDARDWORKINGDRAFT, INTERNET SOCIETY (, no. 03, 25 October 2021 (2021-10-25), Internet Society (ISOC) 4, rue des Falaises CH- 1205 Geneva, Switzerland, pages 1 - 14, XP015148808 *
P. PSENAK, ED. CISCO SYSTEMS S. HEGDE JUNIPER NETWORKS, INC. C. FILSFILS K. TALAULIKAR CISCO SYSTEMS, INC. A. GULKO THOMSON REUTER: "IGP Flexible Algorithm; draft-ietf-lsr-flex-algo-06.txt", IGP FLEXIBLE ALGORITHM; DRAFT-IETF-LSR-FLEX-ALGO-06.TXT; INTERNET-DRAFT: NETWORK WORKING GROUP, INTERNET ENGINEERING TASK FORCE, IETF; STANDARDWORKINGDRAFT, INTERNET SOCIETY (ISOC) 4, RUE DES FALAISES CH- 1205 GENEVA, SWITZERLAND, no. 06, 21 February 2020 (2020-02-21), Internet Society (ISOC) 4, rue des Falaises CH- 1205 Geneva, Switzerland , pages 1 - 34, XP015137841 *

Also Published As

Publication number Publication date
CN116208542A (zh) 2023-06-02

Similar Documents

Publication Publication Date Title
US8170033B1 (en) Virtual private local area network service (VPLS) flush mechanism for BGP-based VPLS networks
US8018873B1 (en) Enhanced link state protocol for identifying broadcast networks
WO2020001622A1 (zh) 生成标签转发表的方法、报文发送方法、装置及设备
US11611509B2 (en) Communication method, communications device, and communications system
WO2021164249A1 (zh) 一种发送报文的方法、设备及系统
WO2020135395A1 (zh) 一种跨内部网关协议的前缀标识通告方法和装置
CN112868214B (zh) 分组内的协调负载转移oam记录
JP7053901B2 (ja) ループ回避通信方法、ループ回避通信デバイスおよびループ回避通信システム
US11848853B2 (en) System and method for handling IGP flooding topology inconsistency
US11888727B2 (en) Extending BGP protection for SR path ingress protection
CN113785542A (zh) 用于内部网关协议（igp）快速收敛的系统和方法
CN110881006B (zh) 发送报文的方法、网络设备及计算机存储介质
WO2023036087A1 (zh) 路由通告方法、路径建立方法、业务数据的传输方法、自治系统边界路由器
WO2023098703A1 (zh) 路径通告方法、拓扑算法组合生成方法、路径计算方法、数据传输方法、电子设备和计算机可读存储介质
US20220150167A1 (en) Bier packet processing method, network device, and system
WO2022062956A1 (zh) 一种流量处理方法、装置和网络设备
CN112737937B (zh) 信息跨域通告方法、系统和边界路由器
WO2023173989A1 (zh) 转发表的生成方法及装置、存储介质、电子装置
WO2022267083A1 (zh) 确定路径的方法和装置
WO2022257773A1 (zh) 路由检测方法、设备、系统及存储介质
WO2022188488A1 (zh) 路径建立方法及其装置、节点、计算机可读存储介质
WO2022042610A1 (zh) 信息处理方法、网络控制器、节点及计算机可读存储介质
WO2022218132A1 (zh) 路由更新方法、装置及系统
WO2020048214A1 (zh) 发送报文的方法、网络设备及计算机存储介质
CN118055138A (zh) 标签分发协议邻居保活方法、装置和设备

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

Country of ref document: EP

Kind code of ref document: A1