CN116208542A

CN116208542A - Path announcement method, path calculation method, electronic device, and readable storage medium

Info

Publication number: CN116208542A
Application number: CN202111445323.8A
Authority: CN
Inventors: 孙晋松; 朱林; 张伟伟
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2021-11-30
Filing date: 2021-11-30
Publication date: 2023-06-02
Also published as: WO2023098703A1

Abstract

The invention provides a path notification method, a topology algorithm combination generation method, a path calculation method, a data transmission method, electronic equipment and a computer readable storage medium. The path notification method comprises the following steps: judging whether a topology algorithm combination exists or not, wherein the topology algorithm combination comprises information of at least one topology on the current equipment and information of a flexible algorithm corresponding to the topology; and when the topology algorithm combination exists, advertising the topology algorithm combination according to a preset advertising strategy. The path calculation method comprises the following steps: receiving a message containing a topology algorithm combination; wherein the topology algorithm combination comprises topology information and flexible algorithm information; and calculating the links according to the topology matched with each other and a flexible algorithm to obtain paths.

Description

Path announcement method, path calculation method, electronic device, and readable storage medium

Technical Field

The present invention relates to the field of communications, and in particular, 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.

Background

Network slicing is one of the key technologies of the fifth generation mobile communication technology (5G,5th Generation Mobile Communication Technology) network, and aims to provide customized, mutually isolated and reliable-quality end-to-end proprietary networks on a carrier network, and the technology can split a plurality of virtual networks on the same network infrastructure, so that different service flows are logically isolated on network resources during transmission, and thus, the characteristic requirements of various different types of services are adapted.

In conventional networks, the interior gateway protocol (IGP, internal Gateway Protocol) protocol uses metric values (metrics) for path computation to obtain an optimal path to the destination node. However, the way of calculating the path cannot meet the way of calculating the path of 5G slices, such as a financial network or an industrial network, which has high requirement on the time delay of a link, and can transmit according to the shortest time delay when the traffic is expected to be forwarded.

In order to be able to meet the path forwarding requirements of different services, the internet engineering task force (IETF, the Internet Engineering Task Force) proposes the concept of flexible algorithms (FA, flexible Algorithm). The FA in the network uses flexible algorithm identification (FA-ID, flexible Algorithm Identification) to carry out unique identification, wherein the FA-ID is one byte, and the value range is 128-255; each FA-ID identifies a computation policy that is autonomously defined by the user, the defined computation policy being referred to as a flexible algorithm definition (FAD, flexible Algorithm Definition); the current FAD content mainly includes two types: calculating constraint conditions of metric value type (metric-type) and topology used by the road; the FAD and the FA-ID information are flooded in the whole network through the IGP protocol, equipment in the network receives the corresponding information, and then path calculation is carried out according to the FAD configured in the network according to the FA-ID supported locally, so that forwarding information expected by a user is obtained, and different service flows are guided to be forwarded.

Disclosure of Invention

The invention provides a path notification method, a topology algorithm combination generation method, a path calculation method, a data transmission method, electronic equipment and a computer readable storage medium.

In a first aspect, the present invention provides a path notification method, including:

judging whether a topology algorithm combination exists or not, wherein the topology algorithm combination comprises information of at least one topology on the current equipment and information of a flexible algorithm corresponding to the topology;

and when the topology algorithm combination exists, advertising the topology algorithm combination according to a preset advertising strategy.

In some embodiments, the advertising the topology algorithm combination according to a preset advertising policy includes:

judging whether all routing devices in a preset network range support the topology algorithm combination or not;

and if all the routing devices support the topology algorithm combination, notifying all neighbors in the range of the preset network of the topology algorithm combination.

the topology algorithm combination is advertised to all neighbors within a predetermined network range.

In some embodiments, the current device has a flexible algorithm combination including information of at least one flexible algorithm on the current device, the path advertisement method further comprising:

the flexible algorithm combination is advertised to all neighbors within a predetermined network range.

In some embodiments, the information of the topology includes a topology identification and the information of the flexible algorithm includes a flexible algorithm identification.

