WO2022042403A1 - 生成路由信息、发送位置信息及转发报文的方法及设备 - Google Patents

生成路由信息、发送位置信息及转发报文的方法及设备 Download PDF

Info

Publication number
WO2022042403A1
WO2022042403A1 PCT/CN2021/113358 CN2021113358W WO2022042403A1 WO 2022042403 A1 WO2022042403 A1 WO 2022042403A1 CN 2021113358 W CN2021113358 W CN 2021113358W WO 2022042403 A1 WO2022042403 A1 WO 2022042403A1
Authority
WO
WIPO (PCT)
Prior art keywords
network topology
network
packet
network device
routing information
Prior art date
Application number
PCT/CN2021/113358
Other languages
English (en)
French (fr)
Inventor
胡志波
徐国其
董杰
徐菊华
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP21860241.5A priority Critical patent/EP4199391A4/en
Publication of WO2022042403A1 publication Critical patent/WO2022042403A1/zh
Priority to US18/174,995 priority patent/US20230216792A1/en

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
    • H04L45/74—Address processing for routing
    • 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/302—Route determination based on requested QoS
    • H04L45/306—Route determination based on the nature of the carried application
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • 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/56—Routing software
    • H04L45/566—Routing instructions carried by the data packet, e.g. active networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • 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
    • H04L45/08—Learning-based routing, e.g. using neural networks or artificial intelligence