Optionally, in the step of advertising the topology algorithm combination according to a preset advertising policy, the topology algorithm combination is carried by a message of any one of the following protocols:

intermediate system to intermediate system IS-IS protocol, open shortest path first OSPF protocol.

In a second aspect, the present invention provides a topology algorithm combination generating method, 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.

Further, the topology algorithm combination carries a topology identification and a flexible algorithm identification of a flexible algorithm configured for the topology represented by the topology identification.

Optionally, in the step of configuring the flexible algorithm for at least one topology on the current device, a plurality of flexible algorithms are configured for one topology.

In a third aspect, the present invention provides a path computation method, including:

receiving a message containing a topology algorithm combination; wherein the topology algorithm combination comprises topology information and flexible algorithm information;

and calculating the links according to the topology matched with each other and a flexible algorithm to obtain paths.

In some embodiments, after the receiving the message including the topology algorithm combination, the method further includes:

combining the topology algorithm in the received message and storing the combination into a database;

the step of calculating the link according to the topology matched with each other and the flexible algorithm comprises the following steps:

and calculating according to the topology information, flexible algorithm information and link state information which are mutually matched and stored in the database.

Further, the method further comprises:

and if a plurality of topological algorithm combinations containing the same topological identification are received from the same equipment, the plurality of topological algorithm combinations containing the same topological identification are received from the same equipment and are not stored in the database.

Further, if the topology algorithm combination and the flexible algorithm combination are received from the same device at the same time, the flexible algorithm combination includes at least one flexible algorithm identifier, the method further includes:

if the flexible algorithm identification in the flexible algorithm combination comprises the flexible algorithm identification in the topology algorithm combination, executing the step of calculating a link according to the topology matched with each other and the flexible algorithm to obtain a path;

if the flexible algorithm identification in the flexible algorithm combination does not contain the flexible algorithm identification in the topology algorithm combination, the topology algorithm combination is not stored in the database.

In a fourth aspect, the present invention provides a data transmission method, including:

inquiring a routing table according to the received data, wherein the path in the routing table is a path obtained by calculation by any path calculation method in the third aspect;

and transmitting data according to the inquired path.

In a fifth aspect, the present invention provides an electronic device, including:

one or more processors;

a memory having one or more programs stored thereon, which when executed by the one or more processors, cause the one or more processors to implement the path advertisement method according to any one of the first aspects, or the topology algorithm combination generation method according to any one of the second aspects, or the path calculation method according to any one of the third aspects, or the data transmission method according to the fourth aspect;

one or more I/O interfaces coupled between the processor and the memory configured to enable information interaction of the processor with the memory.

In a sixth aspect, the present invention provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the path advertisement method according to any one of the first aspects, or the topology algorithm combination generation method according to any one of the second aspects, or the path calculation method according to any one of the third aspects, or the data transmission method according to the fourth aspect.

According to the path notification method and the path calculation method provided by the embodiment of the invention, under the multi-topology FA slicing scene, the slicing route calculation can be performed based on different topologies, so that the problem of path calculation errors caused by different slices supported by equipment under the multi-topology is avoided, the applicable scene of the FA slicing scheme is increased, the stable operation of the service is ensured, and the reliability of the network is improved.

Drawings

Fig. 1 is a flowchart of a path notification method according to an embodiment of the present invention.

Fig. 2 is a flowchart of a topology algorithm combination generating method according to an embodiment of the present invention.

Fig. 3 is a flowchart of a path calculation method according to an embodiment of the present invention.

Fig. 4 is a flowchart of a data transmission method according to an embodiment of the present invention.

Fig. 5 is a network topology schematic diagram of a multi-topology FA slice scenario provided by an embodiment of the present invention.

Fig. 6 IS an IS-IS extended TLV format including MT-ID and FA-ID provided in an embodiment of the present invention.

Fig. 7 is a schematic diagram of an electronic device according to an embodiment of the present invention.

Fig. 8 is a schematic diagram of a computer readable storage medium according to an embodiment of the present invention.

Detailed Description

It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.

In the following description, suffixes such as "module", "part" or "unit" for representing elements are used only for facilitating the description of the present invention, and have no particular meaning in themselves. Thus, "module," "component," or "unit" may be used in combination.

The inventor of the present invention has found that in the scenario where one physical topology divides a plurality of logical topologies, the current FA fragmentation mechanism has a defect. (for convenience of description, the topologies described herein are logical topologies except for the physical topology, which IS exemplified by the intermediate system-to-intermediate system (IS-IS, intermediate System-to-Intermediate System) protocol, which advertises FA-IDs by means of a segment routing Algorithm subtype Length Value (SR-Algorithm Sub-TLV, segment Routing Algorithm Sub Type-Length-Value) defined in RFC8667, which advertises only FA-IDs supported by the device at the time of advertisement, without advertising its corresponding Multi-topology identification (MT-ID, multi-Topology Identification), without distinguishing which of a plurality of topologies the FA-IDs belong to. I.e., a device, upon advertising a certain FA-ID, other devices on the network will consider the device to support the FA-ID in all topologies. This advertising approach IS not problematic when the IS-IS configures only one topology, or IS-IS configures multiple topologies simultaneously in the network, but the FA-IDs that are required to be valid for multiple topologies are the same. However, if the IS-IS configures multiple topologies in the network, and there IS a difference in the FA-IDs supported by the device within a certain topology, a calculation error may be caused.

In the network shown in fig. 5, IS-IS configures two logical topologies of IPv4 and IPv6, the solid line identifies the topology of IPv4, the broken line identifies the topology of IPv6, the FA information identification supported by each device IS as described above, for IPv4, each device supports FA-id=128/129, but for IPv6, device DUT5 does not support fa=129; since IS-IS does not distinguish between topologies when advertising FA-ID information supported by devices, the information at the time of each device advertisement IS FA-id=128/129; taking DUT6 as an example, after it receives the information advertised by DUT5, it cannot know that IPv6 of DUT5 does not support FA-id=129, so when performing FA-id=129 routing based on IPv6 topology, DUT5 will still be added to the path calculation, resulting in a path calculation error, for example, reaching DUT4, where the calculated path is DUT6 —dut5 —dut4, and at this time, since IPv6 of DUT5 does not support FA-id=129, traffic will be discarded at DUT 5.

Based on the problem of path computation errors described in the above scenario, the inventors found that the key to the problem is that the flexible algorithm identification is advertised externally in units of devices, rather than topology-by-topology, resulting in other devices in the network being unable to distinguish under which topology the DUT5 supports the slice of FA-id=129. Therefore, in order to solve the above-mentioned problem of scene, the inventor has proposed a FA route calculation scheme based on multiple topologies, the originating device announces the corresponding relation between each topology and flexible algorithm on the device to the neighbors through the messages of routing protocols such as IS-IS, OSPF, etc., or through other message forms; the receiving device gathers the corresponding relations 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 that the problems can be effectively solved through the scheme, and the problem of path calculation errors caused by different slices supported by the device under multiple topologies is avoided.

In a first aspect, an embodiment of the present invention provides a path notification method, as shown in fig. 1, where the method includes the following steps:

in step S110, it is determined whether a topology algorithm combination exists, where the topology algorithm combination includes information of at least one topology on a current device and information of a flexible algorithm corresponding to the topology;

in step S120, when the topology algorithm combination exists, the topology algorithm combination is advertised according to a preset advertisement policy.

It should be noted that, the devices described in the present invention are all nodes that can support flexible algorithms. The present invention is not limited to the physical configuration device, and may be a node in a software defined network, or may be a plurality of nodes virtually divided by one node.

The multi-topology described in the present invention is not limited to IPv4 and IPv6, and may be subdivided into IPv4 unicast, IPv4 multicast, IPv6 unicast, IPv6 multicast, and the like as needed. In a specific implementation, the public MT-ID and the private MT-ID may be set according to a common topology division manner. The common MT-ID is adopted by various equipment forms of various manufacturers, so that the intercommunication among the equipment of various manufacturers is conveniently realized. The private MT-ID is a custom MT-ID which is set by self-contract in the range of a preset network, and the definition of the topology type by the private MT-ID can be more flexible for the internal network.

The technical scheme of the invention can be used for a multi-topology scene, but is not only used for the multi-topology scene, and in a preset network range, it is possible that part of devices are configured with multiple logic topologies, and the other part of devices are configured with only one logic topology. If only one topology is configured on the device, the technical scheme of the invention can still be adopted, and the topology is combined with the corresponding flexible algorithm generation topology algorithm for release.

When the current device configures the flexible algorithm, the current device is configured for each topology respectively. Different topologies may configure different flexible algorithms.

For ease of illustration, the IS-IS protocol IS exemplified herein. A message notification format IS newly added in the IS-IS protocol to support the relationship between the notification multi-topology and the flexible algorithms supported by the notification multi-topology. For example, as shown in fig. 6, in the extended IS-IS message, a TLV format IS added to announce the correspondence, < MT-ID, FA-ID1, FA-ID2, & gt, FA-ID n >. For the TLV format, the upper digits represent the number of bits occupied by each field in the message, for example, the Type occupies 0-7 for 8 bits, the Length occupies 8-15 for 8 bits, and so on, and no further description is given; the topology identification MT-ID is used for identifying different topologies, each topology can support a plurality of different flexible algorithms, and the flexible algorithms in the message formats are respectively identified by FA-ID1, FA-ID2, FA-ID n and the like.

It should be noted that this IS only for convenience of description, and the TLV format of the new topology algorithm combination under the extended IS-IS protocol packet IS taken as an example. In practice, when the topology algorithm combination is advertised to the neighbor, the message format that can be selected is not limited, as long as the topology algorithm combination can be advertised to the neighbor device in time, and the method is not limited.

After the corresponding relation between each topology and the flexible algorithm on the equipment is announced to the neighbors, the receiving end equipment can summarize the corresponding relation between each topology and the flexible algorithm on each equipment in the network and perform path calculation based on the same topology and the same flexible algorithm, so that the problem of path calculation errors caused by different slices supported under multiple topologies is effectively solved.

The TLV structure of the device advertisement topology Algorithm combination may not depend on the SR-algoritm Sub-TLV defined in RFC8667, i.e., the device may directly advertise the topology Algorithm combination TLV according to the present invention without advertising the SR-algoritm Sub-TLV. The decision whether to send the SR-Algorithm Sub-TLV, the topology Algorithm combination TLV or both can also be made according to a preset strategy.

It should be noted that, compared with the flexible algorithm combination in the protocol standard, the flexible algorithm combination only carries the information of the flexible algorithm of the current device, and does not carry the information of the topology. Firstly judging whether the topology algorithm combinations are supported in a preset network range, and if so, releasing the topology algorithm combinations; if not, release is performed according to flexible algorithm combinations in the protocol standard.

Of course, the topology algorithm combination and the flexible algorithm combination can be issued, and the device receiving the message can automatically judge whether to calculate the path specifically according to the topology algorithm combination or the flexible algorithm combination. When all the routing devices support the topology algorithm combination in the preset network range, only the topology algorithm combination is released, and flexible algorithm combination is not released, so that the message release quantity is reduced.

Therefore, the preset notification policy may be set according to specific requirements, and besides the above-mentioned judgment conditions, the device or the controller may also be set to issue or not issue the topology algorithm combination, or may also be set to issue both the topology algorithm combination and the flexible algorithm combination. Although not to be limiting, whether to issue the topology algorithm combination or not can be judged according to the preset notification strategy, all the topology algorithm combinations fall into the protection scope of the invention.

In such embodiments, it is not judged whether the topology algorithm combinations are supported within a predetermined network range, nor is it concerned whether flexible algorithm combinations in the protocol standard will be issued, all issued. This has the advantage of simplifying decisions and reducing coupling, as long as the current device is a flexible algorithm for topology configuration, a topology algorithm combination is issued. As for the specific selection of the receiving end to use the topology algorithm combination or the flexible algorithm combination of the protocol standard, the receiving end judges the combination by itself.

In such embodiments, a determination is not made as to whether the topology algorithm combinations are all supported within a predetermined network range, nor is it concerned whether the topology algorithm combinations of the present invention will be issued, all issuing flexible algorithm combinations. The behavior of the protocol standard is executed no matter what step is added in the invention, and the release of the flexible algorithm combination is not influenced by the release or the non-release of the topology algorithm combination. As for the specific selection of the receiving end to use the topology algorithm combination or the flexible algorithm combination of the protocol standard, the receiving end judges the combination by itself.

To make the topology algorithm combinations clearer in the message structure, a Type-Length-Value (TLV) structure of the topology algorithm combination may be generated for each topology identification. When the current device advertises information, different TLV structures are used for respectively advertising different topology identifications. Only one topology identification is contained in one TLV structure, and flexible algorithm identifications supported by the topology on the current device are filled in the TLV structure.

Alternatively, in a TLV structure, all flexible algorithm identities supported by a topology may be included, or only part of flexible algorithm identities supported by the topology may be included.

However, as a preferred embodiment, only one topology algorithm combination TLV structure is carried for each topology in one message. I.e. for each topology, all flexible algorithm identifications corresponding to the topology on the current device are carried in a TLV structure of the topology algorithm combination. This has the advantage of simplifying the complexity of the receiving end judgment. If a topology corresponds to a plurality of TLV structures, the receiving end needs to judge whether the receiving of all TLV structures of the topology is finished after receiving the message, and judge whether the newly received TLV structure is the supplement of the TLV structure received last time or the update of the TLV structure received last time. In the preferred embodiment, each topology only generates a TLV structure of a topology algorithm combination, and the receiving end can use the topology and flexible algorithm thereof for path calculation immediately after receiving the TLV structure of the topology, and when receiving the TLV structure of the topology again, the receiving end considers that the TLV structure is updated in the last time.

The IS-IS protocol or OSPF protocol IS utilized to support flexible algorithm, and the IS-IS protocol or OSPF protocol message IS used for flooding in the network, so that the flexible algorithm information supported by each topology on each device IS rapidly obtained in the network, and the path IS calculated based on multiple topologies and flexible algorithms. And when the physical topology changes, the logic topology changes or the configuration of the flexible algorithm changes, the fast convergence of path calculation can be realized by fast sensing and fast updating of the IS-IS protocol or the OSPF protocol.

In a second aspect, the present invention provides a topology algorithm combination generating method, as shown in fig. 2, where the method includes:

in step S210, a flexible algorithm is configured for at least one topology on the current device;

in step S220, a topology algorithm combination is generated from the topology and the flexible algorithms configured for the topology.

In the protocol standard, the configuration of the flexible algorithm is in units of devices, and the flexible algorithm identification is also advertised externally in units of devices, rather than in units of topology. When the flexible algorithms supported by the same device under different topologies are different, other devices in the network cannot distinguish which FA slices are supported by the device, in particular under which topology. Therefore, the originating device firstly carries out the configuration of the flexible algorithm aiming at the map, and then can inform the neighbor of the corresponding relation between each topology on the device and the flexible algorithm configured under each topology through the messages of routing protocols such as IS-IS, OSPF and the like or through other message forms.

In a third aspect, the present invention provides a path calculation method, as shown in fig. 3, including:

in step S310, a message containing a topology algorithm combination is received; wherein the topology algorithm combination comprises topology information and flexible algorithm information;

in step S320, the links are calculated according to the topology and flexible algorithm that are matched with each other, so as to obtain paths.

When the receiving end equipment performs FA slicing calculation based on multiple topologies, the topology and flexible algorithm are distinguished. For a device traversed by a road, it needs to be checked in the database whether it supports the corresponding topology and flexible algorithms, and if the device does not support the topology or flexible algorithms, it needs to be excluded from the road. For example, if the topology algorithm combination of the receiving end includes < MT-ID1, FA-ID1, FA-ID2>, < MT-ID2, FA-ID1, FA-ID2>, the device supporting < MT-ID1, FA-ID1>, < MT-ID1, FA-ID2>, < MT-ID2, FA-ID1>, < MT-ID2, FA-ID2> in the database is routed respectively.

Further, the method further comprises:

In the preferred embodiment, as described above, in order to simplify the complexity of the receiving end judgment, each topology only generates a TLV structure of a topology algorithm combination in the received message with the same serial number. In other words, in each topology algorithm combination issued by one device at a time, the same topology identifier carried in a plurality of TLV structures should not appear. Therefore, after receiving the topology algorithm combination TLV, the receiving end device needs to check the validity of the TLV, and only one notification is allowed for the topology algorithm combination carrying a certain MT-ID notified by the same node, and if the TLV carrying the same MT-ID appears multiple times, all TLVs corresponding to the MT-ID need to be ignored. If a plurality of TLV structures containing the same topology identification are received, the issue strategy of the issue end is not matched with the equipment, or the message is not trusted, so that the information is not stored in the database, and all the received topology algorithm combinations containing the same topology identification cannot participate in path calculation.

Taking IS-IS protocol as an example, the received topology information, flexible algorithm information and link state information are stored in corresponding databases, and then calculation IS carried out according to the topology information, flexible algorithm information and link state information which are matched with each other in the databases. Not stored in the database means that this information cannot participate in the path computation.

Further, all combinations of topology algorithms received from the device that contain this same topology identification should be deleted, even if already stored in the database.

In some embodiments, if the topology algorithm combination and the flexible algorithm combination are received simultaneously from the same device, the flexible algorithm combination includes at least one flexible algorithm identification, the method further includes:

Within a predetermined network range it is possible that some devices are configured with multiple logical topologies and another part is configured with only one logical topology. When some devices which do not support the topology algorithm combination exist in the network, the flexible algorithm combination based on the protocol standard can be issued at the same time on the originating device according to the issuing strategy, and the topology algorithm combination of the invention can be issued at the same time. Thus, it is possible to receive both flexible algorithm combinations and topology algorithm combinations at the receiving device. Because the flexible algorithm combinations are issued in units of devices and the topology algorithm combinations are issued in units of the respective topologies on the devices, it is understood that the flexible algorithm combinations are the complete set of flexible algorithms supported by the devices and the topology algorithm combinations are a subset of the flexible algorithms supported by the devices. Therefore, for the same device, each flexible algorithm in the topology algorithm combination sent out by the same device should be included in all flexible algorithms in the flexible algorithm combination. There should be no exception to a certain flexible algorithm in the topology algorithm combination, not among all flexible algorithms contained in the flexible algorithm combination. When an abnormal situation occurs, the topology algorithm combination issued by the originating terminal is considered to have errors, so that the topology algorithm combination is ignored and excluded from path calculation.

After receiving the topology algorithm combination TLV, the devices in the predetermined network range analyze the corresponding < MT-ID, FA-ID > information and record the information in the database. When performing FA slicing calculation based on multiple topologies locally, for a device through which the calculation is passed, it is necessary to check in a database whether it supports the corresponding FA-ID, and if the device does not support it, it is necessary to exclude it from the calculation.

Through the steps, the FA slicing route based on multiple topologies is finally calculated, the problem of FA slicing route calculation errors under the multi-topology scene described before can be solved, namely, the receiving end equipment can conveniently identify specific FA-IDs supported on the topology corresponding to certain equipment in the network, so that the specific FA-IDs are added into the FA calculating route, route calculation errors are avoided, the scene applicable to the FA slicing scheme is increased, stable operation of the service is guaranteed, and the reliability of the network is improved.

The following describes, with reference to 1 specific embodiment, a path notification method according to the first aspect of the present invention and a path calculation method according to the second aspect of the present invention applied to a process of performing path calculation in a multi-topology network slice scenario.

Example 1

It should be noted that, taking the IS-IS protocol as an example, the path notification method and the path calculation method of the present invention are mainly described herein. The steps of slice specific planning, IS-IS protocol neighbor establishment, specific route calculation, etc. will not be described in detail herein.

As shown in fig. 5, IS-IS configures two logical topologies of IPv4 and IPv6, the solid line represents the topology of IPv4, the broken line represents the topology of IPv6, the FA information supported by each node IS identified as shown, FA-id=128/129 IS supported by each node for IPv4, but fa=129 IS not supported by node DUT5 for IPv 6. Definition fa=129 is calculated in terms of the traffic metric value (te-metric) of the link, assuming that the te-metrics of the links are all 10.

Nodes in the network perform configuration of FAs based on multiple topologies, and then advertise IS-IS link state protocol data unit (LSP, link State Protocol Data Units) messages for flooding, and a newly added Type Length Value (TLV) structure IS used during flooding. Taking DUT1 as an example, DUT1 will advertise two TLVs, corresponding to < IPv4,128/129> and < IPv6,129>, respectively, i.e. slices supporting two flexible algorithms, 128 and 129, under IPv4 logical topology, and slices supporting 129 one flexible algorithm under IPv6 logical topology; whereas for DUT5, although supporting IPv6, no slice based on IPv6 logical topology is supported, only one TLV < IPv4,128/129> is advertised without advertising the FA-ID support case of IPv 6. Other nodes are similar and are not described in detail herein.

Because of the flooding of the LSP messages of the IS-IS, nodes in the network can all receive flexible algorithm supporting conditions based on multiple topologies from other nodes. Taking DUT6 node as an example, multi-topology FA TLV information advertised by other nodes in the network is received, analyzed, a mapping relation between topology on the node and FA-ID supported by the node is formed, and the mapping relation is stored in a database, wherein the mapping relation is shown in the following table 1:

TABLE 1

When the DUT6 performs path computation, path computation is performed for the IPv4 and IPv6 topologies, respectively. In the case of path calculation in the IPv6 topology, since FA-id=129 is locally supported, calculation is performed according to the calculation rule of FA-id=129 (for example, an optimal path is selected according to te-metric).

In the calculation process, traversing all node information in the network according to an SPF algorithm, inquiring whether the node supports the corresponding FA-ID in a database, if so, considering that the node can be used as a forwarding next hop for continuous calculation, otherwise, eliminating the node and not being used as the forwarding next hop.

When traversing to node DUT5, its lookup database finds that the IPv6 topology of DUT5 does not support FA-id=129, so DUT6 will not join it in the computation path, so DUT6 computes paths to other nodes in the network that would not include DUT6, nor would DUT6 itself be reachable in the computation of FA-id=129.

Through the scheme, the expected path calculation purpose can be realized, namely, in the IPv6 slice calculation of FA-ID=129, the node DUT5 is eliminated, and traffic is prevented from being forwarded to the DUT5 and packet loss is avoided, so that service interruption is caused.

In a fourth aspect, the present invention provides a data transmission method, as shown in fig. 4, including:

in step S410, according to the received data, a routing table is queried, where a path in the routing table is a path obtained by calculation by the path calculation method according to any one of the third aspects;

in step S420, data is transmitted according to the queried path.

And the data message is searched according to the matched flexible algorithm and is forwarded according to the path under the corresponding flexible algorithm, so that the flow engineering based on the FA slice is realized.

In a fifth aspect, as shown in fig. 7, an embodiment of the present invention provides an electronic device, including:

one or more processors 501;

a memory 502 having one or more programs stored thereon, which when executed by one or more processors, cause the one or more processors to implement the path advertisement method according to any one of the first aspects, or the topology algorithm combination generation method according to any one of the second aspects, or the path calculation method according to any one of the third aspects, or the data transmission method according to the fourth aspect;

one or more I/O interfaces 503, coupled between the processor and the memory, are configured to enable information interaction of the processor with the memory.

Wherein the processor 501 is a device having data processing capabilities, including but not limited to a Central Processing Unit (CPU) or the like; 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), electrically charged erasable programmable read-only memory (EEPROM), FLASH memory (FLASH); an I/O interface (read/write interface) 503 is coupled between the processor 501 and the memory 502 to enable information interaction between the processor 501 and the memory 502, including but not limited to a data Bus (Bus) or the like.