Definitions

  • the present application relates to the field of communication technologies, and in particular, to methods and devices for generating routing information, sending location information, and forwarding packets.
  • Network slicing essentially divides the operator's physical network into multiple virtual networks, each virtual network corresponds to a network topology, and is divided according to different service requirements, such as delay, bandwidth, security and reliability, etc. Respond flexibly to different network application scenarios. How to perform network slicing to define a virtual network, how to route traffic within the network topology corresponding to the virtual network, and how to forward packets within the network topology are the keys to meeting service requirements.
  • virtual network switching is realized by using the algorithm identification (ID) of flexible algorithm (flex-algo) and a series of constraints to divide the network topology and perform routing calculation to realize virtual network switching.
  • ID algorithm identification
  • flex-algo flexible algorithm
  • a separate location identifier (locator) is required, that is, the locator is bound and released with the flexible algorithm, and one locator corresponds to only one flexible algorithm.
  • IPv6 Internet protocol version 6
  • the embodiments of the present application provide a method and device for generating routing information, sending location information, and forwarding messages, to solve the problems provided by the related art, and the technical solutions are as follows:
  • a method for generating routing information is provided. Taking the implementation of the method by a first network device as an example, the first network device receives location information sent by a second network device, where the location information includes a location identifier and a location identifier related to the location identifier. Corresponding multiple association flexible algorithms, wherein the location identifier is used to identify the location of the second network device in the network.
  • the first network device generates first routing information to the second network device based on a first flexible algorithm, the first flexible algorithm is one of multiple associated flexible algorithms, and the first flexible algorithm corresponds to the first network topology, and the first flexible algorithm is The network topology is the network topology where the first network device is located, and the first routing information is used to send packets to the second network device within the first network topology.
  • the first network device By including a location identifier and a plurality of corresponding flexible association algorithms in the location information and sending it to the first network device, the first network device generates routing information in different network topologies based on different flexible association algorithms.
  • the location identifier carries a flexible algorithm, in the process of generating routing information, not only the address space is reduced, but also network resources are saved.
  • the multiple association flexible algorithms further include a second flexible algorithm
  • the first network device generates second routing information to the second network device based on the second flexible algorithm
  • the second routing information is related to the second network device.
  • the topology corresponds
  • the second network topology is the network topology where the first network device is located
  • the second routing information is used to send packets to the second network device in the second network topology.
  • the first routing information corresponds to an identifier of the first network topology.
  • the first routing information includes an identifier of the first network topology. Since the identifier of the first network topology is included in the first routing information, the routing information of each network topology can still be distinguished even in one forwarding table, saving space in the forwarding table.
  • a method for sending location information is provided. Taking the execution of the method by a second network device as an example, the second network device sends location information to the first network device, where the location information includes a location identifier and a location identifier corresponding to the location identifier.
  • the location information includes a location identifier and a location identifier corresponding to the location identifier.
  • multiple associated flexible algorithms wherein the location identifier is used to identify the location of the second network device in the network, and the first flexible algorithm among the multiple associated flexible algorithms is used by the first network device to generate the first network device reaching the second network device.
  • the first flexible algorithm corresponds to the first network topology
  • the first network topology is the network topology where the first network device is located
  • the first routing information is used by the first network device to send a report to the second network device within the first network topology Arts.
  • a network device Since multiple flexible algorithms are carried under the structure of one location identifier, a network device supports multiple flexible algorithms, but one location identifier only carries one flexible algorithm, and multiple location identifiers are required to carry multiple flexible algorithms. Carrying multiple flexible algorithms in one location identifier, encapsulating it in location information, and sending it can reduce address space, reduce occupied packet space, and save network bandwidth resources.
  • the multiple association flexible algorithms further include a second flexible algorithm, and the second flexible algorithm is used by the first network device to generate second routing information reaching the second network device, and the second routing information is related to the second routing information.
  • the second network topology is the network topology where the first network device is located, and the second routing information is used to send packets to the second network device in the second network topology.
  • a method for forwarding a packet is provided. Taking the implementation of the method by a first network device as an example, the first network device obtains the first packet, and the network topology matching the first packet is the first network topology. The first network topology is the network topology where the first network device is located. After that, the first network device determines first routing information according to the first network topology, where the first routing information is used to send the first packet within the first network topology; the first network device sends the first packet according to the first routing information.
  • the first network device Since a location identifier and a plurality of corresponding flexible association algorithms are included in the location information, the first network device generates routing information in different network topologies based on different flexible associative algorithms, which not only reduces the IPv6 reliability in the process of generating routing information Address space, saving network resources. On this basis, after the first packet is acquired, the first routing information for forwarding the first packet is determined according to the first network topology matching the first packet, so that the first packet is sent in the first network topology. A packet, which implements the method of forwarding packets based on the network topology.
  • acquiring the first packet by the first network device includes: acquiring the second packet by the first network device; adding the first network to the second packet by the first network device The identification of the topology to obtain the first packet.
  • the execution subject of this implementation may be the head node in the network topology, and by adding the identifier of the first network topology to the second packet, the network device that receives the first packet can determine the identifier according to the first network topology.
  • the network device matching the first packet is the first network device, so that the corresponding routing information is determined.
  • the first network device adds an identifier of the first network topology to the second packet to obtain the first packet, including: the first network device adds the identifier of the first network topology to the second packet.
  • the identifier of the first network topology is added to the hop-by-hop HBH field to obtain the first packet.
  • the first network device adds an identifier of the first network topology to the second packet to obtain the first packet, including: the first network device adds an identifier of the first network topology to the second packet The segment identifier including the identifier of the first network topology is added to the segment identifier list of , so as to obtain the first packet.
  • the first network device adds an identifier of the first network topology to the second packet to obtain the first packet, including: the first network device adds the identifier of the first network topology to the second packet. Add the identifier of the first network topology and the identifier of the first resource to obtain the first message, the first resource is the resource in the first network topology, and the identifier of the first resource is used to indicate the use of the first resource in the first network.
  • the first packet is sent within the topology.
  • the first network device adds the identifier of the first network topology to the second packet to obtain the first packet, including: The first network device determines, according to the destination address of the second packet, that a flexible algorithm matching the second packet is a first flexible algorithm, the first flexible algorithm corresponds to the first network topology, and the The first network device determines that the network topology matching the second packet is the first network topology; or, the first network device determines that the destination address of the second packet matches the specified destination address, and the specified destination address The destination address matches the first network topology, and the first network device determines that the network topology matching the second packet is the first network topology.
  • the head node in the network topology determines the identifier of the network topology corresponding to the packet according to the destination address in the packet, and then adds the identifier of the network topology to the packet, so that the intermediate node can obtain the identifier of the network topology from the packet. .
  • acquiring the first packet by the first network device includes: the first network device receiving the first packet; and the first network device determining a network topology matching the first packet is the first network topology.
  • the execution subject of this implementation may be an intermediate node in the network topology. After receiving the first packet, the intermediate node determines a network topology matching the first packet, and then determines routing information corresponding to the first packet according to the network topology.
  • the first network device determining that a network topology matching the first packet is the first network topology includes: the first network device determining a network topology matching the first packet according to the destination address of the first packet
  • the flexible algorithm for matching the first packet is the first flexible algorithm, the first flexible algorithm corresponds to the first network topology, and the first network device determines that the network topology matching the first packet is the first network topology; or, the first network The device determines that the destination address of the first packet matches the specified destination address, the specified destination address matches the first network topology, and the first network device determines that the network topology matching the first packet is the first network topology.
  • the first packet includes an identifier of the first network topology; the first network device determines that the network topology matching the first packet is the first network topology, including: first The network device determines, according to the identifier of the first network topology included in the first packet, the network topology that matches the first packet as the first network topology.
  • the execution subject of this implementation may be an intermediate node in the network topology. In the case that the head node in the network topology has added the network topology identifier to the packet, the intermediate node reads the first packet after receiving the first packet. The identifier of the network topology in the text is used to determine the network topology matched by the first packet.
  • the first packet further includes an identifier of the first resource, and the first resource is a resource in the first network topology; the first network device sends the first resource according to the first routing information
  • the message includes: the first network device sends the first message in the first network topology by using the first resource according to the first routing information.
  • the first routing information corresponds to an identifier of the first network topology; and the first network device determines the first routing information according to the first network topology, including: the first network device determines the first routing information according to the first network topology.
  • a corresponding relationship between the routing information and the identifier of the first network topology determines the first routing information.
  • the identifier of the first network topology is included in the first routing information; the first network device determines the first routing information according to the first network topology, including: the first network device The first routing information is determined according to the identifier of the first network topology included in the first routing information.
  • an apparatus for generating routing information comprising:
  • a receiving module configured to receive location information sent by the second network device, where the location information includes a location identifier and multiple associated flexible algorithms corresponding to the location identifier, and the location identifier is used to identify the location of the second network device in the network;
  • a generating module configured to generate first routing information to the second network device based on a first flexible algorithm, where the first flexible algorithm is one of a plurality of associated flexible algorithms, the first flexible algorithm corresponds to the first network topology, and the first network The topology is the network topology where the apparatus for generating routing information is located, and the first routing information is used to send packets to the second network device within the first network topology.
  • the multiple association flexible algorithms further include a second flexible algorithm
  • a generating module is further configured to generate second routing information to the second network device based on the second flexible algorithm, and the second routing information is related to the first routing information.
  • the two network topologies correspond.
  • the second network topology is the network topology where the device generating routing information is located, and the second routing information is used to send packets to the second network device in the second network topology.
  • the first routing information corresponds to an identifier of the first network topology.
  • the first routing information includes an identifier of the first network topology.
  • a fifth aspect provides an apparatus for sending location information, the apparatus comprising:
  • the sending module is configured to send location information to the first network device, where the location information includes a location identifier and multiple associated flexible algorithms corresponding to the location identifier, and the location identifier is used to identify the location of the device for sending location information in the network, and the multiple associated
  • the first flexible algorithm in the flexible algorithm is used by the first network device to generate the first routing information to the second network device, the first flexible algorithm corresponds to the first network topology, and the first network topology is the network topology where the first network device is located , and the first routing information is used by the first network device to send a packet to the apparatus for sending location information within the first network topology.
  • the multiple association flexible algorithms further include a second flexible algorithm, and the second flexible algorithm is used by the first network device to generate second routing information to the apparatus for sending location information, and the second routing information is related to the second routing information.
  • the two network topologies correspond.
  • the second network topology is the network topology where the first network device is located, and the second routing information is used to send a message to the device for sending location information in the second network topology.
  • a device for forwarding a message comprising:
  • an obtaining module configured to obtain the first message, the network topology matching the first message is the first network topology, and the first network topology is the network topology where the device for forwarding the message is located;
  • a determining module configured to determine first routing information according to the first network topology, where the first routing information is used to send the first packet within the first network topology;
  • the sending module is configured to send the first packet according to the first routing information.
  • the obtaining module is configured to obtain the second packet; adding an identifier of the first network topology to the second packet to obtain the first packet.
  • the obtaining module is configured to add the identifier of the first network topology to the hop-by-hop HBH field of the second packet to obtain the first packet.
  • the obtaining module is configured to add a segment identifier including an identifier of the first network topology to the segment identifier list of the second packet to obtain the first packet.
  • the obtaining module is configured to add the identifier of the first network topology and the identifier of the first resource to the second packet to obtain the first packet, and the first resource is within the first network topology resource, the identifier of the first resource is used to indicate that the first packet is sent within the first network topology by using the first resource.
  • the obtaining module is configured to determine, according to the destination address of the second packet, that the flexible algorithm matching the second packet is the first flexible algorithm, and the first flexible algorithm corresponds to the first network topology; determining The network topology that matches the second packet is the first network topology; or, it is determined that the destination address of the second packet matches the specified destination address, the specified destination address matches the first network topology, and the network topology that matches the second packet is determined is the first network topology.
  • the obtaining module is configured to receive the first packet; and determine the network topology matching the first packet as the first network topology.
  • the determining module is configured to determine, according to the destination address of the first packet, a flexible algorithm that matches the first packet as the first flexible algorithm, the first flexible algorithm corresponds to the first network topology, and determines The network topology that matches the first packet is the first network topology;
  • the destination address of the first packet matches the specified destination address
  • the specified destination address matches the first network topology
  • the network topology matching the first packet is determined to be the first network topology
  • the first packet includes an identifier of the first network topology; the determining module is configured to determine a network matching the first packet according to the identifier of the first network topology included in the first packet The topology is the first network topology.
  • the first packet further includes an identifier of the first resource, and the first resource is a resource in the first network topology;
  • the sending module is configured to send the first packet in the first network topology by using the first resource according to the first routing information.
  • the first routing information corresponds to an identifier of the first network topology
  • the determining module is configured to determine the first routing information according to the corresponding relationship between the first routing information and the identifier of the first network topology.
  • the identifier of the first network topology is included in the first routing information
  • the determining module is configured to determine the first routing information according to the identifier of the first network topology included in the first routing information.
  • a network device in a seventh aspect, includes:
  • a memory and a processor at least one instruction is stored in the memory, and at least one instruction is loaded and executed by the processor to implement the method for generating routing information in the first aspect and any implementation manner, or to implement the second aspect and any one of The method for sending location information in the implementation manner, or the method for forwarding a packet in the third aspect and any implementation manner.
  • a communication system in an eighth aspect, includes a first network device and a second network device, the first network device is configured to execute the method for generating routing information in the first aspect and any implementation manner; the second A network device is configured to perform the method for sending location information in the third aspect and any implementation manner.
  • a communication system in a ninth aspect, includes a first network device and a second network device, and the first network device is configured to execute the third aspect and the first to fifth implementation manners of the third aspect The method for forwarding a message in any of the implementations of method.
  • a tenth aspect provides a computer-readable storage medium, where at least one instruction is stored in the storage medium, and the instruction is loaded and executed by a processor to implement the method for generating routing information in the first aspect and any implementation manner, or, The method for sending location information in the second aspect and any implementation manner is implemented, or the method for forwarding a packet in the third aspect and any implementation manner is implemented.
  • Another communication apparatus includes a transceiver, a memory, and a processor.
  • the transceiver, the memory and the processor communicate with each other through an internal connection path, the memory is used for storing instructions, and the processor is used for executing the instructions stored in the memory to control the transceiver to receive signals and control the transceiver to send signals , and when the processor executes the instructions stored in the memory, the processor is caused to execute the method in the first aspect to the third aspect or any possible implementation manner of the first aspect to the third aspect.
  • processors there are one or more processors and one or more memories.
  • the memory may be integrated with the processor, or the memory may be provided separately from the processor.
  • the memory can be a non-transitory memory, such as a read only memory (ROM), which can be integrated with the processor on the same chip, or can be separately set in different On the chip, the embodiment of the present application does not limit the type of the memory and the setting manner of the memory and the processor.
  • ROM read only memory
  • a computer program (product) comprising: computer program code which, when executed by a computer, causes the computer to perform the methods in the above-mentioned aspects.
  • a chip includes a processor for invoking and executing instructions stored in the memory from a memory to cause a communication device on which the chip is mounted to perform the methods of the above aspects.
  • Another chip including: an input interface, an output interface, a processor, and a memory, the input interface, the output interface, the processor, and the memory are connected through an internal connection path, and the processor is used to execute all The code in the memory, when the code is executed, the processor is configured to perform the methods of the above aspects.
  • FIG. 1 is a schematic diagram of a system architecture provided by the related art
  • Fig. 2 is the structural representation of the location identification provided by the related art
  • FIG. 3 is a schematic diagram of a system architecture provided by an embodiment of the present application.
  • FIG. 4 is a schematic flowchart of a method for sending location information and a method for generating routing information provided by an embodiment of the present application;
  • FIG. 5 is a schematic structural diagram of a location identifier and END.X provided by an embodiment of the present application.
  • FIG. 6 is a schematic diagram of a generation process of routing information provided by an embodiment of the present application.
  • FIG. 7 is a schematic diagram of a generation process of routing information provided by an embodiment of the present application.
  • FIG. 8 is a schematic flowchart of a method for forwarding a message according to an embodiment of the present application.
  • FIG. 9 is a schematic diagram of a message forwarding process provided by an embodiment of the present application.
  • FIG. 10 is a schematic diagram of a process for obtaining a first packet according to an embodiment of the present application.
  • FIG. 11 is a schematic structural diagram of an apparatus for generating routing information provided by an embodiment of the present application.
  • FIG. 12 is a schematic structural diagram of an apparatus for sending location information provided by an embodiment of the present application.
  • FIG. 13 is a schematic structural diagram of an apparatus for forwarding a message according to an embodiment of the present application.
  • FIG. 14 is a schematic structural diagram of a network device provided by an embodiment of the present application.
  • FIG. 15 is a schematic structural diagram of a network device provided by an embodiment of the present application.
  • Network slicing technology divides the operator's physical network into multiple virtual networks, each virtual network corresponds to a network topology, and is divided according to different service requirements, such as delay, bandwidth, security and reliability, etc. to deal with different network application scenarios.
  • SRv6 segment routing IPv6
  • ID algorithm identifier
  • SRv6 is a protocol designed based on the concept of source routing to forward IPv6 data packets on the network.
  • SRv6 inserts a segment routing header (SRH) into the IPv6 packet, pushes an explicit IPv6 address stack into the SRH, and continuously updates the destination address and offset address stack through the intermediate nodes. Complete hop-by-hop forwarding.
  • the system architecture includes network devices such as node 0 to node 9, nodes 0, 1, 2, 3, 4 and 9 participate in the routing calculation of the flexible algorithm 128, and nodes 0, 5, 6 , 7, 8 and 9 participate in the routing calculation of the flexible algorithm 129.
  • node 0 as the first network device
  • node 9 as the second network device
  • two location identifiers (locators) are published on node 9, one is the 4::/64 locator based on the flexible algorithm 128, and the other is based on the flexible algorithm 128.
  • 3::/64 locator for Algorithm 129 are examples of the 4::/64 locator based on the flexible algorithm 128, and the other is based on the flexible algorithm 128.
  • node 0 When node 0 calculates the routing information to 4::/64 locator, it will follow the shortest path first (SPF) algorithm or strict SPF (Strict-SPF) according to the nodes and links defined by the flexible algorithm 128.
  • the algorithm computes routing information. For example, based on the system shown in Figure 1, the path to the 4::/64 locator is 0 ⁇ 1 ⁇ 2 ⁇ 4 ⁇ 9. Similarly, when node 0 calculates the routing information to 3::/64 locator, the path to 3::/64 locator is 0 ⁇ 5 ⁇ 6 ⁇ 8 ⁇ 9.
  • each algorithm requires a separate locator.
  • IGP interior gateway protocol
  • ISIS intermediate system to intermediate system
  • END SID node's end segment identifier
  • link END.X SID are allocated based on locators. When there are a large number of locators, a large number of END SIDs and END.X will also be allocated. Because these locators, END SIDs and END.X SIDs are all encapsulated in ISIS label switching path (LSP) packets, which occupy a large amount of packet space, and the LSP will also be flooded in the network, resulting in Waste network bandwidth resources.
  • LSP ISIS label switching path
  • the embodiments of the present application provide a method for sending location information and a method for generating routing information.
  • the method realizes that one locator can carry multiple flex-algos, thereby avoiding waste.
  • IPv6 address space and network resources.
  • the same locator1::1/64 on the edge device (provider edge, PE) 2 can carry multiple flex-algos, with algorithm IDs 128 and 129 respectively. , 130 and 0 flexible algorithm.
  • the flexible algorithm whose algorithm ID is 0 is the default algorithm.
  • PE2 encapsulates the locator and the flex-algo information corresponding to the locator in an ISIS LSP message, and floods the network, so that each node has the information of the locator on PE2.
  • nodes PE1 and PE2 participate in the flexible algorithm whose algorithm ID is 128, 129 and 130
  • nodes P1, P2 and P3 participate in the flexible algorithm whose algorithm ID is 128, and nodes P4, P5 and P6 participate in the flexible algorithm whose algorithm ID is 129.
  • Flexible algorithm nodes P7, P8 and P9 participate in the flexible algorithm whose algorithm ID is 130. Therefore, when generating routing information, nodes PE1, P1, P2, P3, and PE2 can calculate routing information to locator 1::1/64 based on the flexible algorithm with algorithm IDs 128 and 0. For example, unicast routes of 1::1/64 are generated in the network topology corresponding to the flexible algorithms with algorithm IDs 128 and 0, respectively.
  • nodes PE1, P4, P5, P6 and PE2 generate 1::1/64 unicast routes in the network topology corresponding to the flexible algorithm with algorithm IDs 129 and 0 respectively; nodes PE1, P7, P8, P9 and PE2 generates 1::1/64 unicast routes in the topology corresponding to the flexible algorithms with algorithm IDs 130 and 0, respectively.
  • the method for sending location information and the method for generating routing information provided by the embodiments of the present application will be described by way of example.
  • the method for sending location information provided by the embodiment of the present application includes the following processes.
  • the second network device sends location information to the first network device, where the location information includes a location identifier and multiple associated flexible algorithms corresponding to the location identifier, where the location identifier is used to identify the location of the second network device in the network.
  • the locator and a flexible algorithm corresponding to the locator can be carried in an ISIS LSP message to be flooded in the network, so that the second network device sends the locator to the first network device.
  • location information In this embodiment of the present application, the same locator can use multiple flexible algorithms to expand the corresponding location information in the network. Therefore, when the second network device supports multiple flexible algorithms, the multiple flexible algorithms may be carried in the ISIS LSP message together with the locator as associated flexible algorithms to be flooded in the network.
  • the location information sent by the second network device to the first network device includes a location identifier and multiple associated flexible algorithms corresponding to the location identifier, where the location identifier is used to identify the location of the second network device in the network.
  • This embodiment of the present application does not limit the number of associative flexible algorithms corresponding to the location identifier in the location information, which may be limited based on application scenarios. If the second network device supports more flexible algorithms, the multiple flexible algorithms may all correspond to one locator, or a part of the flexible algorithms may correspond to one locator, and the remaining part of the flexible algorithms may correspond to another locator. In the case where the number of locators is less than the number of flexible algorithms, compared to the case where one locator corresponds to one flexible algorithm, the purpose of saving space and network resources can still be achieved.
  • an algorithm sub-TLV can be added in the TLV field of the locator, and the multiple flexible algorithms It is carried under the TLV field of the locator in the form of sub-TLV.
  • END SID END.X SID
  • the structure of the locator and the structure of the END.X SID provided by the embodiment of the present application may be as shown in FIG. 5 . It is not difficult to see from Figure 5 that since multiple flexible algorithms are carried under the structure of one locator, a network device supports multiple flexible algorithms, but one locator only carries one flexible algorithm, and multiple locators are required to carry multiple flexible algorithms. In the case of flexible algorithms, multiple flexible algorithms are carried in one locator and encapsulated in an ISIS LSP message, and the method provided by the embodiment of the present application can reduce the occupied message space. In addition, when ISIS LSP messages are flooded, network bandwidth resources can be further saved.
  • the method for generating routing information includes the following processes.
  • the first network device receives location information sent by the second network device, where the location information includes a location identifier and multiple associated flexible algorithms corresponding to the location identifier, where the location identifier is used to identify the location of the second network device in the network.
  • the first network device obtains the location information sent by the second network device by receiving the ISIS LSP message flooded in the network by the second network device.
  • the second network device is the node PE2
  • the first network device is the nodes PE1, P1, P2, P3, P4, P5, P6, P7, P8, and P9.
  • Node PE2 encapsulates locator 1::1/64 and the flexible algorithms of flex-algo 128, 129, and 130 corresponding to locator 1::1/64 in ISIS LSP packets and floods the network.
  • Nodes PE1, P1, P2, P3, P4, P5, P6, P7, P8, P9 can receive flex-algo128, 129 and 130 including locator 1::1/64 and the corresponding locator 1::1/64 flexible algorithm for location information.
  • the first network device generates first routing information to the second network device based on a first flexible algorithm, where the first flexible algorithm is one of a plurality of associated flexible algorithms, the first flexible algorithm corresponds to the first network topology, and the first flexible algorithm corresponds to the first network topology.
  • a network topology is a network topology where the first network device is located.
  • the first routing information is used to send packets to the second network device within the first network topology. Since each of the multiple association flexible algorithms corresponds to a network topology, the first network device determines the flexible algorithm corresponding to the network topology where the first network device is located, that is, determines the first flexible algorithm, and based on the first network device A flexible algorithm generates first routing information to the second network device.
  • the first network device is in multiple network topologies
  • one flexible algorithm corresponds to a network topology where the first network device is located
  • the multiple associated flexible algorithms include the first flexible algorithm and the second flexible algorithm.
  • the first network device also generates the second route to the second network device based on the second flexible algorithm information
  • the second routing information corresponds to the second network topology
  • the second network topology is the network topology where the first network device is located
  • the second routing information is used to send packets to the second network device in the second network topology.
  • the above only takes the first network device in the first network topology corresponding to the first flexible algorithm and the second network topology corresponding to the second flexible algorithm as an example, and does not limit the methods provided by the embodiments of the present application.
  • the first network device may also generate routing information in more network topologies, and the method for generating routing information is the same as the method for generating routing information in this embodiment of the present application, and details are not described herein again.
  • the network topology where node PE1 is located corresponds to the flexible algorithms with algorithm IDs 128, 129 and 130, and node PE1 is based on algorithm IDs 128, 129 respectively.
  • the flexible algorithm of sum 130 generates target routing information reaching the second network device, so that three pieces of target routing information can be obtained.
  • the node P1 since the network topology where the node P1 is located corresponds to the flexible algorithm whose algorithm ID is 128, the node P1 generates the target routing information to the second network device based on the flexible algorithm whose algorithm ID is 128, thereby obtaining A piece of routing information.
  • the nodes P2 and P3 Since the nodes P2 and P3 are in the same network topology as the node P1, the nodes P2 and P3 generate the target routing information to the second network device based on the flexible algorithm with the algorithm ID of 128, like P1. For nodes P4, P5, and P6 in the same network topology, target routing information to the second network device is generated based on a flexible algorithm with an algorithm ID of 129. For nodes P7, P8, and P9 in the same network topology, target routing information to the second network device is generated based on a flexible algorithm with an algorithm ID of 130.
  • the embodiment of the present application does not limit the manner in which the first network device generates the first routing information to the second network device based on the first flexible algorithm. Since one locator corresponds to multiple flexible algorithms, in order to subsequently send packets to the second network device in the network topology where it resides based on the calculated target routing information, the method provided in this embodiment of the present application associates the network topology with the network slice.
  • the calculated first routing information includes but is not limited to the following two situations.
  • Case 1 The first routing information corresponds to the identifier of the first network topology.
  • the first routing information includes but is not limited to prefix, next-hop, outgoing interface (interface), and cost (cost).
  • the multiple pieces of routing information of the same network topology correspond to identifiers of the same network topology.
  • the multiple pieces of routing information can be placed in the same forwarding table, and a table ID can be set for the forwarding table, and the table ID is the ID of the network topology, so that the routing information in the same network topology corresponds to the same Identification of the network topology.
  • the identification of the network topology may be consistent with the ID of the flexible algorithm corresponding to the network topology.
  • the network is divided into the topology of the FlexAlgo 128 based on the delay metric and the topology based on the interior gateway protocol (IGP) metric.
  • Topology of FlexAlgo 129 For a piece of routing information in the topology of FlexAlgo 128, A8::/64 next-hop:xxx, interface:intf1, cost:75, prefix A8::/64, next-hop address is xxx, outgoing The interface is intf1 and the cost is 75.
  • the routing information corresponding to the topology of FlexAlgo 128 is A8::/64 next-hop:xxx, interface:intf1, cost:75 and routing information A7::/64 next-hop:xxx, interface:intf1 , cost: 60 is in the same forwarding table, and the table ID is 128.
  • each piece of routing information may also correspond to an identifier of a network topology, and a one-to-one relationship between the identifier of the network topology and the routing information can be used to implement the routing information within the same network topology.
  • the routing information corresponds to the identification of the same network topology.
  • the first routing information includes an identifier of the first network topology.
  • the first routing information includes but is not limited to prefix, next-hop, outgoing interface (interface), and cost (cost).
  • the prefix in the first routing information in the second is obtained by encoding the original prefix and the identifier of the first network topology, that is, the identifier of the first network topology is in the first routing information, thereby realizing the network slicing and the target network topology. association. Since the identifier of the first network topology is included in the first routing information, the routing information of each network topology can still be distinguished even in one forwarding table.
  • the network is divided into a topology of FlexAlgo 128 based on delay metric and a topology of FlexAlgo 129 based on IGP metric.
  • the prefix is A8:0:0:80/64
  • the prefix is A8: 0:0:80/64 is obtained through the original prefix A8::/64 and the identification code of the network topology.
  • the address of the next hop (next-hop) is xxx
  • the outgoing interface (interface) is intf1
  • the cost (cost) is 75. Since the identification of each network topology is included in the corresponding routing information, a piece of routing information A8:0:0:80/64 next-hop:xxx, interface:intf1, cost:75 in the topology of FlexAlgo 128 is the same as that of FlexAlgo 129.
  • a piece of routing information in the topology A8:0:0:81/64 next-hop:xxx, interface:intf1, cost:60 even in a forwarding table, through A8:0:0:80 and A8:0:0 :81 difference can still be distinguished.
  • the first routing information further includes an identifier of a first resource corresponding to the first network topology, and the identifier of the first resource corresponds to an interface of the first resource.
  • the manner of generating the second routing information is the same as the manner of generating the first routing information, and reference may be made to the foregoing manner of generating the first routing information.
  • the second routing information corresponds to the identification of the second network topology.
  • the second routing information includes an identification of the second network topology.
  • the second routing information also includes a second resource identifier corresponding to the second network topology, where the second resource identifier corresponds to an interface of the second resource.
  • the first network device generates routing information based on the association flexible algorithm corresponding to the network topology where it is located, compared to When a locator carries a flexible algorithm, in the process of generating routing information, it not only reduces the IPv6 address space, but also saves network resources.
  • the routing information obtained by the method for generating routing information provided in this embodiment of the present application can be applied to the process of forwarding packets.
  • the method for forwarding a packet provided by this embodiment of the present application includes the following processes.
  • the first network device obtains a first packet, the network topology matching the first packet is the first network topology, and the first network topology is the network topology where the first network device is located.
  • the first network device acquires the first packet, including but not limited to the following two situations.
  • Case 1 The first network device is the head node device that sends the packet.
  • the first network device Since the first network device is the head node device that sends the message, the obtained message does not include the identifier of the first network topology.
  • the first network device obtains the first message, including : The first network device obtains the second packet, and adds the identifier of the first network topology to the second packet to obtain the first packet.
  • the identifier of the first network topology is added to the second packet to obtain the first packet, including but not limited to the following two adding methods.
  • Adding manner 1 adding the identifier of the first network topology to the hop-by-hop (HBH) field of the second packet to obtain the first packet.
  • HSH hop-by-hop
  • the adding method 1 add an HBH header to the second message at the message entry of the first network device, that is, the HBH field, add the corresponding topo ID in the HBH field, and add the first network in the HBH field.
  • the identification of the topology enables the device receiving the second packet to determine the first network topology, thereby determining the routing information of the first packet based on the relationship between the network topology and the routing information.
  • the second packet includes an Ethernet (ethernet, ETH) layer, an internet protocol (IP) layer including a differentiated services code point (DSCP), a general wireless packet service (general packet radio service, GPRS) tunneling protocol (GPRS tunneling protocol, GTP) layer and payload (payload) layer.
  • IP internet protocol
  • GPRS general wireless packet service
  • GTP general packet radio service tunneling protocol
  • payload payload
  • the second packet may further include a virtual local area network (virtual local area network, VLAN) layer.
  • VLAN virtual local area network
  • the flexible algorithm identifier that is, the topology identifier
  • the forwarding plane forwards packets through the SID[B1 ::1] Determine that the next hop (Nexthop) is (2001::2), and the outbound interface (outintf) is (Gi0/0/1).
  • the forwarding plane uses the SID[B1::1] in the packets and the network topology (take the topology corresponding to FlexAlgo as an example) to determine the next hop (Nexthop) as (2001 ::2), the outbound interface (outintf) is (Gi0/0/1). Therefore, after acquiring the second packet, the first network device adds an IPv6 header (Head) and an HBH field including a topology ID between the IP layer and the ETH layer of the second packet.
  • IPv6 header Head
  • HBH field including a topology ID between the IP layer and the ETH layer of the second packet.
  • the IPv6 header includes a version (version11) field, a traffic class (traffic class) field, a flow label (Flow label) field, a payload length (payload length) field, a source address (Source Address) field, and a destination address (Destination Address) fields, etc.
  • the source address is A1::1
  • the destination address is A2::11.
  • an SRV6 extension header (Routing Type is 4) SRH is introduced.
  • the meanings of each field of the SRH are as follows.
  • topo-ID adding the identifier (topo-ID) of the first network topology in the HBH is only used for illustration, but is not used to limit the way of adding the identifier of the first network topology in the second packet, nor Other addition methods can be used, for example, in the flow label (flowlabel), the domain name system (DNS) (DNS-over-HTTPS, DoH) based on the hypertext transfer protocol (hyper text transfer protocol over secure socket layer, HTTPS) ), the identifier of the first network topology is added to the SRH.
  • DNS domain name system
  • DoH domain name system
  • HTTPS hypertext transfer protocol
  • Adding manner 2 adding a segment identifier including the identifier of the first network topology to the segment identifier SID list of the second packet to obtain the first packet.
  • the HBH header is not encapsulated at the message entry of the first network device, that is, the HBH field is not encapsulated, and 4 bytes are extended after the VPN SID in the second message as an extension bit. topoID is padded to this extension bit.
  • the identifier of the first resource corresponding to the first network topology is also added to the second packet. That is, the identifier of the first network topology and the identifier of the first resource are added to the second packet to obtain the first packet.
  • the first resource is a resource in the first network topology, and the identifier of the first resource is used to indicate that the first packet is sent in the first network topology by using the first resource.
  • the second packet includes an Ethernet (ethernet, ETH) layer and an internetwork including a differentiated services code point (DSCP) A protocol (internet protocol, IP) layer, a general packet radio service (general packet radio service, GPRS) tunneling protocol (GPRS tunneling protocol, GTP) layer and a payload (payload) layer.
  • DSCP differentiated services code point
  • IP internet protocol
  • GPRS general packet radio service
  • GTP general packet radio service tunneling protocol
  • payload payload
  • the first network device adds the SID of SRv6BE and the HBH field including the topology ID between the IP layer and the ETH layer of the second packet.
  • a resource identifier is also added, and the resource identifier is also added in the HBH field exemplarily. For example, the Slice ID in FIG. 10 .
  • the method provided by the embodiment of the present application before adding the identifier of the first network topology to the second packet, the method provided by the embodiment of the present application further needs to determine that the network topology matching the second packet is the first network topology. Therefore, the first network topology needs to be determined.
  • the network device adds the identifier of the first network topology to the second packet to obtain the first packet, including: the first network device determines, according to the destination address of the second packet, that a flexible algorithm matching the second packet is the first A flexible algorithm, where the first flexible algorithm corresponds to the first network topology, and the first network device determines that the network topology that matches the second packet is the first network topology; or, the first network device determines that the destination address of the second packet matches the specified The destination address, specifying that the destination address matches the first network topology, and the first network device determines that the network topology that matches the second packet is the first network topology.
  • the prefix and mask corresponding to the first flexible algorithm can be specified in advance, so that after obtaining the prefix and mask corresponding to the second packet according to the destination address of the second packet, the prefix and mask corresponding to the second packet are determined. Is it the specified prefix and mask. If it is the specified prefix and mask, the flexible algorithm that matches the second packet is determined to be the first flexible algorithm, and since the first flexible algorithm corresponds to the first network topology, the network topology that matches the second packet is determined to be The first network topology.
  • the specified prefix and mask correspond to the identifier of the first network topology
  • the prefix corresponding to the second packet obtained from the destination address of the second packet is the specified prefix
  • the obtained mask is the specified mask
  • the first network device is an intermediate node device that sends a packet.
  • the first network device acquiring the first packet includes: the first network device receiving the first packet, and determining that the network topology matching the first packet is the first network topology.
  • the routing information of the first packet is determined based on the relationship between the network topology and the routing information by determining the first network topology that matches the first packet.
  • the manner of determining the first network topology that matches the first packet is not limited in this embodiment of the present application, for example, it is implemented by means of policy fuzzy matching or explicit designation.
  • policy fuzzy matching refers to matching topoId by specifying prefix and mask
  • explicit specifying refers to matching topoId by specifying destination.
  • the network topology that matches the first packet is determined as the first network topology, including but not limited to the following three determination methods.
  • Determining manner 1 According to the destination address of the first packet, the flexible algorithm that matches the first packet is determined as the first flexible algorithm, the first flexible algorithm corresponds to the first network topology, and the first network device determines the first flexible algorithm according to the first flexible algorithm.
  • the network topology matched by the first packet is the first network topology.
  • the prefix and mask corresponding to the first flexible algorithm can be specified in advance, so that the prefix and mask corresponding to the first packet are obtained according to the destination address of the first packet, and then the prefix corresponding to the first packet is determined. and whether the mask is the specified prefix and mask. If it is the specified prefix and mask, the flexible algorithm that matches the first packet is determined to be the first flexible algorithm, and since the first flexible algorithm corresponds to the first network topology, the network topology that matches the first packet is determined to be The first network topology.
  • the specified prefix and mask correspond to the identifier of the first network topology
  • the prefix corresponding to the first packet obtained from the destination address of the first packet is the specified prefix
  • the obtained mask is the specified mask
  • Determination method 2 The first network device determines that the destination address of the first packet matches the specified destination address, the specified destination address matches the first network topology, and the first network device determines that the network topology that matches the first packet is the first network topology .
  • which network topology matches the destination address can be specified in advance, thus determining the network topology matching the destination address of the first packet, and obtaining the network topology matching the first packet as the first network topology.
  • the first packet includes an identifier of the first network topology; and according to the identifier of the first network topology included in the first packet, the network topology matching the first packet is determined as the first network topology.
  • the network topology matching the first packet can be determined as the first network topology directly based on the identifier of the first network topology.
  • the identifier of the first network topology included in the first packet may be added by the head node device.
  • the first network device determines, according to the first network topology, that the routing information of the first packet is the first routing information, and the first routing information is used to send the packet in the first network topology.
  • the first routing information is calculated based on a first flexible algorithm, and the first flexible algorithm is one of multiple associated flexible algorithms, and the multiple associated flexible algorithms are obtained from location information sent by the second network device, where the location information includes a location identifier and Multiple associative flexible algorithms corresponding to location identifiers.
  • the method before determining that the routing information of the first packet is the first routing information according to the identifier of the first network topology, the method further includes: the first network device receiving the location information sent by the second network device; The flexible algorithm generates first routing information to the second network device.
  • the routing information of the first packet can be determined according to the first network topology as the first network topology. routing information.
  • the first network device sends the first packet according to the first routing information.
  • the method of generating the first routing information includes but is not limited to the following two situations.
  • the first network device sends the first routing information according to the first routing information.
  • a message also includes two cases.
  • Case 1 The first routing information corresponds to the identifier of the first network topology.
  • sending the first packet according to the first routing information by the first network device includes: the first network device determines the first routing information according to the identifier of the first network topology, and forwards the first packet according to the outbound interface in the first routing information. a message.
  • the first routing information is a piece of routing information A8::/64 next- hop:xxx, interface:intf1, cost:75.
  • the prefix in the first routing information is A8::/64
  • the next-hop address is xxx
  • the outgoing interface (interface) is intf1
  • the cost (cost) is 75.
  • the routing information corresponding to the topology of FlexAlgo 128 is A8::/64 next-hop:xxx, interface:intf1, cost:75 and routing information A7::/64 next-hop:xxx, interface:intf1 , cost: 60 is in the same forwarding table, and the table ID is 128. It can be seen that the routing information A8::/64 next-hop:xxx, interface:intf1, cost:75 and the topology ID corresponding to the topology of FlexAlgo 128 are independent of each other and correspond to each other.
  • the first network device After receiving the first packet, the first network device determines that the network topology matching the first packet is the first network topology, that is, the topology of FlexAlgo 128, and finds the forwarding table with the table ID 128.
  • the first network device determines that the outbound interface of the first packet is intf1, and forwards the first packet through the intf1 interface.
  • the first routing information includes an identifier of the first network topology.
  • sending the first packet by the first network device according to the first routing information includes: the first network device encodes the identifier of the first network topology and the prefix of the destination address of the first packet, The prefix determines the first routing information, and forwards the first packet according to the outbound interface in the first routing information.
  • the first routing information is a piece of routing information A8:0:0:80/ in the topology of FlexAlgo 128/ 64 next-hop:xxx, interface:intf1, cost:75.
  • the first routing information includes a prefix of A8:0:0:80/64, a next-hop address of xxx, an outgoing interface (interface) of intf1, and a cost of 75.
  • the prefix A8:0:0:80/64 is obtained by encoding the original prefix A8::/64 and the identifier of the first network topology, that is, 128. It can be seen that the identifier of the first network topology is included in the first In the routing information, specifically, the identifier of the first network topology is included in the prefix of the first routing information.
  • the first network device After the first network device receives the first packet and determines that the network topology matching the first packet is the first network topology, that is, the topology of the FlexAlgo 128, the identifier of the first network topology, that is, 128, can be associated with the first packet.
  • the prefix of the destination address of the text is encoded to obtain A8:0:0:80, so that the first routing information is determined as A8:0:0:80/64 next-hop:xxx, interface:intf1, cost:75.
  • the first packet is forwarded based on the outgoing interface in A8:0:0:80/64 next-hop:xxx, interface:intf1, and cost:75. For example, the first network device determines that the outbound interface of the first packet is intf1, and forwards the first packet through the intf1 interface.
  • the first routing information further includes an identifier of a first resource
  • the first resource is a resource in the first network topology
  • the first network device sends the first packet according to the first routing information, including: according to The first packet is sent within the first network topology using the first routing information and using the first resource.
  • the identifier of the first resource corresponds to the interface of the first resource, so the first network device forwards the first packet based on the interface of the first resource, that is, uses the first resource to send the first packet.
  • the network topology where the first network device is located is the first network topology, and the first network device forwards the first packet based on the first routing information generated by the first network topology.
  • the network topology where the first network device is located also includes other network topologies other than the first network topology, it is also applicable to the method for forwarding packets provided by the embodiment of the present application, and can refer to the method shown in FIG. 8 The method flow is not repeated here.
  • the method provided by the embodiment of the present application further includes: the first network device obtains the third packet, the network topology matching the third packet is the second network topology, and the second network topology is the network topology where the first network device is located ; The first network device determines the routing information of the third packet as the second routing information according to the second network topology; the first network device sends the third packet according to the second routing information.
  • the second routing information corresponds to the identification of the second network topology.
  • the second routing information includes an identification of the second network topology.
  • the first routing information for forwarding the first packet is determined according to the first network topology matching the first packet, so that the first network topology
  • the first packet is sent within the network, which implements the method of forwarding packets based on the network topology.
  • An embodiment of the present application provides an apparatus for generating routing information, which is configured to execute the method for generating routing information in FIG. 4 through each module shown in FIG. 11 , and the apparatus may be the first network device in FIG. 4 .
  • the device includes:
  • the receiving module 1101 is used to receive the location information sent by the second network device, the location information includes a location identifier and a plurality of associated flexible algorithms corresponding to the location identifier, and the location identifier is used to identify the location of the second network device in the network; the receiving module 1101
  • the location information includes a location identifier and a plurality of associated flexible algorithms corresponding to the location identifier, and the location identifier is used to identify the location of the second network device in the network; the receiving module 1101
  • the receiving module 1101 For the functions performed by the module 1101, reference may be made to the relevant description of 402 shown in FIG. 4, and details are not repeated here.
  • the generating module 1102 is configured to generate first routing information to the second network device based on a first flexible algorithm, where the first flexible algorithm is one of a plurality of associated flexible algorithms, the first flexible algorithm corresponds to the first network topology, and the first flexible algorithm corresponds to the first network topology.
  • the network topology is the network topology where the apparatus for generating routing information is located, and the first routing information is used to send packets to the second network device within the first network topology.
  • the multiple associated flexible algorithms further include a second flexible algorithm
  • the generating module 1102 is further configured to generate second routing information to the second network device based on the second flexible algorithm, the second routing information being the same as the second routing information.
  • the second network topology is the network topology where the device generating routing information is located, and the second routing information is used to send packets to the second network device within the second network topology.
  • the first routing information corresponds to an identifier of the first network topology.
  • the first routing information includes an identifier of the first network topology.
  • An embodiment of the present application provides an apparatus for sending location information.
  • the apparatus is configured to execute the method for sending location information in FIG. 4 through each module shown in FIG. 12 .
  • the apparatus may be the second network device in FIG. 4 . Referring to Figure 12, the device includes:
  • the sending module 1201 is configured to send location information to the first network device, where the location information includes a location identifier and a plurality of associated flexible algorithms corresponding to the location identifier, and the location identifier is used to identify the location of the device for sending location information in the network.
  • the first flexible algorithm in the association flexible algorithm is used by the first network device to generate first routing information to the second network device, the first flexible algorithm corresponds to the first network topology, and the first network topology is the network where the first network device is located topology, and the first routing information is used by the first network device to send a packet to an apparatus for sending location information within the first network topology.
  • the sending module 1201 For the functions performed by the sending module 1201, reference may be made to the related description of 401 shown in FIG. 4, and details are not repeated here.
  • the multiple association flexible algorithms further include a second flexible algorithm, and the second flexible algorithm is used by the first network device to generate second routing information to the apparatus for sending location information, and the second routing information is related to the second routing information.
  • the two network topologies correspond.
  • the second network topology is the network topology where the first network device is located, and the second routing information is used to send a message to the device for sending location information in the second network topology.
  • An embodiment of the present application provides an apparatus for forwarding a message.
  • the apparatus is configured to execute the method for forwarding a message in FIG. 8 through each module shown in FIG. 13 , and the apparatus is the first network device in FIG. 8 .
  • the device includes:
  • the obtaining module 1301 is used to obtain the first message, the network topology matching the first message is the first network topology, and the first network topology is the network topology where the device that forwards the message is located; the functions performed by the obtaining module 1301 may be Referring to the related description of 801 shown in FIG. 8 , details are not repeated here.
  • the determining module 1302 is configured to determine the first routing information according to the first network topology, and the first routing information is used to send the first packet in the first network topology; the functions performed by the determining module 1302 may refer to 802 shown in FIG. 8 The related descriptions are not repeated here.
  • the sending module 1303 is configured to send the first packet according to the first routing information.
  • the sending module 1303 reference may be made to the relevant description of 803 shown in FIG. 8, and details are not repeated here.
  • the obtaining module 1301 is configured to obtain the second packet; adding an identifier of the first network topology to the second packet to obtain the first packet.
  • the obtaining module 1301 is configured to add the identifier of the first network topology to the hop-by-hop HBH field of the second packet to obtain the first packet.
  • the obtaining module 1301 is configured to add a segment identifier including an identifier of the first network topology to the segment identifier list of the second packet to obtain the first packet.
  • the obtaining module 1301 is configured to add the identifier of the first network topology and the identifier of the first resource to the second packet to obtain the first packet, where the first resource is the first network The resource in the topology, the identifier of the first resource is used to indicate that the first packet is sent in the first network topology by using the first resource.
  • the obtaining module 1301 is configured to determine, according to the destination address of the second packet, a flexible algorithm that matches the second packet as a first flexible algorithm, and the first flexible algorithm corresponds to the first network topology ; Determine that the network topology that matches the second message is the first network topology; Or, determine that the destination address of the second message matches the specified destination address, the specified destination address matches the first network topology, and determines that the destination address matches the second message.
  • the network topology is the first network topology.
  • the obtaining module 1301 is configured to receive the first packet; and determine the network topology matching the first packet as the first network topology.
  • the determining module 1302 is configured to determine, according to the destination address of the first packet, a flexible algorithm that matches the first packet as a first flexible algorithm, and the first flexible algorithm corresponds to the first network topology , determining that the network topology matching the first packet is the first network topology;
  • the destination address of the first packet matches the specified destination address
  • the specified destination address matches the first network topology
  • the network topology matching the first packet is determined to be the first network topology
  • the first packet includes an identifier of the first network topology; the determining module 1302 is configured to determine a match with the first packet according to the identifier of the first network topology included in the first packet
  • the network topology is the first network topology.
  • the first packet further includes an identifier of the first resource, and the first resource is a resource in the first network topology;
  • the sending module 1303 is configured to send the first packet in the first network topology by using the first resource according to the first routing information.
  • the first routing information corresponds to an identifier of the first network topology
  • the determining module 1302 is configured to determine the first routing information according to the corresponding relationship between the first routing information and the identifier of the first network topology.
  • the identifier of the first network topology is included in the first routing information
  • the determining module 1302 is configured to determine the first routing information according to the identifier of the first network topology included in the first routing information.
  • FIG. 14 shows a schematic structural diagram of a network device 2000 provided by an exemplary embodiment of the present application.
  • the network device 2000 shown in FIG. 14 is configured to perform the operations involved in the method for sending location information shown in FIG. 4 , the method for generating routing information, and the method for forwarding packets shown in FIG. 8 .
  • the network device 2000 is, for example, a switch, a router, etc., and the network device 2000 can be implemented by a general bus architecture.
  • the network device 2000 includes at least one processor 2001 , memory 2003 and at least one communication interface 2004 .
  • the processor 2001 is, for example, a general-purpose central processing unit (central processing unit, CPU), a digital signal processor (digital signal processor, DSP), a network processor (network processor, NP), a graphics processor (Graphics Processing Unit, GPU), A neural-network processing unit (NPU), a data processing unit (DPU), a microprocessor or one or more integrated circuits for implementing the solution of the present application.
  • the processor 2001 includes an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof.
  • ASIC application-specific integrated circuit
  • PLD programmable logic device
  • the PLD is, for example, a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a generic array logic (GAL), or any combination thereof. It may implement or execute the various logical blocks, modules and circuits described in connection with the disclosure of the embodiments of the present invention.
  • the processor may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.
  • the network device 2000 further includes a bus.
  • the bus is used to transfer information between the components of the network device 2000 .
  • the bus may be a peripheral component interconnect (PCI for short) bus or an extended industry standard architecture (EISA for short) bus or the like.
  • PCI peripheral component interconnect
  • EISA extended industry standard architecture
  • the bus can be divided into address bus, data bus, control bus and so on. For ease of presentation, only one thick line is shown in FIG. 14, but it does not mean that there is only one bus or one type of bus.
  • the memory 2003 is, for example, a read-only memory (read-only memory, ROM) or other types of static storage devices that can store static information and instructions, or a random access memory (random access memory, RAM) or a memory device that can store information and instructions.
  • Other types of dynamic storage devices such as electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM) or other optical disk storage, optical disks storage (including compact discs, laser discs, compact discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media, or other magnetic storage devices, or capable of carrying or storing desired program code in the form of instructions or data structures and capable of Any other medium accessed by a computer without limitation.
  • the memory 2003 exists independently, for example, and is connected to the processor 2001 through a bus.
  • the memory 2003 may also be integrated with the processor 2001 .
  • the communication interface 2004 uses any device such as a transceiver for communicating with other devices or a communication network, which may be Ethernet, a radio access network (RAN), or wireless local area networks (WLAN), or the like.
  • Communication interface 2004 may include a wired communication interface and may also include a wireless communication interface.
  • the communication interface 2004 may be an Ethernet (Ethernet) interface, a Fast Ethernet (FE) interface, a Gigabit Ethernet (GE) interface, an Asynchronous Transfer Mode (ATM) interface, a wireless local area network ( wireless local area networks, WLAN) interfaces, cellular network communication interfaces, or a combination thereof.
  • the Ethernet interface can be an optical interface, an electrical interface or a combination thereof.
  • the communication interface 2004 may be used for the network device 2000 to communicate with other devices.
  • the processor 2001 may include one or more CPUs, such as CPU0 and CPU1 as shown in FIG. 14 .
  • Each of these processors can be a single-core (single-CPU) processor or a multi-core (multi-CPU) processor.
  • a processor herein may refer to one or more devices, circuits, and/or processing cores for processing data (eg, computer program instructions).
  • the network device 2000 may include multiple processors, such as the processor 2001 and the processor 2005 shown in FIG. 14 .
  • processors can be a single-core processor (single-CPU) or a multi-core processor (multi-CPU).
  • a processor herein may refer to one or more devices, circuits, and/or processing cores for processing data (eg, computer program instructions).
  • the network device 2000 may further include an output device and an input device.
  • the output device communicates with the processor 2001 and can display information in a variety of ways.
  • the output device may be a liquid crystal display (LCD), a light emitting diode (LED) display device, a cathode ray tube (CRT) display device, a projector, or the like.
  • the input device communicates with the processor 2001 and can receive user input in various ways.
  • the input device may be a mouse, a keyboard, a touch screen device, or a sensor device, or the like.
  • the memory 2003 is used to store the program code 2010 for executing the solutions of the present application
  • the processor 2001 can execute the program code 2010 stored in the memory 2003 . That is, the network device 2000 can use the processor 2001 and the program code 2010 in the memory 2003 to implement the method for sending location information, the method for generating routing information, and the method for forwarding packets provided by the method embodiments.
  • One or more software modules may be included in the program code 2010 .
  • the processor 2001 itself may also store program codes or instructions for executing the solutions of the present application.
  • the network device 2000 in this embodiment of the present application may correspond to the first network device in each of the above method embodiments, and the processor 2001 in the network device 2000 reads the instructions in the memory 2003, so that as shown in FIG. 14
  • the network device 2000 can perform all or part of the operations performed by the first network device.
  • the processor 2001 is configured to receive location information sent by the second network device through the communication interface, where the location information includes a location identifier and multiple associated flexible algorithms corresponding to the location identifier, and the location identifier is used to identify that the second network device is in the network location; the processor 2001 generates first routing information to the second network device based on a first flexible algorithm, the first flexible algorithm is one of a plurality of associated flexible algorithms, the first flexible algorithm corresponds to the first network topology, the first flexible algorithm is The network topology is the network topology where the first network device is located, and the first routing information is used to send packets to the second network device within the first network topology.
  • the processor 2001 obtains the first packet, the network topology matching the first packet is the first network topology, and the first network topology is the network topology where the first network device is located; the first network device is based on the first network topology.
  • Determine the first routing information where the first routing information is used to send the first packet in the first network topology; the processor 2001 sends the first packet through the interface according to the first routing information.
  • the network device 2000 in this embodiment of the present application may correspond to the second network device in the foregoing method embodiments, and the processor 2001 in the network device 2000 reads the instructions in the memory 2003 to make the network device shown in FIG. 14 .
  • 2000 is capable of performing all or part of the operations performed by the second network device.
  • the processor 2001 is configured to send location information to the first network device through a communication interface, where the location information includes a location identifier and multiple associated flexible algorithms corresponding to the location identifier, and the location identifier is used to identify the location of the second network device in the network.
  • Location the first flexible algorithm among the plurality of associated flexible algorithms is used by the first network device to generate first routing information to the second network device, the first flexible algorithm corresponds to the first network topology, and the first network topology is the first network The network topology where the device is located, and the first routing information is used by the first network device to send packets to the second network device within the first network topology.
  • the network device 2000 may also correspond to the apparatus shown in FIGS. 11-13 above, and each functional module in the apparatus shown in FIGS. 11-13 is implemented by software of the network device 2000 .
  • the functional modules included in the apparatus shown in FIGS. 11-13 are generated after the processor 2001 of the network device 2000 reads the program code 2010 stored in the memory 2003 .
  • the steps of the methods disclosed in conjunction with the embodiments of the present application may be directly embodied as executed by a hardware processor, or executed by a combination of hardware and software modules in the processor.
  • the software modules may be located in random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, registers and other storage media mature in the art.
  • the storage medium is located in the memory, and the processor reads the information in the memory, and completes the steps of the above method in combination with its hardware, which will not be described in detail here to avoid repetition.
  • FIG. 15 shows a schematic structural diagram of a network device 2100 provided by another exemplary embodiment of the present application.
  • the network device 2100 shown in FIG. 15 is used to execute the method for sending location information and generate a route shown in FIG. 4. All or part of the operations involved in the method for information and the method for forwarding a message shown in FIG. 8 .
  • the network device 2100 is, for example, a switch, a router, etc., and the network device 2100 can be implemented by a general bus architecture.
  • the network device 2100 includes: a main control board 2110 and an interface board 2130 .
  • the main control board is also called the main processing unit (MPU) or the route processor card (route processor card).
  • the main control board 2110 is used to control and manage various components in the network device 2100, including route calculation, device management , Equipment maintenance, protocol processing functions.
  • the main control board 2110 includes: a central processing unit 2111 and a memory 2112 .
  • the interface board 2130 is also referred to as a line processing unit (LPU), a line card (line card) or a service board.
  • the interface board 2130 is used to provide various service interfaces and realize data packet forwarding.
  • the service interface includes, but is not limited to, an Ethernet interface, a POS (Packet over SONET/SDH) interface, etc.
  • the Ethernet interface is, for example, a flexible Ethernet service interface (Flexible Ethernet Clients, FlexE Clients).
  • the interface board 2130 includes: a central processing unit 2131, a network processor 2132, a forwarding table entry memory 2134, and a physical interface card (PIC) 2133.
  • PIC physical interface card
  • the central processing unit 2131 on the interface board 2130 is used to control and manage the interface board 2130 and communicate with the central processing unit 2111 on the main control board 2110.
  • the network processor 2132 is used to implement packet forwarding processing.
  • the form of the network processor 2132 may be a forwarding chip.
  • the forwarding chip may be a network processor (NP).
  • the forwarding chip may be implemented by an application-specific integrated circuit (ASIC) or a field programmable gate array (FPGA).
  • ASIC application-specific integrated circuit
  • FPGA field programmable gate array
  • the network processor 2132 is configured to forward the received message based on the forwarding table stored in the forwarding table entry memory 2134.
  • the message is sent to the CPU (such as processing by the central processing unit 2131); if the destination address of the message is not the address of the network device 2100, the next hop and outbound interface corresponding to the destination address are found from the forwarding table according to the destination address, and the message is forwarded to The outbound interface corresponding to the destination address.
  • the processing of the uplink message may include: processing of the incoming interface of the message, and forwarding table lookup; the processing of the downlink message may include: forwarding table lookup, and so on.
  • the central processing unit can also perform the function of a forwarding chip, for example, software forwarding is implemented based on a general-purpose CPU, so that a forwarding chip is not required in the interface board.
  • the physical interface card 2133 is used to realize the interconnection function of the physical layer, the original traffic enters the interface board 2130 through this, and the processed packets are sent from the physical interface card 2133 .
  • the physical interface card 2133 is also called a daughter card, which can be installed on the interface board 2130, and is responsible for converting the photoelectric signal into a message, and after checking the validity of the message, it is forwarded to the network processor 2132 for processing.
  • the central processing unit 2131 can also perform the functions of the network processor 2132 , such as implementing software forwarding based on a general-purpose CPU, so that the network processor 2132 is not required in the physical interface card 2133 .
  • the network device 2100 includes multiple interface boards.
  • the network device 2100 further includes an interface board 2140 .
  • the interface board 2140 includes a central processing unit 2141 , a network processor 2142 , a forwarding table entry storage 2144 and a physical interface card 2143 .
  • the functions and implementation manners of the components in the interface board 2140 are the same as or similar to those of the interface board 2130, and will not be repeated here.
  • the network device 2100 further includes a switch fabric board 2120 .
  • the switch fabric unit 2120 may also be referred to as a switch fabric unit (switch fabric unit, SFU).
  • SFU switch fabric unit
  • the switching network board 2120 is used to complete data exchange between the interface boards.
  • the interface board 2130 and the interface board 2140 can communicate through the switch fabric board 2120 .
  • the main control board 2110 is coupled with the interface board.
  • the main control board 2110, the interface board 2130, the interface board 2140, and the switching network board 2120 are connected to the system backplane through a system bus to achieve intercommunication.
  • an inter-process communication (IPC) channel is established between the main control board 2110 and the interface board 2130 and the interface board 2140, and the main control board 2110 and the interface board 2130 and the interface board 2140 The communication is carried out through the IPC channel.
  • IPC inter-process communication
  • the network device 2100 includes a control plane and a forwarding plane
  • the control plane includes a main control board 2110 and a central processing unit 2111
  • the forwarding plane includes various components that perform forwarding, such as forwarding entry storage 2134, physical interface card 2133, and network processing device 2132.
  • the control plane performs functions such as routers, generating forwarding tables, processing signaling and protocol packets, and configuring and maintaining the status of network devices.
  • the control plane issues the generated forwarding tables to the forwarding plane.
  • the network processor 2132 controls the The following forwarding table forwards the packets received by the physical interface card 2133 by looking up the table.
  • the forwarding table issued by the control plane may be stored in the forwarding table entry storage 2134 . In some embodiments, the control plane and forwarding plane may be completely separated and not on the same network device.
  • main control boards there may be one or more main control boards, and when there are multiple main control boards, they may include the main main control board and the backup main control board.
  • a network device can have at least one switch fabric board, and the switch fabric board realizes data exchange between multiple interface boards, providing large-capacity data exchange and processing capabilities. Therefore, the data access and processing capabilities of network devices in a distributed architecture are greater than those in a centralized architecture.
  • the form of the network device can also be that there is only one board, that is, there is no switching network board, and the functions of the interface board and the main control board are integrated on this board.
  • the central processing unit on the board can be combined into a central processing unit on this board to perform the functions of the two superimposed, the data exchange and processing capacity of this form of network equipment is low (for example, low-end switches or routers, etc. Network equipment).
  • the specific architecture used depends on the specific networking deployment scenario, and there is no restriction here.
  • the network device 2100 corresponds to the apparatus for generating routing information and the apparatus for forwarding packets applied to the first network device shown in FIG. 11 and FIG. 13 .
  • the receiving module 1101 in the apparatus for generating routing information shown in FIG. 11 and the sending module 1303 shown in FIG. 13 are equivalent to the physical interface card 2133 in the network device 2100 .
  • the network device 2100 also corresponds to the apparatus for sending location information applied to the second network device shown in FIG. 12 .
  • the sending module 1201 in the apparatus for sending location information shown in FIG. 12 is equivalent to the physical interface card 2133 in the network device 2100 .
  • an embodiment of the present application further provides a communication system, where the communication system includes: a first network device and a second network device.
  • the first network device is the network device 2000 shown in FIG. 14 or the network device 2100 shown in FIG. 15
  • the second network device is the network device 2000 shown in FIG. 14 or the network device 2100 shown in FIG. 15 .
  • An embodiment of the present application also provides a communication apparatus, the apparatus includes: a transceiver, a memory, and a processor.
  • the transceiver, the memory and the processor communicate with each other through an internal connection path, the memory is used for storing instructions, and the processor is used for executing the instructions stored in the memory to control the transceiver to receive signals and control the transceiver to send signals , and when the processor executes the instructions stored in the memory, the processor is made to execute the method required to be executed by the first network device.
  • An embodiment of the present application also provides a communication apparatus, the apparatus includes: a transceiver, a memory, and a processor.
  • the transceiver, the memory and the processor communicate with each other through an internal connection path, the memory is used for storing instructions, and the processor is used for executing the instructions stored in the memory to control the transceiver to receive signals and control the transceiver to send signals , and when the processor executes the instructions stored in the memory, the processor is made to execute the method required to be executed by the second network device.
  • processor may be a central processing unit (Central Processing Unit, CPU), or other general-purpose processors, digital signal processing (digital signal processing, DSP), application specific integrated circuit (application specific integrated circuit, ASIC), field-programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • a general purpose processor may be a microprocessor or any conventional processor or the like. It should be noted that the processor may be a processor supporting an advanced RISC machine (ARM) architecture.
  • ARM advanced RISC machine
  • the above-mentioned memory may include read-only memory and random access memory, and provide instructions and data to the processor.
  • the memory may also include non-volatile random access memory.
  • the memory may also store device type information.
  • the memory may be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory may be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically programmable Erase programmable read-only memory (electrically EPROM, EEPROM) or flash memory.
  • Volatile memory may be random access memory (RAM), which acts as an external cache. By way of example and not limitation, many forms of RAM are available.
  • SRAM static RAM
  • DRAM dynamic random access memory
  • SDRAM synchronous dynamic random access memory
  • double data rate synchronous dynamic random access Memory double data date SDRAM, DDR SDRAM
  • enhanced synchronous dynamic random access memory enhanced SDRAM, ESDRAM
  • synchronous link dynamic random access memory direct memory bus random access memory
  • direct rambus RAM direct rambus RAM
  • Embodiments of the present application also provide a computer-readable storage medium, where at least one instruction is stored in the storage medium, and the instruction is loaded and executed by a processor to implement the method for sending location information and the method for generating routing information as shown in FIG. 4 above. And the method for forwarding the message shown in FIG. 8 .
  • Embodiments of the present application also provide a computer program (product), which, when the computer program is executed by a computer, can cause a processor or computer to execute the corresponding steps and/or processes in the foregoing method embodiments.
  • Embodiments of the present application further provide a chip, including a processor, configured to call and execute instructions stored in the memory from a memory, so that a communication device installed with the chip executes the methods in the above aspects.
  • An embodiment of the present application further provides another chip, including: an input interface, an output interface, a processor, and a memory, wherein the input interface, the output interface, the processor, and the memory are connected through an internal connection path, and the A processor is configured to execute code in the memory, and when the code is executed, the processor is configured to execute the methods of the above-described aspects.
  • the above-mentioned embodiments it may be implemented in whole or in part by software, hardware, firmware or any combination thereof.
  • software it can be implemented in whole or in part in the form of a computer program product.
  • the computer program product includes one or more computer instructions.
  • the computer program instructions when loaded and executed on a computer, result in whole or in part of the processes or functions described herein.
  • the computer may be a general purpose computer, special purpose computer, computer network, or other programmable device.
  • the computer instructions may be stored in or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be downloaded from a website site, computer, server or data center Transmission to another website site, computer, server, or data center by wire (eg, coaxial cable, optical fiber, digital subscriber line) or wireless (eg, infrared, wireless, microwave, etc.).
  • the computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that includes an integration of one or more available media.
  • the usable media may be magnetic media (eg, floppy disks, hard disks, magnetic tapes), optical media (eg, DVD), or semiconductor media (eg, Solid State Disk), and the like.
  • the computer program product includes one or more computer program instructions.
  • the methods of the embodiments of the present application may be described in the context of machine-executable instructions, such as included in program modules executed in a device on a target's real or virtual processor.
  • program modules include routines, programs, libraries, objects, classes, components, data structures, etc. that perform particular tasks or implement particular abstract data structures.
  • the functionality of the program modules may be combined or divided among the described program modules.
  • Machine-executable instructions for program modules may be executed within local or distributed devices. In a distributed facility, program modules may be located in both local and remote storage media.
  • Computer program code for implementing the methods of the embodiments of the present application may be written in one or more programming languages. Such computer program code may be provided to a processor of a general purpose computer, special purpose computer or other programmable data processing apparatus such that the program code, when executed by the computer or other programmable data processing apparatus, causes the flowchart and/or block diagrams The functions/operations specified in are implemented.
  • the program code may execute entirely on the computer, partly on the computer, as a stand-alone software package, partly on the computer and partly on a remote computer or entirely on the remote computer or server.
  • computer program code or related data may be carried by any suitable carrier to enable a device, apparatus or processor to perform the various processes and operations described above.
  • suitable carriers include signals, computer-readable media, and the like.
  • Examples of signals may include electrical, optical, radio, acoustic, or other forms of propagated signals, such as carrier waves, infrared signals, and the like.
  • a machine-readable medium may be any tangible medium that contains or stores a program for or in connection with an instruction execution system, apparatus, or device.
  • the machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium.
  • Machine-readable media may include, but are not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or devices, or any suitable combination thereof. More detailed examples of machine-readable storage media include electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable programmable read only Memory (EPROM or flash memory), optical storage devices, magnetic storage devices, or any suitable combination thereof.
  • the disclosed systems, devices and methods may be implemented in other manners.
  • the device embodiments described above are only illustrative.
  • the division of the modules is only a logical function division. In actual implementation, there may be other division methods.
  • multiple modules or components may be combined or Integration into another system, or some features can be ignored, or not implemented.
  • the shown or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or modules, and may also be electrical, mechanical or other forms of connection.
  • modules described as separate components may or may not be physically separated, and the components shown as modules may or may not be physical modules, that is, may be located in one place, or may be distributed to multiple network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solutions of the embodiments of the present application.
  • each functional module in each embodiment of the present application may be integrated into one processing module, or each module may exist physically alone, or two or more modules may be integrated into one module.
  • the above-mentioned integrated modules can be implemented in the form of hardware, and can also be implemented in the form of software function modules.
  • the integrated modules if implemented in the form of software functional modules and sold or used as separate products, can be stored in a computer-readable storage medium.
  • the technical solutions of the present application are essentially or part of contributions to the prior art, or all or part of the technical solutions can be embodied in the form of software products, and the computer software products are stored in a storage medium , including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods in the various embodiments of the present application.
  • the aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk and other media that can store program codes .
  • first, second and other words are used to distinguish the same or similar items with basically the same function and function, and it should be understood that between “first”, “second” and “nth” There are no logical or timing dependencies, and no restrictions on the number and execution order. It will also be understood that, although the following description uses the terms first, second, etc. to describe various elements, these elements should not be limited by the terms. These terms are only used to distinguish one element from another. For example, a first image may be referred to as a second image, and, similarly, a second image may be referred to as a first image, without departing from the scope of various described examples. Both the first image and the second image may be images, and in some cases, may be separate and distinct images.
  • the size of the sequence number of each process does not mean the sequence of execution, and the execution sequence of each process should be determined by its function and internal logic, and should not be used in the embodiment of the present application. Implementation constitutes any limitation.
  • the meaning of the term “at least one” refers to one or more, and the meaning of the term “plurality” in this application refers to two or more.
  • a plurality of second messages refers to two or more more than one second message.
  • system and “network” are often used interchangeably herein.
  • determining B according to A does not mean that B is only determined according to A, and B may also be determined according to A and/or other information.
  • references throughout the specification to "one embodiment,” “an embodiment,” and “one possible implementation” mean that a particular feature, structure, or characteristic associated with the embodiment or implementation is included herein. in at least one embodiment of the application. Thus, appearances of "in one embodiment” or “in an embodiment” or “one possible implementation” in various places throughout this specification are not necessarily necessarily referring to the same embodiment. Furthermore, the particular features, structures or characteristics may be combined in any suitable manner in one or more embodiments.

Landscapes

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

Abstract

本申请公开了生成路由信息、发送位置信息及转发报文的方法及设备，包括第一网络设备接收第二网络设备发送的位置信息，该位置信息包括用于标识第二网络设备在网络中的位置的位置标识及与该位置标识对应的多个关联灵活算法。第一网络设备基于多个关联灵活算法中的一个第一灵活算法生成到达第二网络设备的第一路由信息，第一灵活算法与第一网络拓扑对应，第一网络拓扑是第一网络设备所在的网络拓扑，第一路由信息用于在第一网络拓扑内向第二网络设备发送报文。通过一个位置标识对应多个关联灵活算法，基于不同的关联灵活算法生成不同网络拓扑内的路由信息，相较于一个位置标识携带一个灵活算法的情况，不仅降低了地址空间，还节约了网络资源。

Description

生成路由信息、发送位置信息及转发报文的方法及设备
本申请要求于2020年08月31日提交的申请号为202010901424.0、发明名称为“生成路由信息、发送位置信息及转发报文的方法及设备”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，特别涉及生成路由信息、发送位置信息及转发报文的方法及设备。
背景技术
随着通信技术的发展，为了满足日益增多的业务需求，按需组网的网络切片技术应运而生。网络切片，本质上是将运营商的物理网络划分为多个虚拟网络，每一个虚拟网络对应一个网络拓扑，且根据不同的服务需求，比如时延、带宽、安全性和可靠性等来划分，以灵活的应对不同的网络应用场景。如何进行网络切片，以定义出一个虚拟网络，流量如何在这个虚拟网络对应的网络拓扑内进行路由以及如何在该网络拓扑内进行报文转发，是满足业务需求的关键。
相关技术中，通过使用灵活算法(flexible algorithm，flex-algo)的算法标识(identification，ID)及其一系列约束条件对网络拓扑划分并进行路由计算来实现虚拟网络切换，且每个灵活算法都需要一个单独的位置标识(locator)，也即是locator与灵活算法绑定发布，一个locator只对应一个灵活算法。
当需要基于灵活算法对网络进行大量拓扑划分时，将需要大量的locator前缀，会耗费大量互联网协议第6版(internet protocol version 6，IPv6)地址前缀空间及网络资源。
发明内容
本申请实施例提供了一种生成路由信息、发送位置信息及转发报文的方法及设备，以解决相关技术提供的问题，技术方案如下：
第一方面，提供了一种生成路由信息的方法，以第一网络设备执行该方法为例，第一网络设备接收第二网络设备发送的位置信息，该位置信息包括位置标识以及与该位置标识对应的多个关联灵活算法，其中，位置标识用于标识第二网络设备在网络中的位置。第一网络设备基于第一灵活算法生成到达第二网络设备的第一路由信息，第一灵活算法是多个关联灵活算法中的一个，且第一灵活算法与第一网络拓扑对应，该第一网络拓扑是第一网络设备所在的网络拓扑，第一路由信息用于在第一网络拓扑内向第二网络设备发送报文。
通过将一个位置标识以及对应的多个关联灵活算法包括在位置信息发送给第一网络设备，由第一网络设备基于不同的关联灵活算法来生成不同的网络拓扑内的路由信息，相较于一个位置标识携带一个灵活算法的情况，在生成路由信息的过程中，不仅降低了地址空间，还节约了网络资源。
在一种可能的实现方式中，多个关联灵活算法还包括第二灵活算法，第一网络设备基于第二灵活算法生成到达第二网络设备的第二路由信息，第二路由信息与第二网络拓扑对应，第二网络拓扑是第一网络设备所在的网络拓扑，第二路由信息用于在第二网络拓扑内向第二网络设备发送报文。
在一种可能的实现方式中，第一路由信息与第一网络拓扑的标识对应。通过第一路由信息与第一网络拓扑的标识对应，能够实现同一网络拓扑内的路由信息对应同一个网络拓扑的标识。
在一种可能的实现方式中，第一路由信息包括第一网络拓扑的标识。由于第一网络拓扑的标识包括在第一路由信息中，因而各个网络拓扑的路由信息即使在一张转发表中也仍然能够进行区分，节省转发表的空间。
第二方面，提供了一种发送位置信息的方法，以第二网络设备执行该方法为例，第二网络设备向第一网络设备发送位置信息，该位置信息包括位置标识以及与该位置标识对应的多个关联灵活算法，其中，位置标识用于标识第二网络设备在网络中的位置，多个关联灵活算法中的第一灵活算法用于第一网络设备生成到达第二网络设备的第一路由信息，第一灵活算法与第一网络拓扑对应，第一网络拓扑是第一网络设备所在的网络拓扑，第一路由信息用于第一网络设备在第一网络拓扑内向第二网络设备发送报文。
由于多个灵活算法携带在一个位置标识的结构下，因而相对于一个网络设备支持多个灵活算法，但一个位置标识仅携带一个灵活算法，需要多个位置标识才能携带多个灵活算法的情况，将多个灵活算法携带在一个位置标识封装在位置信息中发送，能够降低地址空间，并且还能够降低占用的报文空间，节省网络的带宽资源。
在一种可能的实现方式中，多个关联灵活算法还包括第二灵活算法，第二灵活算法用于第一网络设备生成到达第二网络设备的第二路由信息，第二路由信息与第二网络拓扑对应，第二网络拓扑是第一网络设备所在的网络拓扑，第二路由信息用于在第二网络拓扑内向第二网络设备发送报文。
第三方面，提供了一种转发报文的方法，以第一网络设备执行该方法为例，第一网络设备获取第一报文，与第一报文匹配的网络拓扑为第一网络拓扑，第一网络拓扑是第一网络设备所在的网络拓扑。之后，第一网络设备根据第一网络拓扑确定第一路由信息，第一路由信息用于在第一网络拓扑内发送第一报文；第一网络设备根据第一路由信息发送第一报文。
由于一个位置标识以及对应的多个关联灵活算法包括在位置信息，由第一网络设备基于不同的关联灵活算法来生成不同网络拓扑内的路由信息，不仅在生成路由信息的过程中降低了IPv6的地址空间，节约了网络资源。在此基础上，获取到第一报文后，通过根据与第一报文匹配的第一网络拓扑来确定用于转发第一报文的第一路由信息，从而在第一网络拓扑内发送第一报文，实现了基于网络拓扑转发报文的方式。
在第三方面的第一种可能的实现方式中，第一网络设备获取第一报文，包括：第一网络设备获取第二报文；第一网络设备在第二报文中添加第一网络拓扑的标识，以得到第一报文。该实现方式的执行主体可以是网络拓扑中的头节点，通过在第二报文中添加第一网络拓扑的标识，使得接收到该第一报文的网络设备能够根据第一网络拓扑的标识确定与第一报文匹配的网络设备为第一网络设备，从而确定出对应的路由信息。
在第三方面的第二种可能的实现方式中，第一网络设备在第二报文中添加第一网络拓扑 的标识，以得到第一报文，包括：第一网络设备在第二报文的逐跳HBH字段中添加第一网络拓扑的标识，以得到第一报文。
在第三方面的第三种可能的实现方式中，第一网络设备在第二报文中添加第一网络拓扑的标识，以得到第一报文，包括：第一网络设备在第二报文的段标识列表中添加包括第一网络拓扑的标识的段标识，以得到第一报文。
在第三方面的第四种可能的实现方式中，第一网络设备在第二报文中添加第一网络拓扑的标识，以得到第一报文，包括：第一网络设备在第二报文中添加第一网络拓扑的标识以及第一资源的标识，以得到第一报文，第一资源为第一网络拓扑内的资源，第一资源的标识用于指示利用第一资源在第一网络拓扑内发送第一报文。
在第三方面的第五种可能的实现方式中，所述第一网络设备在所述第二报文中添加所述第一网络拓扑的标识，以得到所述第一报文，包括：所述第一网络设备根据所述第二报文的目的地址确定与所述第二报文匹配的灵活算法为第一灵活算法，所述第一灵活算法与所述第一网络拓扑对应，所述第一网络设备确定与所述第二报文匹配的网络拓扑为所述第一网络拓扑；或者，所述第一网络设备确定所述第二报文的目的地址匹配指定目的地址，所述指定目的地址与所述第一网络拓扑匹配，所述第一网络设备确定与所述第二报文匹配的网络拓扑为所述第一网络拓扑。网络拓扑中的头节点根据报文中的目的地址确定报文对应的网络拓扑的标识，进而将该网络拓扑的标识添加在报文中，以便于中间节点从报文中获取该网络拓扑的标识。
在第三方面的第六种可能的实现方式中，第一网络设备获取第一报文，包括：第一网络设备接收第一报文；第一网络设备确定与第一报文匹配的网络拓扑为第一网络拓扑。该实现方式的执行主体可以是网络拓扑中的中间节点，中间节点接收第一报文后，确定第一报文匹配的网络拓扑，进而根据网络拓扑确定第一报文对应的路由信息。
在第三方面的第七种可能的实现方式中，第一网络设备确定与第一报文匹配的网络拓扑为第一网络拓扑，包括：第一网络设备根据第一报文的目的地址确定与第一报文匹配的灵活算法为第一灵活算法，第一灵活算法与第一网络拓扑对应，第一网络设备确定与第一报文匹配的网络拓扑为第一网络拓扑；或者，第一网络设备确定第一报文的目的地址匹配指定目的地址，指定目的地址与第一网络拓扑匹配，第一网络设备确定与第一报文匹配的网络拓扑为第一网络拓扑。
在第三方面的第八种可能的实现方式中，第一报文包括第一网络拓扑的标识；第一网络设备确定与第一报文匹配的网络拓扑为第一网络拓扑，包括：第一网络设备根据第一报文中包括的第一网络拓扑的标识，确定与第一报文匹配的网络拓扑为第一网络拓扑。该实现方式的执行主体可以是网络拓扑中的中间节点，在网络拓扑中的头节点已经在报文中添加网络拓扑的标识的情况下，中间节点接收第一报文后，读取第一报文中的网络拓扑的标识，从而确定第一报文匹配的网络拓扑。
在第三方面的第九种可能的实现方式中，第一报文还包括第一资源的标识，第一资源为第一网络拓扑内的资源；第一网络设备根据第一路由信息发送第一报文，包括：第一网络设备根据第一路由信息，并利用第一资源，在第一网络拓扑内发送第一报文。
在第三方面的第十种可能的实现方式中，第一路由信息与第一网络拓扑的标识对应；第一网络设备根据第一网络拓扑确定第一路由信息，包括：第一网络设备根据第一路由信息与 第一网络拓扑的标识的对应关系，确定第一路由信息。
在第三方面的第十一种可能的实现方式中，第一网络拓扑的标识包括在第一路由信息内；第一网络设备根据第一网络拓扑确定第一路由信息，包括：第一网络设备根据第一路由信息中包括的第一网络拓扑的标识，确定第一路由信息。
第四方面，提供了一种生成路由信息的装置，该装置包括：
接收模块，用于接收第二网络设备发送的位置信息，位置信息包括位置标识以及与位置标识对应的多个关联灵活算法，位置标识用于标识第二网络设备在网络中的位置；
生成模块，用于基于第一灵活算法生成到达第二网络设备的第一路由信息，第一灵活算法是多个关联灵活算法中的一个，第一灵活算法与第一网络拓扑对应，第一网络拓扑是生成路由信息的装置所在的网络拓扑，第一路由信息用于在第一网络拓扑内向第二网络设备发送报文。
在一种可能的实现方式中，多个关联灵活算法还包括第二灵活算法，生成模块，还用于基于第二灵活算法生成到达第二网络设备的第二路由信息，第二路由信息与第二网络拓扑对应，第二网络拓扑是生成路由信息的装置所在的网络拓扑，第二路由信息用于在第二网络拓扑内向第二网络设备发送报文。
在一种可能的实现方式中，第一路由信息与第一网络拓扑的标识对应。
在一种可能的实现方式中，第一路由信息包括第一网络拓扑的标识。
第五方面，提供了一种发送位置信息的装置，该装置包括：
发送模块，用于向第一网络设备发送位置信息，位置信息包括位置标识以及与位置标识对应的多个关联灵活算法，位置标识用于标识发送位置信息的装置在网络中的位置，多个关联灵活算法中的第一灵活算法用于第一网络设备生成到达第二网络设备的第一路由信息，第一灵活算法与第一网络拓扑对应，第一网络拓扑是第一网络设备所在的网络拓扑，第一路由信息用于第一网络设备在第一网络拓扑内向发送位置信息的装置发送报文。
在一种可能的实现方式中，多个关联灵活算法还包括第二灵活算法，第二灵活算法用于第一网络设备生成到达发送位置信息的装置的第二路由信息，第二路由信息与第二网络拓扑对应，第二网络拓扑是第一网络设备所在的网络拓扑，第二路由信息用于在第二网络拓扑内向发送位置信息的装置发送报文。
第六方面，提供了一种转发报文的装置，该装置包括：
获取模块，用于获取第一报文，与第一报文匹配的网络拓扑为第一网络拓扑，第一网络拓扑是转发报文的装置所在的网络拓扑；
确定模块，用于根据第一网络拓扑确定第一路由信息，第一路由信息用于在第一网络拓扑内发送第一报文；
发送模块，用于根据第一路由信息发送第一报文。
在一种可能的实现方式中，获取模块，用于获取第二报文；在第二报文中添加第一网络拓扑的标识，以得到第一报文。
在一种可能的实现方式中，获取模块，用于在第二报文的逐跳HBH字段中添加第一网络拓扑的标识，以得到第一报文。
在一种可能的实现方式中，获取模块，用于在第二报文的段标识列表中添加包括第一网络拓扑的标识的段标识，以得到第一报文。
在一种可能的实现方式中，获取模块，用于在第二报文中添加第一网络拓扑的标识以及第一资源的标识，以得到第一报文，第一资源为第一网络拓扑内的资源，第一资源的标识用于指示利用第一资源在第一网络拓扑内发送第一报文。
在一种可能的实现方式中，获取模块，用于根据第二报文的目的地址确定与第二报文匹配的灵活算法为第一灵活算法，第一灵活算法与第一网络拓扑对应；确定与第二报文匹配的网络拓扑为第一网络拓扑；或者，确定第二报文的目的地址匹配指定目的地址，指定目的地址与第一网络拓扑匹配，确定与第二报文匹配的网络拓扑为第一网络拓扑。
在一种可能的实现方式中，获取模块，用于接收第一报文；确定与第一报文匹配的网络拓扑为第一网络拓扑。
在一种可能的实现方式中，确定模块，用于根据第一报文的目的地址确定与第一报文匹配的灵活算法为第一灵活算法，第一灵活算法与第一网络拓扑对应，确定与第一报文匹配的网络拓扑为第一网络拓扑；
或者，确定第一报文的目的地址匹配指定目的地址，指定目的地址与第一网络拓扑匹配，确定与第一报文匹配的网络拓扑为第一网络拓扑。
在一种可能的实现方式中，第一报文包括第一网络拓扑的标识；确定模块，用于根据第一报文中包括的第一网络拓扑的标识，确定与第一报文匹配的网络拓扑为第一网络拓扑。
在一种可能的实现方式中，第一报文还包括第一资源的标识，第一资源为第一网络拓扑内的资源；
发送模块，用于根据第一路由信息，并利用第一资源，在第一网络拓扑内发送第一报文。
在一种可能的实现方式中，第一路由信息与第一网络拓扑的标识对应；
确定模块，用于根据第一路由信息与第一网络拓扑的标识的对应关系，确定第一路由信息。
在一种可能的实现方式中，第一网络拓扑的标识包括在第一路由信息内；
确定模块，用于根据第一路由信息中包括的第一网络拓扑的标识，确定第一路由信息。
第七方面，提供了一种网络设备，该网络设备包括：
存储器及处理器，存储器中存储有至少一条指令，至少一条指令由处理器加载并执行，以实现第一方面及任一实现方式中的生成路由信息的方法，或者，实现第二方面及任一实现方式中的发送位置信息的方法，或者，实现第三方面及任一实现方式中的转发报文的方法。
第八方面，提供了一种通信系统，该通信系统包括第一网络设备和第二网络设备，第一网络设备用于执行第一方面及任一实现方式中的生成路由信息的方法；第二网络设备用于执行第三方面及任一实现方式中的发送位置信息的方法。
第九方面，提供了一种通信系统，该通信系统包括第一网络设备和第二网络设备，第一网络设备用于执行第三方面、第三方面的第一种至第五种实现方式中的任一实现方式中的转发报文的方法；第二网络设备用于执行第三方面、第三方面的第六种至第十一种实现方式中的任一实现方式中的转发报文的方法。
第十方面，提供了一种计算机可读存储介质，存储介质中存储有至少一条指令，指令由处理器加载并执行以实现第一方面及任一实现方式中的生成路由信息的方法，或者，实现第二方面及任一实现方式中的发送位置信息的方法，或者，实现第三方面及任一实现方式中的转发报文的方法。
提供了另一种通信装置，该装置包括：收发器、存储器和处理器。其中，该收发器、该存储器和该处理器通过内部连接通路互相通信，该存储器用于存储指令，该处理器用于执行该存储器存储的指令，以控制收发器接收信号，并控制收发器发送信号，并且当该处理器执行该存储器存储的指令时，使得该处理器执行第一方面至第三方面或第一方面至第三方面的任一种可能的实施方式中的方法。
作为一种示例性实施例，处理器为一个或多个，存储器为一个或多个。
作为一种示例性实施例，存储器可以与处理器集成在一起，或者存储器与处理器分离设置。
在具体实现过程中，存储器可以为非瞬时性(non-transitory)存储器，例如只读存储器(read only memory，ROM)，其可以与处理器集成在同一块芯片上，也可以分别设置在不同的芯片上，本申请实施例对存储器的类型以及存储器与处理器的设置方式不做限定。
提供了一种计算机程序(产品)，计算机程序(产品)包括：计算机程序代码，当计算机程序代码被计算机运行时，使得计算机执行上述各方面中的方法。
提供了一种芯片，包括处理器，用于从存储器中调用并运行存储器中存储的指令，使得安装有芯片的通信设备执行上述各方面中的方法。
提供另一种芯片，包括：输入接口、输出接口、处理器和存储器，所述输入接口、输出接口、所述处理器以及所述存储器之间通过内部连接通路相连，所述处理器用于执行所述存储器中的代码，当所述代码被执行时，所述处理器用于执行上述各方面中的方法。
附图说明
图1为相关技术提供的系统架构示意图；
图2为相关技术提供的位置标识的结构示意图；
图3为本申请实施例提供的系统架构示意图；
图4为本申请实施例提供的发送位置信息的方法以及生成路由信息的方法流程示意图；
图5为本申请实施例提供的位置标识及END.X的结构示意图；
图6为本申请实施例提供的路由信息的生成过程示意图；
图7为本申请实施例提供的路由信息的生成过程示意图；
图8为本申请实施例提供的转发报文的方法流程示意图；
图9为本申请实施例提供的报文转发过程示意图；
图10为本申请实施例提供的获取第一报文的过程示意图；
图11为本申请实施例提供的生成路由信息的装置结构示意图；
图12为本申请实施例提供的发送位置信息的装置结构示意图；
图13为本申请实施例提供的转发报文的装置结构示意图；
图14为本申请实施例提供的网络设备的结构示意图；
图15为本申请实施例提供的网络设备的结构示意图。
具体实施方式
本申请的实施方式部分使用的术语仅用于对本申请的实施例进行解释，而非旨在限定本申请。
随着业务需求和应用场景逐渐多样化，网络切片技术逐渐被广泛应用。网络切片技术通过将运营商的物理网络划分为多个虚拟网络，每一个虚拟网络对应一个网络拓扑，且根据不同的服务需求，比如时延、带宽、安全性和可靠性等来划分，以灵活的应对不同的网络应用场景。
以基于IPv6转发平面的段路由(segment routing IPv6，SRv6)场景为例，相关技术提供了一种使用算法标识(identity，ID)及其一系列约束条件对网络拓扑划分并进行路由计算的方法。其中，SRv6是基于源路由理念而设计的在网络上转发IPv6数据包的一种协议。SRv6通过在IPv6报文中插入一个路由扩展头(segment routing header，SRH)，在SRH中压入一个显式的IPv6地址栈，通过中间节点不断的进行更新目的地址和偏移地址栈的操作来完成逐跳转发。
以图1所示的系统架构为例，该系统架构包括节点0至节点9等网络设备，节点0、1、2、3、4和9参与灵活算法128的路由计算，节点0、5、6、7、8和9参与灵活算法129的路由计算。以节点0为第一网络设备，节点9为第二网络设备为例，节点9上发布两个位置标识(locator)，一个是基于灵活算法128的4::/64 locator，另一个是基于灵活算法129的3::/64 locator。
当节点0计算到4::/64 locator的路由信息时，会根据灵活算法128所划定的节点及链路内按照最短路径优先(shortest path first，SPF)算法或者严格SPF(Strict-SPF)算法计算路由信息。例如，基于图1所示的系统，到达4::/64 locator的路径是0→1→2→4→9。同理，当节点0计算到3::/64 locator的路由信息时，到达3::/64 locator的路径是0→5→6→8→9。
由于相关技术提供的生成路由信息的方法中，每个算法都需要一个单独的locator，在内部网关协议(interior gateway protocols，IGP)对于SRv6协议的扩展中，以中间系统到中间系统(intermediate system to intermediate system，ISIS)为例，locator结构如图2所示。按照图2所示的locator的定义，当需要基于flex-algo对网络进行大量拓扑划分时，将需要大量的Locator前缀，会耗费大量IPv6地址前缀空间，同时也增加了复杂度。
另外，节点的结束(END)段标识(segment identifier，SID)和链路END.X SID是基于locator分配的，当存在大量的locator时，也会分配出大量的END SID和END.X。由于这些locator，END SID和END.X SID都会封装在ISIS标记交换路径(label switching path，LSP)报文中，从而占用大量的报文空间，同时该LSP也会在网络中泛洪，导致会浪费网络的带宽资源。
对此，本申请实施例提供了一种发送位置信息的方法以及生成路由信息的方法，该方法通过配置网络切片与网络拓扑的对应关系，实现一个locator可以携带多个flex-algo，从而避免浪费IPv6地址空间及网络资源。以该方法应用于图3所示的系统架构为例，在边缘设备(provider edge，PE)2上面同一个locator1::1/64能够携带多个flex-algo，分别是算法ID为128、129、130及0的灵活算法。其中，算法ID为0的灵活算法为默认的算法。在发送位置信息的方法中，PE2将该locator及该locator对应的flex-algo信息封装在ISIS LSP报文，在网络中泛洪，使各个节点都有PE2上该locator的信息。
如图3所示，节点PE1、PE2参与算法ID为128、129和130的灵活算法，节点P1、P2和P3参与算法ID为128的灵活算法，节点P4、P5和P6参与算法ID为129的灵活算法，节点P7、P8和P9参与算法ID为130的灵活算法。因此，在生成路由信息时，节点PE1、P1、P2、P3和PE2能够基于算法ID为128和0的灵活算法计算到locator 1::1/64的路由信息。例如，在算法ID为128和0的灵活算法对应的网络拓扑内分别生成1::1/64的单播路由。同理，节点PE1、P4、P5、P6 和PE2在算法ID为129和0的灵活算法对应的网络拓扑内分别生成1::1/64的单播路由；节点PE1、P7、P8、P9和PE2在算法ID为130和0的灵活算法对应的拓扑内分别生成1::1/64的单播路由。
接下来，以图3所示的系统架构为例，对本申请实施例提供的发送位置信息的方法以及生成路由信息的方法进行举例说明。参见图4，本申请实施例提供的发送位置信息的方法包括如下过程。
401，第二网络设备向第一网络设备发送位置信息，该位置信息包括位置标识以及与位置标识对应的多个关联灵活算法，位置标识用于标识第二网络设备在网络中的位置。
在示例性实施例中，第二网络设备被分配locator之后，可将locator及与该locator对应的灵活算法携带在ISIS LSP报文内在网络中泛洪，实现第二网络设备向第一网络设备发送位置信息。在本申请实施例中，同一个locator可使用多个灵活算法在网络中扩展对应的位置信息。因此，第二网络设备支持多个灵活算法时，该多个灵活算法可作为关联灵活算法与locator一起被携带在ISIS LSP报文中在网络中泛洪。第二网络设备向第一网络设备发送的该位置信息包括位置标识及与位置标识对应的多个关联灵活算法，其中，位置标识用于标识第二网络设备在网络中的位置。
本申请实施例不对位置信息中与位置标识对应的关联灵活算法的数量进行限定，可基于应用场景限定。如果第二网络设备支持的灵活算法较多，该多个灵活算法可全部对应于一个locator，也可以一部分灵活算法对应一个locator，剩余部分灵活算法对应另一个locator。在locator数量少于灵活算法的数量的情况下，相较于一个locator对应于一个灵活算法的情况仍然能够达到节省空间及网络资源的目的。
在本申请示例性实施例中，针对一个locator对应多个灵活算法的情况，在图2所示的locator的结构基础上，可在locator的TLV字段内新增算法子TLV，将多个灵活算法以子TLV形式携带在locator的TLV字段下。此外，生成END SID或END.X SID时，也同样可在locator的TLV字段内新增算法子TLV，将多个灵活算法以子TLV形式携带在locator的TLV字段下。
例如，本申请实施例提供的locator的结构以及END.X SID的结构可如图5所示。从图5中不难看出，由于多个灵活算法携带在一个locator的结构下，因而相对于一个网络设备支持多个灵活算法，但一个locator仅携带一个灵活算法，需要多个locator才能携带多个灵活算法的情况，将多个灵活算法携带在一个locator封装在ISIS LSP报文中，本申请实施例提供的方法能够降低占用的报文空间。且在ISIS LSP报文泛洪时，还可进一步节省网络的带宽资源。
基于图4所示的401中发送位置信息的方法，参见图4，本申请实施例提供的生成路由信息的方法包括如下几个过程。
402，第一网络设备接收第二网络设备发送的位置信息，该位置信息包括位置标识以及与位置标识对应的多个关联灵活算法，位置标识用于标识第二网络设备在网络中的位置。
示例性地，第一网络设备通过接收第二网络设备在网络中泛洪的ISIS LSP报文，得到第二网络设备发送的位置信息。
以图3所示的系统架构为例，第二网络设备为节点PE2，第一网络设备为节点PE1、P1、P2、P3、P4、P5、P6、P7、P8、P9。节点PE2将locator 1::1/64及该locator 1::1/64对应的flex-algo128、129和130的灵活算法封装在ISIS LSP报文，在网络中泛洪。节点PE1、P1、P2、P3、P4、P5、P6、P7、P8、P9均能够接收到包括locator 1::1/64及该locator 1::1/64对应的flex-algo128、129和130的灵活算法的位置信息。
403，第一网络设备基于第一灵活算法生成到达第二网络设备的第一路由信息，该第一灵活算法是多个关联灵活算法中的一个，第一灵活算法与第一网络拓扑对应，第一网络拓扑是第一网络设备所在的网络拓扑。
其中，第一路由信息用于在第一网络拓扑内向第二网络设备发送报文。由于多个关联灵活算法中的每个关联灵活算法对应一个网络拓扑，第一网络设备确定第一网络设备所在的网络拓扑对应的灵活算法，也即是确定出第一灵活算法，从而基于该第一灵活算法生成到达第二网络设备的第一路由信息。
需要说明的是，如果第一网络设备在多个网络拓扑内，一个灵活算法对应一个第一网络设备所在的网络拓扑，多个关联灵活算法除了包括第一灵活算法，还包括第二灵活算法。第一网络设备除了基于第一网络拓扑对应的第一灵活算法生成到达第二网络设备的第一路由信息之外，第一网络设备还基于第二灵活算法生成到达第二网络设备的第二路由信息，第二路由信息与第二网络拓扑对应，第二网络拓扑是第一网络设备所在的网络拓扑，第二路由信息用于在第二网络拓扑内向第二网络设备发送报文。
以上仅以第一网络设备在第一灵活算法对应的第一网络拓扑以及第二灵活算法对应的第二网络拓扑内为例，并不限制本申请实施例所提供的方法，除此之外，第一网络设备还可以在更多的网络拓扑内，生成路由信息的方法与本申请实施例中生成路由信息的方式相同，此处不再赘述。
仍以图3所示的系统架构为例，针对第一网络设备为节点PE1，节点PE1所在的网络拓扑对应算法ID为128、129和130的灵活算法，节点PE1分别基于算法ID为128、129和130的灵活算法生成到达第二网络设备的目标路由信息，从而能够得到三条目标路由信息。针对第一网络设备为节点P1，由于节点P1所在的网络拓扑对应算法ID为128的灵活算法，因而节点P1基于算法ID为128的灵活算法生成到达第二网络设备的目标路由信息，从而能够得到一条路由信息。由于节点P2和P3与节点P1同在一个网络拓扑，因而节点P2和P3同P1一样基于算法ID为128的灵活算法生成到达第二网络设备的目标路由信息。对于在同一网络拓扑的节点P4、P5和P6，均基于算法ID为129的灵活算法生成到达第二网络设备的目标路由信息。对于在同一网络拓扑的节点P7、P8和P9，均基于算法ID为130的灵活算法生成到达第二网络设备的目标路由信息。
关于第一网络设备基于第一灵活算法生成到达第二网络设备的第一路由信息的方式，本申请实施例不进行限定。由于一个locator对应多个灵活算法，为了后续能够基于计算出的目标路由信息在所在的网络拓扑内向第二网络设备发送报文，本申请实施例提供的方法将网络拓扑与网络切片进行了关联。对此，计算得到的第一路由信息包括但不限于如下两种情况。
情况一：第一路由信息与第一网络拓扑的标识对应。
在情况一中，该第一路由信息包括但不限于前缀、下一跳(next-hop)、出接口(interface)以及代价(cost)，通过将第一路由信息与第一网络拓扑的标识对应，实现网络切片与第一网络拓扑进行关联。针对同一网络拓扑的多条路由信息，该同一网络拓扑的多条路由信息对应同一个网络拓扑的标识。例如，可将该多条路由信息放在同一张转发表内，并为该转发表设置表ID，该表ID即为该网络拓扑的ID，由此实现同一网络拓扑内的路由信息对应同一个网络拓扑的标识。示例性地，网络拓扑的标识可与该网络拓扑对应的灵活算法的ID一致。
以图6所示的生成路由信息的过程为例，网络被划分为基于时延(delay)度量(metric)的FlexAlgo 128的拓扑以及基于内部网关协议(interior gateway protocol，IGP)度量(metric) 的FlexAlgo 129的拓扑。针对FlexAlgo 128的拓扑中的一条路由信息A8::/64 next-hop:xxx，interface:intf1，cost:75，前缀为A8::/64，下一跳(next-hop)地址为xxx，出接口(interface)为intf1，代价(cost)为75。如图6所示，FlexAlgo 128的拓扑所对应的路由信息A8::/64 next-hop:xxx，interface:intf1，cost:75以及路由信息A7::/64 next-hop:xxx，interface:intf1，cost:60在同一张转发表中，且该表(table)ID为128。
在示例性实施例中，针对同一网络拓扑的多条路由信息，还可以每条路由信息对应一个网络拓扑的标识，通过网络拓扑的标识与路由信息的一对一关系来实现同一网络拓扑内的路由信息对应相同的网络拓扑的标识。
情况二：第一路由信息包括第一网络拓扑的标识。
在情况二中，第一路由信息包括但不限于前缀、下一跳(next-hop)、出接口(interface)以及代价(cost)，与情况一中的第一路由信息不同的是，该情况二中的第一路由信息中的前缀是将原前缀与第一网络拓扑的标识进行编码得到，也即第一网络拓扑的标识在第一路由信息内，由此实现网络切片与目标网络拓扑进行关联。由于第一网络拓扑的标识包括在第一路由信息中，因而各个网络拓扑的路由信息即使在一张转发表中也仍然能够进行区分。
以图7所示的生成路由信息的过程为例，网络被划分为基于delay metric的FlexAlgo 128的拓扑以及基于IGP metric的FlexAlgo 129的拓扑。针对FlexAlgo 128的拓扑中的一条路由信息A8:0:0:80/64 next-hop:xxx，interface:intf1，cost:75，前缀为A8:0:0:80/64，该前缀为A8:0:0:80/64是经过原前缀A8::/64与网络拓扑的标识编码得到的，下一跳(next-hop)地址为xxx，出接口(interface)为intf1，代价(cost)为75。由于各个网络拓扑的标识包括在对应的路由信息中，因而FlexAlgo 128的拓扑中的一条路由信息A8:0:0:80/64 next-hop:xxx，interface:intf1，cost:75与FlexAlgo 129的拓扑中的一条路由信息A8:0:0:81/64 next-hop:xxx，interface:intf1，cost:60即使在一张转发表中，通过A8:0:0:80和A8:0:0:81的不同也仍然能够进行区分。
在示例性实施例中，第一路由信息还包括与第一网络拓扑对应的第一资源的标识，第一资源的标识与第一资源的接口对应。
需要说明的是，生成第二路由信息的方式与生成第一路由信息的方式相同，可参考上述生成第一路由信息的方式。例如，第二路由信息与第二网络拓扑的标识对应。或者，第二路由信息包括第二网络拓扑的标识。此外，在示例性实施例中，该第二路由信息也还包括与第二网络拓扑对应的第二资源标识，第二资源标识与第二资源的接口对应。
综上所述，通过将一个locator以及对应的多个关联灵活算法包括在位置信息发送给第一网络设备，由第一网络设备基于所在网络拓扑对应的关联灵活算法来生成路由信息，相较于一个locator携带一个灵活算法的情况，在生成路由信息的过程中，不仅降低了IPv6的地址空间，还节约了网络资源。
本申请实施例提供的生成路由信息的方法所得到的路由信息，可应用于转发报文的过程。参见图8，本申请实施例提供的转发报文的方法包括如下几个过程。
801，第一网络设备获取第一报文，与第一报文匹配的网络拓扑为第一网络拓扑，第一网络拓扑是第一网络设备所在的网络拓扑。
在示例性实施例中，第一网络设备获取第一报文，包括但不限于如下两种情况。
情况一：第一网络设备为发送报文的头节点设备。
由于第一网络设备为发送报文的头节点设备，因而获取到的报文不包括第一网络拓扑的标识，为了能够基于网络拓扑进行报文转发，第一网络设备获取第一报文，包括：第一网络设备获取第二报文，在第二报文中添加第一网络拓扑的标识，以得到第一报文。
示例性地，在第二报文中添加第一网络拓扑的标识，以得到第一报文，包括但不限于如下两种添加方式。
添加方式一：在第二报文的逐跳(hop-by-hop，HBH)字段中添加第一网络拓扑的标识，以得到第一报文。
针对该种添加方式一，在第一网络设备的报文入口处对第二报文打上HBH头，也即HBH字段，在HBH字段中添加对应的topo ID，通过在HBH字段中添加第一网络拓扑的标识，使得接收到第二报文的设备能够确定出第一网络拓扑，从而基于网络拓扑与路由信息的关系确定出第一报文的路由信息。
示例性地，第二报文包括以太网(ethernet，ETH)层、包括差分服务代码点(differentiated services code point，DSCP)的网际互连协议(internet protocol，IP)层、通用无线分组业务(general packet radio service，GPRS)隧道协议(GPRS tunneling protocol，GTP)层以及有效载荷(payload)层。可选地，第二报文还可包括虚拟局域网(virtual local area network，VLAN)层。
以图9所示的报文转发过程为例，在本申请实施例提供的方法支持locator携带多个灵活算法，也即多个灵活算法共用locator的情况下，能够基于灵活算法标识也即拓扑标识来查找对应的路由信息。例如，以通过图9所示的SRv6最大努力(best effort，BE)隧道转发报文为例，对于未支持locator共用的SRv6BE隧道，转发面在转发报文时，通过报文中的SID[B1::1]确定下一跳(Nexthop)为(2001::2)，出接口(outintf)为(Gi0/0/1)。
对于支持locator共用的SRv6BE隧道，转发面在转发报文时，通过报文中的SID[B1::1]以及网络拓扑(以FlexAlgo对应的拓扑为例)确定下一跳(Nexthop)为(2001::2)，出接口(outintf)为(Gi0/0/1)。因此，第一网络设备获取到第二报文后，在第二报文的IP层与ETH层之间添加了IPv6头(Head)以及包括了拓扑ID的HBH字段。其中，IPv6头包括版本(version11)字段、流量级别(traffic class)字段、流标签(Flow label)字段、有效载荷长度(payload length)字段、源地址(Source Address)字段、目的地址(Destination Address)字段等。在图9中，源地址为A1::1，目的地址为A2::11。为了在IPv6报文中实现SRv6转发，引入了ー个SRV6扩展头(Routing Type为4)SRH。如图9所示的SRv6的报文封装格式，SRH各个字段的含义如下。
Figure PCTCN2021113358-appb-000001
Figure PCTCN2021113358-appb-000002
需要说明的是，以上将第一网络拓扑的标识(topo-ID)添加在HBH里只是用于举例说明，但并不用于限制在第二报文中添加第一网络拓扑的标识的方式，也可采用其他添加方式，例如，在流标签(flowlabel)，基于超文本传输安全协议(hyper text transfer protocol over securesocket layer，HTTPS)的域名系统(domain name system，DNS)(DNS-over-HTTPS，DoH)，SRH中添加第一网络拓扑的标识。
添加方式二：在第二报文的段标识SID列表中添加包括第一网络拓扑的标识的段标识，以得到第一报文。
针对该种添加方式二，在第一网络设备的报文入口处不封装HBH头，也即不封装HBH字段，而在第二报文中的VPN SID后面扩展4个字节作为扩展位，将topoID填充到该扩展位。
示例性地，除了在第二报文中添加第一网络拓扑的标识，还在该第二报文中添加与第一网络拓扑对应的第一资源的标识。也即是在第二报文中添加第一网络拓扑的标识以及第一资源的标识，得到第一报文。其中，第一资源为第一网络拓扑内的资源，第一资源的标识用于指示利用第一资源在第一网络拓扑内发送第一报文。
例如，以图10所示的获取第一报文的过程为例，第二报文中包括以太网(ethernet，ETH)层、包括差分服务代码点(differentiated services code point，DSCP)的网际互连协议(internet protocol，IP)层、通用无线分组业务(general packet radio service，GPRS)隧道协议(GPRS tunneling protocol，GTP)层以及有效载荷(payload)层。第一网络设备接收到第二报文后，在第二报文的IP层与ETH层之间添加了SRv6BE的SID以及包括了拓扑ID的HBH字段。除此之外，还添加了资源标识，示例性地，该资源标识也添加在HBH字段中。例如，图10中的切片(Slice)ID。
在示例性实施例中，本申请实施例提供的方法在第二报文添加第一网络拓扑的标识之前，还需要确定与第二报文匹配的网络拓扑是第一网络拓扑，因此，第一网络设备在第二报文中添加第一网络拓扑的标识，以得到第一报文，包括：第一网络设备根据第二报文的目的地址确定与第二报文匹配的灵活算法为第一灵活算法，第一灵活算法与第一网络拓扑对应，第一网络设备确定与第二报文匹配的网络拓扑为第一网络拓扑；或者，第一网络设备确定第二报文的目的地址匹配指定目的地址，指定目的地址与第一网络拓扑匹配，第一网络设备确定与第二报文匹配的网络拓扑为第一网络拓扑。
例如，可提前指定与第一灵活算法对应的前缀及掩码，从而根据第二报文的目的地址得到第二报文对应的前缀及掩码后，确定第二报文对应的前缀及掩码是否是指定的前缀及掩码。如果是指定的前缀及掩码，确定与第二报文匹配的灵活算法为第一灵活算法，又由于第一灵活算法与第一网络拓扑对应，因而确定与第二报文匹配的网络拓扑为第一网络拓扑。例如，指定的前缀及掩码对应第一网络拓扑的标识，而第二报文的目的地址得到的第二报文对应的前缀为指定前缀，得到的掩码为指定掩码，从而第一网络拓扑的标识所对应的第一网络拓扑即为与第二报文匹配的网络拓扑。
情况二：第一网络设备为发送报文的中间节点设备。
由于第一网络设备为发送报文的中间节点设备，第一网络设备获取第一报文，包括：第 一网络设备接收第一报文，确定与第一报文匹配的网络拓扑为第一网络拓扑。通过确定与第一报文匹配的第一网络拓扑，进而基于网络拓扑与路由信息的关系来确定出第一报文的路由信息。
关于确定与第一报文匹配的第一网络拓扑的方式，本申请实施例不进行限定，例如，通过策略模糊匹配或者明确指定等方式实现。其中，策略模糊匹配指的是通过指定前缀及掩码匹配topoId，明确指定指的是指定目的匹配topoId方式。在示例性实施例中，确定与第一报文匹配的网络拓扑为第一网络拓扑，包括但不限于如下三种确定方式。
确定方式一：根据第一报文的目的地址确定与第一报文匹配的灵活算法为第一灵活算法，第一灵活算法与第一网络拓扑对应，第一网络设备根据第一灵活算法确定与第一报文匹配的网络拓扑为第一网络拓扑。
针对确定方式一，可提前指定与第一灵活算法对应的前缀及掩码，从而根据第一报文的目的地址得到第一报文对应的前缀及掩码后，确定第一报文对应的前缀及掩码是否是指定的前缀及掩码。如果是指定的前缀及掩码，确定与第一报文匹配的灵活算法为第一灵活算法，又由于第一灵活算法与第一网络拓扑对应，因而确定与第一报文匹配的网络拓扑为第一网络拓扑。例如，指定的前缀及掩码对应第一网络拓扑的标识，而第一报文的目的地址得到的第一报文对应的前缀为指定前缀，得到的掩码为指定掩码，从而第一网络拓扑的标识所对应的第一网络拓扑即为与第一报文匹配的网络拓扑。
确定方式二：第一网络设备确定第一报文的目的地址匹配指定目的地址，指定目的地址与第一网络拓扑匹配，第一网络设备确定与第一报文匹配的网络拓扑为第一网络拓扑。
针对确定方式二，可提前指定目的地址匹配哪个网络拓扑，因而确定出与第一报文的目的地址匹配的网络拓扑，得到与第一报文匹配的网络拓扑为第一网络拓扑。
确定方式三：第一报文包括第一网络拓扑的标识；根据第一报文中包括的第一网络拓扑的标识，确定与第一报文匹配的网络拓扑为第一网络拓扑。
针对确定方式三，由于第一报文包括第一网络拓扑的标识，因而可直接基于第一网络拓扑的标识，确定与第一报文匹配的网络拓扑为第一网络拓扑。该第一报文包括的第一网络拓扑的标识可以是头节点设备添加的。
802，第一网络设备根据第一网络拓扑确定第一报文的路由信息为第一路由信息，第一路由信息用于在第一网络拓扑内发送报文。
其中，第一路由信息基于第一灵活算法计算得到，第一灵活算法是多个关联灵活算法中的一个，多个关联灵活算法由第二网络设备发送的位置信息得到，位置信息包括位置标识以及与位置标识对应的多个关联灵活算法。示例性地，根据第一网络拓扑的标识确定第一报文的路由信息为第一路由信息之前，还包括：第一网络设备接收第二网络设备发送的位置信息；第一网络设备基于第一灵活算法生成到达第二网络设备的第一路由信息。
上述接收位置信息及计算第一路由信息的过程可参考上述图4所示的发送位置信息的方法和第一路由信息的生成过程，此处不再赘述。
确定出与第一报文匹配的网络拓扑为第一网络拓扑后，由于第一网络拓扑与第一路由信息存在关联关系，因而可根据第一网络拓扑确定第一报文的路由信息为第一路由信息。
803，第一网络设备根据第一路由信息发送第一报文。
如图4所示的生成第一路由信息的方式，该第一路由信息包括但不限于如下两种情况，针 对生成的第一路由信息的不同情况，第一网络设备根据第一路由信息发送第一报文也包括两种情况。
情况一：第一路由信息与第一网络拓扑的标识对应。
示例性地，第一网络设备根据第一路由信息发送第一报文，包括：第一网络设备根据第一网络拓扑的标识确定出第一路由信息，根据第一路由信息中的出接口转发第一报文。
例如，仍以图6所示的生成路由信息的过程为例，如果第一网络拓扑为FlexAlgo 128的拓扑，第一路由信息为针对FlexAlgo 128的拓扑中的一条路由信息A8::/64 next-hop:xxx，interface:intf1，cost:75。其中，该第一路由信息中的前缀为A8::/64，下一跳(next-hop)地址为xxx，出接口(interface)为intf1，代价(cost)为75。如图6所示，FlexAlgo 128的拓扑所对应的路由信息A8::/64 next-hop:xxx，interface:intf1，cost:75以及路由信息A7::/64 next-hop:xxx，interface:intf1，cost:60在同一张转发表中，且该表(table)ID为128。由此可见，FlexAlgo 128的拓扑所对应的路由信息A8::/64 next-hop:xxx，interface:intf1，cost:75与拓扑ID相互独立且对应。
第一网络设备接收到第一报文，确定与第一报文匹配的网络拓扑为第一网络拓扑，也即FlexAlgo 128的拓扑之后，查找到表(table)ID为128的转发表，按照第一路由信息A8::/64 next-hop:xxx，interface:intf1，cost:75中的出接口来转发第一报文。例如，第一网络设备确定该第一报文的出接口为intf1，通过该intf1接口转发第一报文。
情况二：第一路由信息包括第一网络拓扑的标识。
示例性地，第一网络设备根据第一路由信息发送第一报文，包括：第一网络设备将第一网络拓扑的标识与第一报文的目的地址的前缀进行编码，基于编码后得到的前缀确定第一路由信息，根据第一路由信息中的出接口转发第一报文。
例如，仍以图7所示的生成路由信息的过程为例，如果第一网络拓扑为FlexAlgo 128的拓扑，第一路由信息为FlexAlgo 128的拓扑中的一条路由信息A8:0:0:80/64 next-hop:xxx，interface:intf1，cost:75。其中，第一路由信息包括前缀为A8:0:0:80/64，下一跳(next-hop)地址为xxx，出接口(interface)为intf1，代价(cost)为75。其中，该前缀为A8:0:0:80/64是经过原前缀A8::/64与第一网络拓扑的标识也即128编码得到的，由此可见，第一网络拓扑的标识包括在第一路由信息内，具体的，第一网络拓扑的标识包括在第一路由信息的前缀中。
第一网络设备接收到第一报文，确定与第一报文匹配的网络拓扑为第一网络拓扑，也即FlexAlgo 128的拓扑之后，可将第一网络拓扑的标识也即128与第一报文的目的地址的前缀进行编码，得到A8:0:0:80，从而确定第一路由信息为A8:0:0:80/64 next-hop:xxx，interface:intf1，cost:75。基于A8:0:0:80/64 next-hop:xxx，interface:intf1，cost:75中的出接口来转发第一报文。例如，第一网络设备确定该第一报文的出接口为intf1，通过该intf1接口转发第一报文。
在示例性实施例中，第一路由信息还包括第一资源的标识，第一资源为第一网络拓扑内的资源，则第一网络设备根据第一路由信息发送第一报文，包括：根据第一路由信息并利用第一资源，在第一网络拓扑内发送第一报文。
例如，第一资源的标识对应于第一资源的接口，因而第一网络设备基于第一资源的接口将第一报文转发出去，也即是利用第一资源发送第一报文。
需要说明的是，以上图8所示的方法仅以第一网络设备所在的网络拓扑为第一网络拓扑，且第一网络设备基于第一网络拓扑生成的第一路由信息来转发第一报文的过程，针对第一网 络设备所在的网络拓扑还包括除第一网络拓扑之外的其他网络拓扑的情况，同样适用于本申请实施例提供的转发报文的方法，可参考图8所示的方法流程，此处不再一一赘述。
例如，本申请实施例提供的方法还包括：第一网络设备获取第三报文，与第三报文匹配的网络拓扑为第二网络拓扑，第二网络拓扑是第一网络设备所在的网络拓扑；第一网络设备根据第二网络拓扑确定第三报文的路由信息为第二路由信息；第一网络设备根据第二路由信息发送第三报文。示例性地，第二路由信息与第二网络拓扑的标识对应。或者，第二路由信息包括第二网络拓扑的标识。该转发第三报文的过程可参考转发第一报文的过程，此处不再赘述。
本申请实施例提供的方法，获取到第一报文后，通过根据与第一报文匹配的第一网络拓扑来确定用于转发第一报文的第一路由信息，从而在第一网络拓扑内发送第一报文，实现了基于网络拓扑转发报文的方式。
本申请实施例提供了一种生成路由信息的装置，该装置用于通过图11所示的各个模块执行上述图4中生成路由信息的方法，该装置可以是图4中的第一网络设备。参见图11，该装置包括：
接收模块1101，用于接收第二网络设备发送的位置信息，位置信息包括位置标识以及与位置标识对应的多个关联灵活算法，位置标识用于标识第二网络设备在网络中的位置；该接收模块1101所执行的功能可参考图4所示的402的相关描述，此处不再赘述。
生成模块1102，用于基于第一灵活算法生成到达第二网络设备的第一路由信息，第一灵活算法是多个关联灵活算法中的一个，第一灵活算法与第一网络拓扑对应，第一网络拓扑是生成路由信息的装置所在的网络拓扑，第一路由信息用于在第一网络拓扑内向第二网络设备发送报文。生成模块1102所执行的功能可参考图4所示的403的相关描述，此处不再赘述。
在一种可能的实现方式中，多个关联灵活算法还包括第二灵活算法，生成模块1102，还用于基于第二灵活算法生成到达第二网络设备的第二路由信息，第二路由信息与第二网络拓扑对应，第二网络拓扑是生成路由信息的装置所在的网络拓扑，第二路由信息用于在第二网络拓扑内向第二网络设备发送报文。
在一种可能的实现方式中，第一路由信息与第一网络拓扑的标识对应。
在一种可能的实现方式中，第一路由信息包括第一网络拓扑的标识。
本申请实施例提供了一种发送位置信息的装置，该装置用于通过图12所示的各个模块执行上述图4中发送位置信息的方法，该装置可以是图4中的第二网络设备。参见图12，该装置包括：
发送模块1201，用于向第一网络设备发送位置信息，位置信息包括位置标识以及与位置标识对应的多个关联灵活算法，位置标识用于标识发送位置信息的装置在网络中的位置，多个关联灵活算法中的第一灵活算法用于第一网络设备生成到达第二网络设备的第一路由信息，第一灵活算法与第一网络拓扑对应，第一网络拓扑是第一网络设备所在的网络拓扑，第一路由信息用于第一网络设备在第一网络拓扑内向发送位置信息的装置发送报文。发送模块1201所执行的功能可参考图4所示的401的相关描述，此处不再赘述。
在一种可能的实现方式中，多个关联灵活算法还包括第二灵活算法，第二灵活算法用于第一网络设备生成到达发送位置信息的装置的第二路由信息，第二路由信息与第二网络拓扑 对应，第二网络拓扑是第一网络设备所在的网络拓扑，第二路由信息用于在第二网络拓扑内向发送位置信息的装置发送报文。
本申请实施例提供了一种转发报文的装置，该装置用于通过图13所示的各个模块执行上述图8中转发报文的方法，该装置为图8中的第一网络设备。参见图13，该装置包括：
获取模块1301，用于获取第一报文，与第一报文匹配的网络拓扑为第一网络拓扑，第一网络拓扑是转发报文的装置所在的网络拓扑；获取模块1301所执行的功能可参考图8所示的801的相关描述，此处不再赘述。
确定模块1302，用于根据第一网络拓扑确定第一路由信息，第一路由信息用于在第一网络拓扑内发送第一报文；确定模块1302所执行的功能可参考图8所示的802的相关描述，此处不再赘述。
发送模块1303，用于根据第一路由信息发送第一报文。发送模块1303所执行的功能可参考图8所示的803的相关描述，此处不再赘述。
在第一种可能的实现方式中，获取模块1301，用于获取第二报文；在第二报文中添加第一网络拓扑的标识，以得到第一报文。
在第二种可能的实现方式中，获取模块1301，用于在第二报文的逐跳HBH字段中添加第一网络拓扑的标识，以得到第一报文。
在第三种可能的实现方式中，获取模块1301，用于在第二报文的段标识列表中添加包括第一网络拓扑的标识的段标识，以得到第一报文。
在第四种可能的实现方式中，获取模块1301，用于在第二报文中添加第一网络拓扑的标识以及第一资源的标识，以得到第一报文，第一资源为第一网络拓扑内的资源，第一资源的标识用于指示利用第一资源在第一网络拓扑内发送第一报文。
在第五种可能的实现方式中，获取模块1301，用于根据第二报文的目的地址确定与第二报文匹配的灵活算法为第一灵活算法，第一灵活算法与第一网络拓扑对应；确定与第二报文匹配的网络拓扑为第一网络拓扑；或者，确定第二报文的目的地址匹配指定目的地址，指定目的地址与第一网络拓扑匹配，确定与第二报文匹配的网络拓扑为第一网络拓扑。
在第六种可能的实现方式中，获取模块1301，用于接收第一报文；确定与第一报文匹配的网络拓扑为第一网络拓扑。
在第七种可能的实现方式中，确定模块1302，用于根据第一报文的目的地址确定与第一报文匹配的灵活算法为第一灵活算法，第一灵活算法与第一网络拓扑对应，确定与第一报文匹配的网络拓扑为第一网络拓扑；
或者，确定第一报文的目的地址匹配指定目的地址，指定目的地址与第一网络拓扑匹配，确定与第一报文匹配的网络拓扑为第一网络拓扑。
在第八种可能的实现方式中，第一报文包括第一网络拓扑的标识；确定模块1302，用于根据第一报文中包括的第一网络拓扑的标识，确定与第一报文匹配的网络拓扑为第一网络拓扑。
在第九种可能的实现方式中，第一报文还包括第一资源的标识，第一资源为第一网络拓扑内的资源；
发送模块1303，用于根据第一路由信息，并利用第一资源，在第一网络拓扑内发送第一报文。
在第十种可能的实现方式中，第一路由信息与第一网络拓扑的标识对应；
确定模块1302，用于根据第一路由信息与第一网络拓扑的标识的对应关系，确定第一路由信息。
在第十一种可能的实现方式中，第一网络拓扑的标识包括在第一路由信息内；
确定模块1302，用于根据第一路由信息中包括的第一网络拓扑的标识，确定第一路由信息。
应理解的是，上述图11至图13提供的装置在实现其功能时，仅以上述各功能模块的划分进行举例说明，实际应用中，可以根据需要而将上述功能分配由不同的功能模块完成，即将设备的内部结构划分成不同的功能模块，以完成以上描述的全部或者部分功能。另外，上述实施例提供的装置与方法实施例属于同一构思，其具体实现过程详见方法实施例，这里不再赘述。
参见图14，图14示出了本申请一个示例性实施例提供的网络设备2000的结构示意图。图14所示的网络设备2000用于执行上述图4所示的发送位置信息的方法、生成路由信息的方法及图8所示的转发报文的方法所涉及的操作。该网络设备2000例如是交换机、路由器等，该网络设备2000可以由一般性的总线体系结构来实现。
如图14所示，网络设备2000包括至少一个处理器2001、存储器2003以及至少一个通信接口2004。
处理器2001例如是通用中央处理器(central processing unit，CPU)、数字信号处理器(digital signal processor，DSP)、网络处理器(network processer，NP)、图形处理器(Graphics Processing Unit，GPU)、神经网络处理器(neural-network processing units，NPU)、数据处理单元(Data Processing Unit，DPU)、微处理器或者一个或多个用于实现本申请方案的集成电路。例如，处理器2001包括专用集成电路(application-specific integrated circuit，ASIC)，可编程逻辑器件(programmable logic device，PLD)或者其他可编程逻辑器件、晶体管逻辑器件、硬件部件或者其任意组合。PLD例如是复杂可编程逻辑器件(complex programmable logic device，CPLD)、现场可编程逻辑门阵列(field-programmable gate array，FPGA)、通用阵列逻辑(generic array logic，GAL)或其任意组合。其可以实现或执行结合本发明实施例公开内容所描述的各种逻辑方框、模块和电路。所述处理器也可以是实现计算功能的组合，例如包括一个或多个微处理器组合，DSP和微处理器的组合等等。
可选的，网络设备2000还包括总线。总线用于在网络设备2000的各组件之间传送信息。总线可以是外设部件互连标准(peripheral component interconnect，简称PCI)总线或扩展工业标准结构(extended industry standard architecture，简称EISA)总线等。总线可以分为地址总线、数据总线、控制总线等。为便于表示，图14中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
存储器2003例如是只读存储器(read-only memory，ROM)或可存储静态信息和指令的其它类型的静态存储设备，又如是随机存取存储器(random access memory，RAM)或者可存储信息和指令的其它类型的动态存储设备，又如是电可擦可编程只读存储器(electrically erasable programmable read-only Memory，EEPROM)、只读光盘(compact disc read-only memory，CD-ROM)或其它光盘存储、光碟存储(包括压缩光碟、激光碟、光碟、数字通用光碟、蓝 光光碟等)、磁盘存储介质或者其它磁存储设备，或者是能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其它介质，但不限于此。存储器2003例如是独立存在，并通过总线与处理器2001相连接。存储器2003也可以和处理器2001集成在一起。
通信接口2004使用任何收发器一类的装置，用于与其它设备或通信网络通信，通信网络可以为以太网、无线接入网(RAN)或无线局域网(wireless local area networks，WLAN)等。通信接口2004可以包括有线通信接口，还可以包括无线通信接口。具体的，通信接口2004可以为以太(Ethernet)接口、快速以太(Fast Ethernet，FE)接口、千兆以太(Gigabit Ethernet，GE)接口，异步传输模式(Asynchronous Transfer Mode，ATM)接口，无线局域网(wireless local area networks，WLAN)接口，蜂窝网络通信接口或其组合。以太网接口可以是光接口，电接口或其组合。在本申请实施例中，通信接口2004可以用于网络设备2000与其他设备进行通信。
在具体实现中，作为一种实施例，处理器2001可以包括一个或多个CPU，如图14中所示的CPU0和CPU1。这些处理器中的每一个可以是一个单核(single-CPU)处理器，也可以是一个多核(multi-CPU)处理器。这里的处理器可以指一个或多个设备、电路、和/或用于处理数据(例如计算机程序指令)的处理核。
在具体实现中，作为一种实施例，网络设备2000可以包括多个处理器，如图14中所示的处理器2001和处理器2005。这些处理器中的每一个可以是一个单核处理器(single-CPU)，也可以是一个多核处理器(multi-CPU)。这里的处理器可以指一个或多个设备、电路、和/或用于处理数据(如计算机程序指令)的处理核。
在具体实现中，作为一种实施例，网络设备2000还可以包括输出设备和输入设备。输出设备和处理器2001通信，可以以多种方式来显示信息。例如，输出设备可以是液晶显示器(liquid crystal display，LCD)、发光二级管(light emitting diode，LED)显示设备、阴极射线管(cathode ray tube，CRT)显示设备或投影仪(projector)等。输入设备和处理器2001通信，可以以多种方式接收用户的输入。例如，输入设备可以是鼠标、键盘、触摸屏设备或传感设备等。
在一些实施例中，存储器2003用于存储执行本申请方案的程序代码2010，处理器2001可以执行存储器2003中存储的程序代码2010。也即是，网络设备2000可以通过处理器2001以及存储器2003中的程序代码2010，来实现方法实施例提供的发送位置信息的方法、生成路由信息的方法及转发报文的方法。程序代码2010中可以包括一个或多个软件模块。可选地，处理器2001自身也可以存储执行本申请方案的程序代码或指令。
在具体实施例中，本申请实施例的网络设备2000可对应于上述各个方法实施例中的第一网络设备，网络设备2000中的处理器2001读取存储器2003中的指令，使图14所示的网络设备2000能够执行第一网络设备所执行的全部或部分操作。
具体的，处理器2001用于通过通信接口接收第二网络设备发送的位置信息，位置信息包括位置标识以及与位置标识对应的多个关联灵活算法，位置标识用于标识第二网络设备在网络中的位置；处理器2001基于第一灵活算法生成到达第二网络设备的第一路由信息，第一灵活算法是多个关联灵活算法中的一个，第一灵活算法与第一网络拓扑对应，第一网络拓扑是第一网络设备所在的网络拓扑，第一路由信息用于在第一网络拓扑内向第二网络设备发送报 文。
又例如，处理器2001获取第一报文，与第一报文匹配的网络拓扑为第一网络拓扑，第一网络拓扑是第一网络设备所在的网络拓扑；第一网络设备根据第一网络拓扑确定第一路由信息，第一路由信息用于在第一网络拓扑内发送第一报文；处理器2001根据第一路由信息通过接口发送第一报文。
其他可选的实施方式，为了简洁，在此不再赘述。
又例如，本申请实施例的网络设备2000可对应于上述各个方法实施例中的第二网络设备，网络设备2000中的处理器2001读取存储器2003中的指令，使图14所示的网络设备2000能够执行第二网络设备所执行的全部或部分操作。
具体的，处理器2001用于通过通信接口向第一网络设备发送位置信息，位置信息包括位置标识以及与位置标识对应的多个关联灵活算法，位置标识用于标识第二网络设备在网络中的位置，多个关联灵活算法中的第一灵活算法用于第一网络设备生成到达第二网络设备的第一路由信息，第一灵活算法与第一网络拓扑对应，第一网络拓扑是第一网络设备所在的网络拓扑，第一路由信息用于第一网络设备在第一网络拓扑内向第二网络设备发送报文。
其他可选的实施方式，为了简洁，在此不再赘述。
网络设备2000还可以对应于上述图11-13所示的装置，图11-13所示的装置中的每个功能模块采用网络设备2000的软件实现。换句话说，图11-13所示的装置包括的功能模块为网络设备2000的处理器2001读取存储器2003中存储的程序代码2010后生成的。
其中，图4所示的发送位置信息的方法、生成路由信息的方法及图8所示的转发报文的方法的各步骤通过网络设备2000的处理器中的硬件的集成逻辑电路或者软件形式的指令完成。结合本申请实施例所公开的方法的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤，为避免重复，这里不再详细描述。
参见图15，图15示出了本申请另一个示例性实施例提供的网络设备2100的结构示意图图15所示的网络设备2100用于执行上述图4所示的发送位置信息的方法、生成路由信息的方法及图8所示的转发报文的方法所涉及的全部或部分操作。该网络设备2100例如是交换机、路由器等，该网络设备2100可以由一般性的总线体系结构来实现。
如图15所示，网络设备2100包括：主控板2110和接口板2130。
主控板也称为主处理单元(main processing unit，MPU)或路由处理卡(route processor card)，主控板2110用于对网络设备2100中各个组件的控制和管理，包括路由计算、设备管理、设备维护、协议处理功能。主控板2110包括：中央处理器2111和存储器2112。
接口板2130也称为线路接口单元卡(line processing unit，LPU)、线卡(line card)或业务板。接口板2130用于提供各种业务接口并实现数据包的转发。业务接口包括而不限于以太网接口、POS(Packet over SONET/SDH)接口等，以太网接口例如是灵活以太网业务接口(Flexible Ethernet Clients，FlexE Clients)。接口板2130包括：中央处理器2131网络处理器2132、转发表项存储器2134和物理接口卡(physical interface card，PIC)2133。
接口板2130上的中央处理器2131用于对接口板2130进行控制管理并与主控板2110上 的中央处理器2111进行通信。
网络处理器2132用于实现报文的转发处理。网络处理器2132的形态可以是转发芯片。转发芯片可以是网络处理器(network processor，NP)。在一些实施例中，转发芯片可以通过专用集成电路(application-specific integrated circuit，ASIC)或现场可编程门阵列(field programmable gate array，FPGA)实现。具体而言，网络处理器2132用于基于转发表项存储器2134保存的转发表转发接收到的报文，如果报文的目的地址为网络设备2100的地址，则将该报文上送至CPU(如中央处理器2131)处理；如果报文的目的地址不是网络设备2100的地址，则根据该目的地址从转发表中查找到该目的地址对应的下一跳和出接口，将该报文转发到该目的地址对应的出接口。其中，上行报文的处理可以包括：报文入接口的处理，转发表查找；下行报文的处理可以包括：转发表查找等等。在一些实施例中，中央处理器也可执行转发芯片的功能，比如基于通用CPU实现软件转发，从而接口板中不需要转发芯片。
物理接口卡2133用于实现物理层的对接功能，原始的流量由此进入接口板2130，以及处理后的报文从该物理接口卡2133发出。物理接口卡2133也称为子卡，可安装在接口板2130上，负责将光电信号转换为报文并对报文进行合法性检查后转发给网络处理器2132处理。在一些实施例中，中央处理器2131也可执行网络处理器2132的功能，比如基于通用CPU实现软件转发，从而物理接口卡2133中不需要网络处理器2132。
可选地，网络设备2100包括多个接口板，例如网络设备2100还包括接口板2140，接口板2140包括：中央处理器2141、网络处理器2142、转发表项存储器2144和物理接口卡2143。接口板2140中各部件的功能和实现方式与接口板2130相同或相似，在此不再赘述。
可选地，网络设备2100还包括交换网板2120。交换网板2120也可以称为交换网板单元(switch fabric unit，SFU)。在网络设备有多个接口板的情况下，交换网板2120用于完成各接口板之间的数据交换。例如，接口板2130和接口板2140之间可以通过交换网板2120通信。
主控板2110和接口板耦合。例如。主控板2110、接口板2130和接口板2140，以及交换网板2120之间通过系统总线与系统背板相连实现互通。在一种可能的实现方式中，主控板2110和接口板2130及接口板2140之间建立进程间通信协议(inter-process communication，IPC)通道，主控板2110和接口板2130及接口板2140之间通过IPC通道进行通信。
在逻辑上，网络设备2100包括控制面和转发面，控制面包括主控板2110和中央处理器2111，转发面包括执行转发的各个组件，比如转发表项存储器2134、物理接口卡2133和网络处理器2132。控制面执行路由器、生成转发表、处理信令和协议报文、配置与维护网络设备的状态等功能，控制面将生成的转发表下发给转发面，在转发面，网络处理器2132基于控制面下发的转发表对物理接口卡2133收到的报文查表转发。控制面下发的转发表可以保存在转发表项存储器2134中。在有些实施例中，控制面和转发面可以完全分离，不在同一网络设备上。
值得说明的是，主控板可能有一块或多块，有多块的时候可以包括主用主控板和备用主控板。接口板可能有一块或多块，网络设备的数据处理能力越强，提供的接口板越多。接口板上的物理接口卡也可以有一块或多块。交换网板可能没有，也可能有一块或多块，有多块的时候可以共同实现负荷分担冗余备份。在集中式转发架构下，网络设备可以不需要交换网板，接口板承担整个系统的业务数据的处理功能。在分布式转发架构下，网络设备可以有至少一块交换网板，通过交换网板实现多块接口板之间的数据交换，提供大容量的数据交换和 处理能力。所以，分布式架构的网络设备的数据接入和处理能力要大于集中式架构的网络设备。可选地，网络设备的形态也可以是只有一块板卡，即没有交换网板，接口板和主控板的功能集成在该一块板卡上，此时接口板上的中央处理器和主控板上的中央处理器在该一块板卡上可以合并为一个中央处理器，执行两者叠加后的功能，这种形态网络设备的数据交换和处理能力较低(例如，低端交换机或路由器等网络设备)。具体采用哪种架构，取决于具体的组网部署场景，此处不做任何限定。
在具体实施例中，网络设备2100对应于上述图11及图13所示的应用于第一网络设备的生成路由信息的装置及转发报文的装置。在一些实施例中，图11所示的生成路由信息的装置中的接收模块1101以及图13所示的发送模块1303相当于网络设备2100中的物理接口卡2133。图11所示的生成路由信息的装置中的生成模块1102、图13所示的获取模块1301及确定模块1302相当于网络设备2100中的中央处理器2111或网络处理器2132。
在一些实施例中，网络设备2100还对应于上述图12所示的应用于第二网络设备的发送位置信息的装置。在一些实施例中，图12所示的发送位置信息的装置中的发送模块1201相当于网络设备2100中的物理接口卡2133。
基于上述图14及图15所示的网络设备，本申请实施例还提供了一种通信系统，该通信系统包括：第一网络设备及第二网络设备。可选的，第一网络设备为图14所示的网络设备2000或图15所示的网络设备2100，第二网络设备为图14所示的网络设备2000或图15所示的网络设备2100。
第一网络设备及第二网络设备所执行的方法可参见上述图4及图8所示实施例的相关描述，此处不再加以赘述。
本申请实施例还提供了一种通信装置，该装置包括：收发器、存储器和处理器。其中，该收发器、该存储器和该处理器通过内部连接通路互相通信，该存储器用于存储指令，该处理器用于执行该存储器存储的指令，以控制收发器接收信号，并控制收发器发送信号，并且当该处理器执行该存储器存储的指令时，使得该处理器执行第一网络设备所需执行的方法。
本申请实施例还提供了一种通信装置，该装置包括：收发器、存储器和处理器。其中，该收发器、该存储器和该处理器通过内部连接通路互相通信，该存储器用于存储指令，该处理器用于执行该存储器存储的指令，以控制收发器接收信号，并控制收发器发送信号，并且当该处理器执行该存储器存储的指令时，使得该处理器执行第二网络设备所需执行的方法。
应理解的是，上述处理器可以是中央处理器(Central Processing Unit，CPU)，还可以是其他通用处理器、数字信号处理器(digital signal processing，DSP)、专用集成电路(application specific integrated circuit，ASIC)、现场可编程门阵列(field－programmable gate array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等。通用处理器可以是微处理器或者是任何常规的处理器等。值得说明的是，处理器可以是支持进阶精简指令集机器(advanced RISC machines，ARM)架构的处理器。
进一步地，在一种可选的实施例中，上述存储器可以包括只读存储器和随机存取存储器，并向处理器提供指令和数据。存储器还可以包括非易失性随机存取存储器。例如，存储器还可以存储设备类型的信息。
该存储器可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(read-only memory，ROM)、可编程只读存储 器(programmable ROM，PROM)、可擦除可编程只读存储器(erasable PROM，EPROM)、电可擦除可编程只读存储器(electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(random access memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用。例如，静态随机存取存储器(static RAM，SRAM)、动态随机存取存储器(dynamic random access memory，DRAM)、同步动态随机存取存储器(synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(double data date SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(direct rambus RAM，DR RAM)。
本申请实施例还提供了一种计算机可读存储介质，存储介质中存储有至少一条指令，指令由处理器加载并执行以实现如上图4所示的发送位置信息的方法、生成路由信息的方法及图8所示的转发报文的方法。
本申请实施例还提供了一种计算机程序(产品)，当计算机程序被计算机执行时，可以使得处理器或计算机执行上述方法实施例中对应的各个步骤和/或流程。
本申请实施例还提供了一种芯片，包括处理器，用于从存储器中调用并运行所述存储器中存储的指令，使得安装有所述芯片的通信设备执行上述各方面中的方法。
本申请实施例还提供另一种芯片，包括：输入接口、输出接口、处理器和存储器，所述输入接口、输出接口、所述处理器以及所述存储器之间通过内部连接通路相连，所述处理器用于执行所述存储器中的代码，当所述代码被执行时，所述处理器用于执行上述各方面中的方法。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时，全部或部分地产生按照本申请所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线)或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质，(例如，软盘、硬盘、磁带)、光介质(例如，DVD)、或者半导体介质(例如固态硬盘Solid State Disk)等。
本领域普通技术人员可以意识到，结合本文中所公开的实施例中描述的各方法步骤和模块，能够以软件、硬件、固件或者其任意组合来实现，为了清楚地说明硬件和软件的可互换性，在上述说明中已经按照功能一般性地描述了各实施例的步骤及组成。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。本领域普通技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
本领域普通技术人员可以理解实现上述实施例的全部或部分步骤可以通过硬件来完成，也可以通过程序来指令相关的硬件完成，该程序可以存储于一种计算机可读存储介质中，上 述提到的存储介质可以是只读存储器，磁盘或光盘等。
当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。该计算机程序产品包括一个或多个计算机程序指令。作为示例，本申请实施例的方法可以在机器可执行指令的上下文中被描述，机器可执行指令诸如包括在目标的真实或者虚拟处理器上的器件中执行的程序模块中。一般而言，程序模块包括例程、程序、库、对象、类、组件、数据结构等，其执行特定的任务或者实现特定的抽象数据结构。在各实施例中，程序模块的功能可以在所描述的程序模块之间合并或者分割。用于程序模块的机器可执行指令可以在本地或者分布式设备内执行。在分布式设备中，程序模块可以位于本地和远程存储介质二者中。
用于实现本申请实施例的方法的计算机程序代码可以用一种或多种编程语言编写。这些计算机程序代码可以提供给通用计算机、专用计算机或其他可编程的数据处理装置的处理器，使得程序代码在被计算机或其他可编程的数据处理装置执行的时候，引起在流程图和/或框图中规定的功能/操作被实施。程序代码可以完全在计算机上、部分在计算机上、作为独立的软件包、部分在计算机上且部分在远程计算机上或完全在远程计算机或服务器上执行。
在本申请实施例的上下文中，计算机程序代码或者相关数据可以由任意适当载体承载，以使得设备、装置或者处理器能够执行上文描述的各种处理和操作。载体的示例包括信号、计算机可读介质等等。
信号的示例可以包括电、光、无线电、声音或其它形式的传播信号，诸如载波、红外信号等。
机器可读介质可以是包含或存储用于或有关于指令执行系统、装置或设备的程序的任何有形介质。机器可读介质可以是机器可读信号介质或机器可读存储介质。机器可读介质可以包括但不限于电子的、磁的、光学的、电磁的、红外的或半导体系统、装置或设备，或其任意合适的组合。机器可读存储介质的更详细示例包括带有一根或多根导线的电气连接、便携式计算机磁盘、硬盘、随机存储存取器(RAM)、只读存储器(ROM)、可擦除可编程只读存储器(EPROM或闪存)、光存储设备、磁存储设备，或其任意合适的组合。
所属领域的技术人员可以清楚地了解到，为了描述的方便和简洁，上述描述的系统、设备和模块的具体工作过程，可以参见前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、设备和方法，可以通过其它的方式实现。例如，以上所描述的设备实施例仅仅是示意性的，例如，该模块的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个模块或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另外，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口、设备或模块的间接耦合或通信连接，也可以是电的，机械的或其它的形式连接。
该作为分离部件说明的模块可以是或者也可以不是物理上分开的，作为模块显示的部件可以是或者也可以不是物理模块，即可以位于一个地方，或者也可以分布到多个网络模块上。可以根据实际的需要选择其中的部分或者全部模块来实现本申请实施例方案的目的。
另外，在本申请各个实施例中的各功能模块可以集成在一个处理模块中，也可以是各个模块单独物理存在，也可以是两个或两个以上模块集成在一个模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。
该集成的模块如果以软件功能模块的形式实现并作为独立的产品销售或使用时，可以存 储在一个计算机可读存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分，或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例中方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(read-only memory，ROM)、随机存取存储器(random access memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
本申请中术语“第一”“第二”等字样用于对作用和功能基本相同的相同项或相似项进行区分，应理解，“第一”、“第二”、“第n”之间不具有逻辑或时序上的依赖关系，也不对数量和执行顺序进行限定。还应理解，尽管以下描述使用术语第一、第二等来描述各种元素，但这些元素不应受术语的限制。这些术语只是用于将一元素与另一元素区别分开。例如，在不脱离各种所述示例的范围的情况下，第一图像可以被称为第二图像，并且类似地，第二图像可以被称为第一图像。第一图像和第二图像都可以是图像，并且在某些情况下，可以是单独且不同的图像。
还应理解，在本申请的各个实施例中，各个过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本申请实施例的实施过程构成任何限定。
本申请中术语“至少一个”的含义是指一个或多个，本申请中术语“多个”的含义是指两个或两个以上，例如，多个第二报文是指两个或两个以上的第二报文。本文中术语“系统”和“网络”经常可互换使用。
应理解，在本文中对各种所述示例的描述中所使用的术语只是为了描述特定示例，而并非旨在进行限制。如在对各种所述示例的描述和所附权利要求书中所使用的那样，单数形式“一个(“a”，“an”)”和“该”旨在也包括复数形式，除非上下文另外明确地指示。
还应理解，本文中所使用的术语“和/或”是指并且涵盖相关联的所列出的项目中的一个或多个项目的任何和全部可能的组合。术语“和/或”，是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本申请中的字符“/”，一般表示前后关联对象是一种“或”的关系。
还应理解，术语“包括”(也称“includes”、“including”、“comprises”和/或“comprising”)当在本说明书中使用时指定存在所陈述的特征、整数、步骤、操作、元素、和/或部件，但是并不排除存在或添加一个或多个其他特征、整数、步骤、操作、元素、部件、和/或其分组。
还应理解，术语“若”和“如果”可被解释为意指“当...时”(“when”或“upon”)或“响应于确定”或“响应于检测到”。类似地，根据上下文，短语“若确定...”或“若检测到[所陈述的条件或事件]”可被解释为意指“在确定...时”或“响应于确定...”或“在检测到[所陈述的条件或事件]时”或“响应于检测到[所陈述的条件或事件]”。
应理解，根据A确定B并不意味着仅仅根据A确定B，还可以根据A和/或其它信息确定B。
还应理解，说明书通篇中提到的“一个实施例”、“一实施例”、“一种可能的实现方式”意味着与实施例或实现方式有关的特定特征、结构或特性包括在本申请的至少一个实施例中。因此，在整个说明书各处出现的“在一个实施例中”或“在一实施例中”、“一种可能的实现方式”未必一定指相同的实施例。此外，这些特定的特征、结构或特性可以任意适合的方式 结合在一个或多个实施例中。
以上描述仅为本申请的可选实施例，并不用以限制本申请，凡在本申请的原则之内，所作的任何修改、等同替换、改进等，均应包含在本申请的保护范围之内。

Claims (40)

  1. 一种生成路由信息的方法，其特征在于，所述方法包括：
    第一网络设备接收第二网络设备发送的位置信息，所述位置信息包括位置标识以及与所述位置标识对应的多个关联灵活算法，所述位置标识用于标识所述第二网络设备在网络中的位置；
    所述第一网络设备基于第一灵活算法生成到达所述第二网络设备的第一路由信息，所述第一灵活算法是所述多个关联灵活算法中的一个，所述第一灵活算法与第一网络拓扑对应，所述第一网络拓扑是所述第一网络设备所在的网络拓扑，所述第一路由信息用于在所述第一网络拓扑内向所述第二网络设备发送报文。
  2. 根据权利要求1所述的方法，其特征在于，所述多个关联灵活算法还包括第二灵活算法，所述方法还包括：
    所述第一网络设备基于第二灵活算法生成到达所述第二网络设备的第二路由信息，所述第二路由信息与第二网络拓扑对应，所述第二网络拓扑是所述第一网络设备所在的网络拓扑，所述第二路由信息用于在所述第二网络拓扑内向所述第二网络设备发送报文。
  3. 根据权利要求1或2所述的方法，其特征在于，所述第一路由信息与所述第一网络拓扑的标识对应。
  4. 根据权利要求1或2所述的方法，其特征在于，所述第一路由信息包括所述第一网络拓扑的标识。
  5. 一种发送位置信息的方法，其特征在于，所述方法包括：
    第二网络设备向第一网络设备发送位置信息，所述位置信息包括位置标识以及与所述位置标识对应的多个关联灵活算法，所述位置标识用于标识所述第二网络设备在网络中的位置，所述多个关联灵活算法中的第一灵活算法用于所述第一网络设备生成到达所述第二网络设备的第一路由信息，所述第一灵活算法与第一网络拓扑对应，所述第一网络拓扑是所述第一网络设备所在的网络拓扑，所述第一路由信息用于所述第一网络设备在所述第一网络拓扑内向所述第二网络设备发送报文。
  6. 根据权利要求5所述的方法，其特征在于，所述多个关联灵活算法还包括第二灵活算法，所述第二灵活算法用于所述第一网络设备生成到达所述第二网络设备的第二路由信息，所述第二路由信息与第二网络拓扑对应，所述第二网络拓扑是所述第一网络设备所在的网络拓扑，所述第二路由信息用于在所述第二网络拓扑内向所述第二网络设备发送报文。
  7. 一种转发报文的方法，其特征在于，所述方法包括：
    第一网络设备获取第一报文，与所述第一报文匹配的网络拓扑为第一网络拓扑，所述第 一网络拓扑是所述第一网络设备所在的网络拓扑；
    所述第一网络设备根据所述第一网络拓扑确定第一路由信息，所述第一路由信息用于在所述第一网络拓扑内发送所述第一报文；
    所述第一网络设备根据所述第一路由信息发送所述第一报文。
  8. 根据权利要求7所述的方法，其特征在于，所述第一网络设备获取第一报文，包括：
    所述第一网络设备获取第二报文；
    所述第一网络设备在所述第二报文中添加所述第一网络拓扑的标识，以得到所述第一报文。
  9. 根据权利要求8所述的方法，其特征在于，所述第一网络设备在所述第二报文中添加所述第一网络拓扑的标识，以得到所述第一报文，包括：
    第一网络设备在所述第二报文的逐跳HBH字段中添加所述第一网络拓扑的标识，以得到所述第一报文。
  10. 根据权利要求8所述的方法，其特征在于，所述第一网络设备在所述第二报文中添加所述第一网络拓扑的标识，以得到所述第一报文，包括：
    第一网络设备在所述第二报文的段标识列表中添加包括所述第一网络拓扑的标识的段标识，以得到所述第一报文。
  11. 根据权利要求8所述的方法，其特征在于，所述第一网络设备在所述第二报文中添加所述第一网络拓扑的标识，以得到所述第一报文，包括：
    第一网络设备在所述第二报文中添加所述第一网络拓扑的标识以及第一资源的标识，以得到所述第一报文，所述第一资源为所述第一网络拓扑内的资源，所述第一资源的标识用于指示利用所述第一资源在所述第一网络拓扑内发送所述第一报文。
  12. 根据权利要求8-11任一项所述的方法，其特征在于，所述第一网络设备在所述第二报文中添加所述第一网络拓扑的标识，以得到所述第一报文，包括：
    所述第一网络设备根据所述第二报文的目的地址确定与所述第二报文匹配的灵活算法为第一灵活算法，所述第一灵活算法与所述第一网络拓扑对应，所述第一网络设备确定与所述第二报文匹配的网络拓扑为所述第一网络拓扑；
    或者，所述第一网络设备确定所述第二报文的目的地址匹配指定目的地址，所述指定目的地址与所述第一网络拓扑匹配，所述第一网络设备确定与所述第二报文匹配的网络拓扑为所述第一网络拓扑。
  13. 根据权利要求7所述的方法，其特征在于，所述第一网络设备获取第一报文，包括：
    所述第一网络设备接收第一报文；
    所述第一网络设备确定与所述第一报文匹配的网络拓扑为所述第一网络拓扑。
  14. 根据权利要求13所述的方法，其特征在于，所述第一网络设备确定与所述第一报文匹配的网络拓扑为所述第一网络拓扑，包括：
    所述第一网络设备根据所述第一报文的目的地址确定与所述第一报文匹配的灵活算法为第一灵活算法，所述第一灵活算法与所述第一网络拓扑对应，所述第一网络设备确定与所述第一报文匹配的网络拓扑为所述第一网络拓扑；
    或者，所述第一网络设备确定所述第一报文的目的地址匹配指定目的地址，所述指定目的地址与所述第一网络拓扑匹配，所述第一网络设备确定与所述第一报文匹配的网络拓扑为所述第一网络拓扑。
  15. 根据权利要求13所述的方法，其特征在于，所述第一报文包括所述第一网络拓扑的标识；所述第一网络设备确定与所述第一报文匹配的网络拓扑为所述第一网络拓扑，包括：
    所述第一网络设备根据所述第一报文中包括的所述第一网络拓扑的标识，确定与所述第一报文匹配的网络拓扑为所述第一网络拓扑。
  16. 根据权利要求15所述的方法，其特征在于，所述第一报文还包括第一资源的标识，所述第一资源为所述第一网络拓扑内的资源；
    所述第一网络设备根据所述第一路由信息发送所述第一报文，包括：
    所述第一网络设备根据所述第一路由信息，并利用所述第一资源，在所述第一网络拓扑内发送所述第一报文。
  17. 根据权利要求7-16任一所述的方法，其特征在于，所述第一路由信息与所述第一网络拓扑的标识对应；
    所述第一网络设备根据所述第一网络拓扑确定第一路由信息，包括：
    所述第一网络设备根据所述第一路由信息与所述第一网络拓扑的标识的对应关系，确定所述第一路由信息。
  18. 根据权利要求7-16任一所述的方法，其特征在于，所述第一网络拓扑的标识包括在所述第一路由信息内；
    所述第一网络设备根据所述第一网络拓扑确定第一路由信息，包括：
    所述第一网络设备根据所述第一路由信息中包括的所述第一网络拓扑的标识，确定所述第一路由信息。
  19. 一种生成路由信息的装置，其特征在于，所述装置包括：
    接收模块，用于接收第二网络设备发送的位置信息，所述位置信息包括位置标识以及与所述位置标识对应的多个关联灵活算法，所述位置标识用于标识所述第二网络设备在网络中的位置；
    生成模块，用于基于第一灵活算法生成到达所述第二网络设备的第一路由信息，所述第一灵活算法是所述多个关联灵活算法中的一个，所述第一灵活算法与第一网络拓扑对应，所述第一网络拓扑是所述生成路由信息的装置所在的网络拓扑，所述第一路由信息用于在所述 第一网络拓扑内向所述第二网络设备发送报文。
  20. 根据权利要求19所述的装置，其特征在于，所述多个关联灵活算法还包括第二灵活算法，所述生成模块，还用于基于第二灵活算法生成到达所述第二网络设备的第二路由信息，所述第二路由信息与第二网络拓扑对应，所述第二网络拓扑是所述生成路由信息的装置所在的网络拓扑，所述第二路由信息用于在所述第二网络拓扑内向所述第二网络设备发送报文。
  21. 根据权利要求19或20所述的装置，其特征在于，所述第一路由信息与所述第一网络拓扑的标识对应。
  22. 根据权利要求19或20所述的装置，其特征在于，所述第一路由信息包括所述第一网络拓扑的标识。
  23. 一种发送位置信息的装置，其特征在于，所述装置包括：
    发送模块，用于向第一网络设备发送位置信息，所述位置信息包括位置标识以及与所述位置标识对应的多个关联灵活算法，所述位置标识用于标识所述发送位置信息的装置在网络中的位置，所述多个关联灵活算法中的第一灵活算法用于所述第一网络设备生成到达所述第二网络设备的第一路由信息，所述第一灵活算法与第一网络拓扑对应，所述第一网络拓扑是所述第一网络设备所在的网络拓扑，所述第一路由信息用于所述第一网络设备在所述第一网络拓扑内向所述发送位置信息的装置发送报文。
  24. 根据权利要求23所述的装置，其特征在于，所述多个关联灵活算法还包括第二灵活算法，所述第二灵活算法用于所述第一网络设备生成到达所述发送位置信息的装置的第二路由信息，所述第二路由信息与第二网络拓扑对应，所述第二网络拓扑是所述第一网络设备所在的网络拓扑，所述第二路由信息用于在所述第二网络拓扑内向所述发送位置信息的装置发送报文。
  25. 一种转发报文的装置，其特征在于，所述装置包括：
    获取模块，用于获取第一报文，与所述第一报文匹配的网络拓扑为第一网络拓扑，所述第一网络拓扑是所述转发报文的装置所在的网络拓扑；
    确定模块，用于根据所述第一网络拓扑确定第一路由信息，所述第一路由信息用于在所述第一网络拓扑内发送所述第一报文；
    发送模块，用于根据所述第一路由信息发送所述第一报文。
  26. 根据权利要求25所述的装置，其特征在于，所述获取模块，用于获取第二报文；在所述第二报文中添加所述第一网络拓扑的标识，以得到所述第一报文。
  27. 根据权利要求26所述的装置，其特征在于，所述获取模块，用于在所述第二报文的逐跳HBH字段中添加所述第一网络拓扑的标识，以得到所述第一报文。
  28. 根据权利要求26所述的装置，其特征在于，所述获取模块，用于在所述第二报文的段标识列表中添加包括所述第一网络拓扑的标识的段标识，以得到所述第一报文。
  29. 根据权利要求26所述的装置，其特征在于，所述获取模块，用于在所述第二报文中添加所述第一网络拓扑的标识以及第一资源的标识，以得到所述第一报文，所述第一资源为所述第一网络拓扑内的资源，所述第一资源的标识用于指示利用所述第一资源在所述第一网络拓扑内发送所述第一报文。
  30. 根据权利要求26-29任一项所述的装置，其特征在于，所述获取模块，用于根据所述第二报文的目的地址确定与所述第二报文匹配的灵活算法为第一灵活算法，所述第一灵活算法与所述第一网络拓扑对应；确定与所述第二报文匹配的网络拓扑为所述第一网络拓扑；或者，确定所述第二报文的目的地址匹配指定目的地址，所述指定目的地址与所述第一网络拓扑匹配，确定与所述第二报文匹配的网络拓扑为所述第一网络拓扑。
  31. 根据权利要求25所述的装置，其特征在于，所述获取模块，用于接收第一报文；确定与所述第一报文匹配的网络拓扑为所述第一网络拓扑。
  32. 根据权利要求31所述的装置，其特征在于，所述确定模块，用于根据所述第一报文的目的地址确定与所述第一报文匹配的灵活算法为第一灵活算法，所述第一灵活算法与所述第一网络拓扑对应，确定与所述第一报文匹配的网络拓扑为所述第一网络拓扑；
    或者，确定所述第一报文的目的地址匹配指定目的地址，所述指定目的地址与所述第一网络拓扑匹配，确定与所述第一报文匹配的网络拓扑为所述第一网络拓扑。
  33. 根据权利要求31所述的装置，其特征在于，所述第一报文包括所述第一网络拓扑的标识；所述确定模块，用于根据所述第一报文中包括的所述第一网络拓扑的标识，确定与所述第一报文匹配的网络拓扑为所述第一网络拓扑。
  34. 根据权利要求33所述的装置，其特征在于，所述第一报文还包括第一资源的标识，所述第一资源为所述第一网络拓扑内的资源；
    所述发送模块，用于根据所述第一路由信息，并利用所述第一资源，在所述第一网络拓扑内发送所述第一报文。
  35. 根据权利要求25-34任一所述的装置，其特征在于，所述第一路由信息与所述第一网络拓扑的标识对应；
    所述确定模块，用于根据所述第一路由信息与所述第一网络拓扑的标识的对应关系，确定所述第一路由信息。
  36. 根据权利要求25-34任一所述的装置，其特征在于，所述第一网络拓扑的标识包括在 所述第一路由信息内；
    所述确定模块，用于根据所述第一路由信息中包括的所述第一网络拓扑的标识，确定所述第一路由信息。
  37. 一种网络设备，其特征在于，所述网络设备包括：
    存储器及处理器，所述存储器中存储有至少一条指令，所述至少一条指令由所述处理器加载并执行，以实现权利要求1-4中任一所述的生成路由信息的方法，或者，实现权利要求5或6所述的发送位置信息的方法，或者，实现权利要求7-18任一所述的转发报文的方法。
  38. 一种通信系统，其特征在于，所述通信系统包括第一网络设备和第二网络设备，所述第一网络设备用于执行所述权利要求1-4中任一所述的生成路由信息的方法；
    所述第二网络设备用于执行所述权利要求5或6所述的发送位置信息的方法。
  39. 一种通信系统，其特征在于，所述通信系统包括第一网络设备和第二网络设备，所述第一网络设备用于执行所述权利要求7-12中任一所述的转发报文的方法，所述第二网络设备用于执行权利要求7、13-18中任一所述的转发报文的方法。
  40. 一种计算机可读存储介质，其特征在于，所述存储介质中存储有至少一条指令，所述指令由处理器加载并执行以实现权利要求1-4中任一所述的生成路由信息的方法，或者，实现权利要求5或6所述的发送位置信息的方法，或者，实现权利要求7-18任一所述的转发报文的方法。
PCT/CN2021/113358 2020-08-31 2021-08-18 生成路由信息、发送位置信息及转发报文的方法及设备 WO2022042403A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP21860241.5A EP4199391A4 (en) 2020-08-31 2021-08-18 ROUTING INFORMATION GENERATION METHOD, LOCATION INFORMATION SENDING METHOD, MESSAGE TRANSFER METHOD, AND DEVICE
US18/174,995 US20230216792A1 (en) 2020-08-31 2023-02-27 Method for Generating Routing Information, Method for Sending Location Information, Method for Forwarding Packet, and Device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010901424.0 2020-08-31
CN202010901424.0A CN114125988A (zh) 2020-08-31 2020-08-31 生成路由信息、发送位置信息及转发报文的方法及设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US18/174,995 Continuation US20230216792A1 (en) 2020-08-31 2023-02-27 Method for Generating Routing Information, Method for Sending Location Information, Method for Forwarding Packet, and Device

Publications (1)

Publication Number Publication Date
WO2022042403A1 true WO2022042403A1 (zh) 2022-03-03

Family

ID=80352605

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/113358 WO2022042403A1 (zh) 2020-08-31 2021-08-18 生成路由信息、发送位置信息及转发报文的方法及设备

Country Status (4)

Country Link
US (1) US20230216792A1 (zh)
EP (1) EP4199391A4 (zh)
CN (1) CN114125988A (zh)
WO (1) WO2022042403A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116938803A (zh) * 2022-04-02 2023-10-24 华为技术有限公司 路径计算方法、装置及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106803809A (zh) * 2016-12-29 2017-06-06 杭州迪普科技股份有限公司 一种报文转发的方法和装置
US20180367439A1 (en) * 2016-02-16 2018-12-20 Huawei Technologies Co., Ltd. Packet transmission method and apparatus
CN111385206A (zh) * 2018-12-29 2020-07-07 北京华为数字技术有限公司 报文转发的方法、网络系统、相关设备及计算机存储介质
CN111541613A (zh) * 2020-04-27 2020-08-14 鹏城实验室 一种基于SRv6的数据处理方法及相关设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180367439A1 (en) * 2016-02-16 2018-12-20 Huawei Technologies Co., Ltd. Packet transmission method and apparatus
CN106803809A (zh) * 2016-12-29 2017-06-06 杭州迪普科技股份有限公司 一种报文转发的方法和装置
CN111385206A (zh) * 2018-12-29 2020-07-07 北京华为数字技术有限公司 报文转发的方法、网络系统、相关设备及计算机存储介质
CN111541613A (zh) * 2020-04-27 2020-08-14 鹏城实验室 一种基于SRv6的数据处理方法及相关设备

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
EP4199391A4 (en) 2024-01-24
CN114125988A (zh) 2022-03-01
EP4199391A1 (en) 2023-06-21
US20230216792A1 (en) 2023-07-06

Similar Documents

Publication Publication Date Title
US20230078123A1 (en) Method for Forwarding Packet in SRV6 Service Function Chain and SF Device
WO2022001835A1 (zh) 发送报文的方法、装置、网络设备、系统及存储介质
WO2022068744A1 (zh) 获取报文头信息、生成报文的方法、设备及存储介质
EP4149058A1 (en) Network performance measurement method, apparatus, device and system, and storage medium
WO2022111372A1 (zh) 报文传输方法、装置、设备及计算机可读存储介质
CN114697403A (zh) 业务报文的处理方法、装置、设备、系统及存储介质
CN117240790A (zh) 流表规则的管理方法、流量管理方法、系统及存储介质
WO2022117018A1 (zh) 报文传输的方法和装置
CN115426305B (zh) 报文处理方法、装置、系统及存储介质
WO2022134674A1 (zh) 报文传输的方法、装置、设备、存储介质及系统
WO2022042403A1 (zh) 生成路由信息、发送位置信息及转发报文的方法及设备
WO2022028216A1 (zh) 网络层可达信息传输方法、系统、装置以及网络设备
US12058027B2 (en) Packet transmission method, correspondence obtaining method, apparatus, and system
WO2023040782A1 (zh) 处理报文的方法、系统、设备和存储介质
WO2023179457A1 (zh) 业务连接的标识方法、装置、系统及存储介质
WO2023213216A1 (zh) 一种报文处理的方法及相关设备
CN116828024A (zh) 业务连接的标识方法、装置、系统及存储介质
CN116962161A (zh) 路径检测方法、装置、系统及计算机可读存储介质
CN117376233A (zh) 数据处理方法、装置及系统
CN114513485A (zh) 获取映射规则的方法、装置、设备、系统及可读存储介质
WO2024109045A1 (zh) 路由更新方法、装置、设备及存储介质
WO2022194193A1 (zh) 用于获取路径的方法和装置
CN114629834B (zh) 通信方法及装置
WO2023169364A1 (zh) 路由生成方法、数据报文的转发方法及装置
WO2023040783A1 (zh) 获取能力、发送能力信息的方法、装置、系统及存储介质

Legal Events

Date Code Title Description
ENP Entry into the national phase

Ref document number: 2021860241

Country of ref document: EP

Effective date: 20230313

NENP Non-entry into the national phase

Ref country code: DE

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

Ref document number: 21860241

Country of ref document: EP

Kind code of ref document: A1