In some embodiments, processor 501, memory 502, and I/O interface 503 are connected to each other and, in turn, other components of the computing device via bus 504.

In a sixth aspect, an embodiment of the present invention provides a computer readable storage medium, as shown in fig. 8, on which a computer program is stored, where the computer program when executed by a processor implements the path notification method according to any one of the first aspects, or the topology algorithm combination generation method according to any one of the second aspects, or the path calculation method according to any one of the third aspects, or the data transmission method according to the fourth aspect.

According to the path notification method and the path calculation method provided by the embodiment of the invention, under the multi-topology FA slicing scene, the slicing route calculation can be performed based on different topologies, the problem of path calculation errors caused by different slices supported by equipment under the multi-topology is avoided, the applicable scene of the FA slicing scheme is increased, and the stable operation of the service is ensured. And the reliability of the network is improved.

Those of ordinary skill in the art will appreciate that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof.

In a hardware implementation, the division between the 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 performed cooperatively by several physical components. 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. 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). The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as known to those skilled in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill in the art, 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 includes any information delivery media.

The preferred embodiments of the present invention have been described above with reference to the accompanying drawings, and thus do not limit the scope of the claims of the present invention. Any modifications, equivalent substitutions and improvements made by those skilled in the art without departing from the scope and spirit of the present invention shall fall within the scope of the appended claims.

Claims

1. A path advertisement method, comprising:

2. The path advertising method of claim 1, wherein the advertising the topology algorithm combination according to a preset advertising policy comprises:

3. The path advertising method of claim 1, wherein the advertising the topology algorithm combination according to a preset advertising policy comprises:

4. The path advertisement method of claim 1, wherein a current device has a flexible combination of algorithms comprising information of at least one flexible algorithm on the current device, the path advertisement method further comprising:

5. The path advertisement method of claim 1, wherein the information of the topology comprises a topology identification and the information of the flexible algorithm comprises a flexible algorithm identification.

6. The path advertisement method according to any one of claims 1 to 5, wherein in the step of advertising the topology algorithm combination according to a preset advertisement policy, the topology algorithm combination is carried by a message of any one of the following protocols:

7. A topology algorithm combination generation method comprises the following steps:

8. The topology algorithm combination generation method of claim 7, wherein the topology algorithm combination carries a topology identification and a flexible algorithm identification of a flexible algorithm configured for a topology represented by the topology identification.

9. The topology algorithm combination generation method according to claim 7 or 8, wherein in the step of configuring flexible algorithms for at least one topology on a current device, a plurality of flexible algorithms are configured for one topology.

10. A path computation method, comprising:

11. The path computation method of claim 10, wherein after the receiving the message including the topology algorithm combination, further comprising:

12. The path computation method of claim 11, wherein the method further comprises:

13. The path computation method of claim 11, wherein if the topology algorithm combination and flexible algorithm combination are received simultaneously from the same device, the flexible algorithm combination includes at least one flexible algorithm identification, the method further comprising:

14. A data transmission method, comprising:

inquiring a routing table according to the received data, wherein the path in the routing table is a path calculated by the path calculation method according to any one of claims 10 to 13;

and transmitting data according to the inquired path.

15. An electronic device, the electronic device comprising:

one or more processors;

a memory having one or more programs stored thereon, which when executed by the one or more processors, cause the one or more processors to implement the path advertisement method according to any one of claims 1 to 6, or the topology algorithm combination generation method according to any one of claims 7 to 9, or the path calculation method according to any one of claims 10 to 13, or the data transmission method according to claim 14;

16. A computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the path advertisement method according to any one of claims 1 to 6, or the topology algorithm combination generation method according to any one of claims 7 to 9, or the path calculation method according to any one of claims 10 to 13, or the data transmission method according to claim 14.