WO2024055682A1 - Procédé et appareil de traitement de messages - Google Patents

Procédé et appareil de traitement de messages Download PDF

Info

Publication number
WO2024055682A1
WO2024055682A1 PCT/CN2023/103150 CN2023103150W WO2024055682A1 WO 2024055682 A1 WO2024055682 A1 WO 2024055682A1 CN 2023103150 W CN2023103150 W CN 2023103150W WO 2024055682 A1 WO2024055682 A1 WO 2024055682A1
Authority
WO
WIPO (PCT)
Prior art keywords
interface
slice
identifier
information
network node
Prior art date
Application number
PCT/CN2023/103150
Other languages
English (en)
Chinese (zh)
Inventor
姚俊达
胡志波
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2024055682A1 publication Critical patent/WO2024055682A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0893—Assignment of logical groups to network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0895—Configuration of virtualised networks or elements, e.g. virtualised network function or OpenFlow elements

Definitions

  • the present application relates to the field of communications, and in particular, to a message processing method and device.
  • a network slice can be a virtual network divided into a physical network.
  • a network slice can be a virtual network that contains specific network functions and is composed of customized network topology and network resources.
  • Network slicing can meet the business function requirements of different network slicing tenants. Using network slicing to transmit services corresponding to network slicing tenants can ensure the quality of service provided to network slicing tenants.
  • network slicing may also be called “slicing network” or simply “slicing”. In this embodiment of this application, the three may be used interchangeably.
  • Embodiments of the present application provide a message processing method and device, which can rationally use slice resources.
  • embodiments of the present application provide a message processing method, which can be applied to the second network node.
  • the second network node may receive the first message sent by the first network node through the link corresponding to the first slice through the first interface of the second network node.
  • the first packet does not include the slice identifier of the first slice.
  • the second network node does not extract the slice identifier of the first slice from the first message and forward the first message based on the slice identifier as in traditional technology. Instead, the slice information of the first slice is determined according to the interface information of the first interface, and the slice information is used to indicate the first slice.
  • forwarding information for forwarding the first message to a third network node may be determined based on the slice information, and further, forwarding the first message to the third network node through the determined forwarding information.
  • the second network node can determine the slicing information based on the interface information of the incoming interface that receives the first message, so as to forward the first message to the third network node based on the slicing information.
  • the second network node can implement slice forwarding, and the second network node can reasonably utilize the slice resources of the first slice to forward the first message.
  • the first message can be forwarded to the third network node based on the slice information.
  • the first packet does not carry the slice identifier, which reduces the packet length of the data packet and accordingly saves the occupation of slice resources by the data packet.
  • the first interface is associated with a virtual local area network (VLAN).
  • the interface information of the first interface may be the first interface corresponding to the first interface.
  • VLAN identification For this situation, the first message may include the first VLAN identifier, and accordingly, the second network node may parse the first message to obtain the first VLAN identifier, And further determine the slice information of the first slice based on the first VLAN identifier, thereby realizing slice forwarding.
  • the slice information of the first slice may be the slice ID of the first slice.
  • the second network node may determine the slice identifier of the first slice according to the first VLAN identifier and a first correspondence relationship, where the first correspondence relationship includes the Correspondence between the first VLAN identifier and the slice identifier. After determining the slice identifier of the first slice, slice information of the first slice may be further determined based on the first VLAN identifier, thereby realizing slice forwarding.
  • the slice information of the first slice may be the slice ID of the first slice.
  • the second network node may first determine the interface identifier of the first interface according to the first VLAN identifier, and further determine the interface identifier of the first interface according to the interface identifier of the first interface and the second corresponding relationship, determine the slice identifier of the first slice, and the second correspondence relationship includes the correspondence relationship between the interface identifier and the slice identifier.
  • slice information of the first slice may be further determined based on the first VLAN identifier, thereby realizing slice forwarding.
  • the forwarding information may be a second VLAN identifier.
  • the second network node may be configured according to the The slice information and the third correspondence determine the second VLAN identifier for forwarding the first message, and the third correspondence includes the correspondence between the slice information and the second VLAN identifier.
  • the second network node may obtain a second message including the second VLAN identifier based on the second VLAN identifier and the first message, and send the message to a third party.
  • the network node forwards the second message. In this way, the second network node can quickly and efficiently determine the second VLAN identifier through the third correspondence relationship, thereby quickly forwarding the second message to the third network node, thereby improving message forwarding efficiency.
  • the third correspondence relationship may include a two-level correspondence relationship, which is a correspondence relationship between slice information (such as slice identification) and the second interface, and a correspondence relationship between the second interface and the second VLAN. Correspondence between identifiers.
  • the second interface is an interface corresponding to the second VLAN identifier and the slicing information.
  • the second network node can determine the second VLAN identifier based on the two-level correspondence relationship included in the third correspondence relationship, and further forward the aforementioned second message to the third network node based on the second VLAN identifier, thereby Implement slice forwarding.
  • the interface information of the first interface may be the first time slot information corresponding to the first interface
  • the first time slot information may be used to indicate a first client (client) identity or a first time slot group.
  • the first client identity may correspond to the first time slot group.
  • the service data corresponding to the first client identity may be transmitted through the first time slot group.
  • One time slot group forwarding.
  • the first time slot group may include at least one time slot.
  • the first time slot information may include the first client identifier.
  • the first time slot information may include the information of each time slot included in the first time slot group. Identification, for example, the first time slot information may include a time slot number of each time slot included in the first time slot group.
  • the slice information of the first slice may be a slice identifier of the first slice.
  • the second network node may determine the slice identifier of the first slice based on the first time slot information and a fourth correspondence relationship, where the fourth correspondence relationship includes the The corresponding relationship between the first time slot information and the slice identifier.
  • the slice information of the first slice may be further determined based on the first VLAN identifier, thereby realizing slice forwarding.
  • the slice information of the first slice may be a slice identifier of the first slice.
  • the second network node may determine the interface identifier of the first interface according to the first time slot information, and determine the interface identifier of the first interface according to the fifth corresponding relationship. , determine the slice identifier of the first slice, and the fifth correspondence includes a correspondence between the interface identifier and the slice identifier.
  • slice information of the first slice may be further determined based on the first VLAN identifier, thereby realizing slice forwarding.
  • the forwarding information may be the second time slot information.
  • the second network node may The slice information and the sixth corresponding relationship are used to determine the second time slot information for forwarding the first message.
  • the second time slot information is used to indicate the second client identifier or the second time slot group.
  • the second client The identifier corresponds to the second time slot group, and the sixth correspondence includes a correspondence between the slice information and the second time slot information.
  • the first message may be forwarded to the third network node through the second time slot group corresponding to the second time slot information, thereby realizing slice forwarding. In this way, the second network node can quickly and efficiently determine the second time slot information through the sixth correspondence relationship, thereby quickly forwarding the first message to the third network node, thereby improving message forwarding efficiency.
  • the sixth correspondence relationship may include a two-level correspondence relationship, which is a correspondence relationship between the slice information and the third interface, and a correspondence relationship between the third interface and the second time interface.
  • the third interface is an interface corresponding to the slice information and the second time slot information.
  • the second network node may first determine the third interface based on the correspondence between the slice information and the third interface and the slice information. After the third interface is determined, the third time slot information may be determined based on the correspondence between the third interface and the second time slot information and the third interface. In this way, the second network node can determine the second time slot information based on the two-level correspondence included in the sixth correspondence, and further forward the first message to the third network node based on the second time slot information, This enables slice forwarding.
  • the interface information of the first interface may be an interface identifier of the first interface.
  • the interface identifier of the first interface mentioned here may be, for example, the local identifier of the first interface at the second network node.
  • the slice information of the first slice may be the first routing table corresponding to the first slice.
  • the second network node may determine an outbound interface for forwarding the first message to a third network node based on the destination address of the first message and the first routing table. , and further forward the first message through the outbound interface, thereby realizing slice forwarding. In this way, for a physical network including multiple slices, each slice has a routing table corresponding to the slice.
  • each slice uses its own routing table to guide forwarding. In this way, there is no need to divide an independent address space for each slice.
  • the network addresses corresponding to each slice can be in the same address space, thereby reducing the calculation amount of the network node calculating the routing table and saving the computing resources of the network node.
  • a seventh correspondence relationship may be stored in the second network node, and the seventh correspondence relationship includes a correspondence relationship between an interface identifier of the first interface and an identifier of the first routing table,
  • the second network node may determine the identifier of the first routing identifier according to the interface identifier of the first interface and the seventh corresponding relationship, and further, determine the identifier of the first routing identifier according to the first routing table. identification to obtain the first routing table.
  • the first slice may be, for example, a slice corresponding to a flexible algorithm.
  • the address spaces corresponding to each slice are different. Therefore, network nodes need to calculate routing tables for multiple address spaces, resulting in the resources required for route calculation. More. Using this solution, there is no need to divide independent address spaces for the slices corresponding to each flexible algorithm.
  • the network addresses corresponding to each slice can be in the same address space, thus reducing the calculation amount of routing tables for network nodes and saving network nodes. Computing resources.
  • the second network node determines the first routing table according to the interface identifier of the first interface.
  • the second network node may first determine the global identifier of the first interface according to the interface identifier of the first interface. , the global identifier is used to identify the first slice. After the global identifier is determined, the first routing table may be determined based on the global identifier.
  • an eighth correspondence relationship may be stored in the second network node, and the eighth correspondence relationship may include a correspondence relationship between the global identifier and the identifier of the first routing table.
  • the identifier of the first routing identifier can be obtained according to the global identifier and the eighth correspondence relationship. Further, The first routing table is obtained according to the identifier of the first routing table.
  • the global identifier of the first interface may be the slice identifier associated with the first interface.
  • the slice identifier associated with the first interface may also be understood as the slice identifier of the first slice.
  • the network addresses corresponding to each slice can be in the same address space, thereby reducing the calculation amount of the network node calculating the routing table and saving the computing resources of the network node.
  • the first slice is a slice associated with a flexible algorithm.
  • the global identifier of the first interface may be the flexible algorithm identifier associated with the first interface.
  • the network addresses corresponding to each slice can be in the same address space, thus reducing the calculation amount of routing tables for network nodes and saving network nodes. computing resources.
  • the first slice is associated with a certain network topology in a multi-topology (MT).
  • the global identifier of the first interface may be the first MT identifier associated with the interface.
  • embodiments of the present application provide a message processing device applied to a second network node.
  • the device includes: a receiving unit configured to receive a message from a first network node through a first interface of the second network node. The first message sent through the link corresponding to the first slice; a processing unit configured to determine the slice information of the first slice according to the interface information of the first interface, the slice information is used to indicate the The first slice, the first message does not include the slice identifier of the first slice; determine the forwarding information of forwarding the first message to the third network node according to the slice information; the sending unit uses Forwarding the first message to the third network node through the forwarding information.
  • the interface information of the first interface includes: a first virtual LAN VLAN identifier corresponding to the first interface, and the first message includes the first VLAN identifier.
  • determining the slice information of the first slice according to the interface information of the first interface includes: determining the first slice according to the first VLAN identifier and the first corresponding relationship.
  • a slice identifier of a slice, and the first correspondence includes a correspondence between the first VLAN identifier and the slice identifier.
  • the determining the slice information of the first slice according to the interface information of the first interface includes: determining the interface identifier of the first interface according to the first VLAN identifier; The slice identifier of the first slice is determined according to the interface identifier of the first interface and a second correspondence relationship, where the second correspondence relationship includes a correspondence relationship between the interface identifier and the slice identifier.
  • determining the forwarding information of forwarding the first message to a third network node according to the slice information includes: determining to forward the first message according to the slice information and a third corresponding relationship.
  • the third correspondence includes: a correspondence between the slice information and the second interface, and a correspondence between the second interface and the second VLAN identifier,
  • the second interface is an interface corresponding to the second VLAN identifier and the slicing information.
  • the interface information of the first interface includes: first time slot information corresponding to the first interface, and the first time slot information is used to indicate the first client identifier or the first client identifier.
  • a time slot group, the first client identifier corresponds to the first time slot group.
  • determining the slice information of the first slice according to the interface information of the first interface includes: determining the first slot information and a fourth corresponding relationship.
  • the slice identifier of the first slice, and the fourth corresponding relationship includes the corresponding relationship between the first time slot information and the slice identifier.
  • determining the slice information of the first slice according to the interface information of the first interface includes: determining an interface identifier of the first interface according to the first timeslot information. ; Determine the slice identifier of the first slice according to the interface identifier of the first interface and a fifth correspondence relationship, where the fifth correspondence relationship includes a correspondence relationship between the interface identifier and the slice identifier.
  • determining the forwarding information of forwarding the first message to a third network node according to the slice information includes: determining to forward the first message according to the slice information and a sixth correspondence relationship.
  • the second time slot information of the first message, the second time slot information is used to indicate a second client identification or a second time slot group, the second client identification corresponds to the second time slot group, and the second time slot information is used to indicate a second client identification or a second time slot group.
  • the six corresponding relationships include the corresponding relationship between the slice information and the second time slot information; the sending unit is configured to: forward the first time slot information to the third network node through the second time slot group. message.
  • the sixth correspondence includes: a correspondence between the slice information and the third interface, and a correspondence between the third interface and the second timeslot information.
  • the third interface is an interface corresponding to the slice information and the second timeslot information.
  • the interface information of the first interface includes: an interface identifier of the first interface, and the processing unit is configured to: determine the third interface according to the interface identifier of the first interface.
  • a first routing table corresponding to the slice is generated; and an outbound interface for forwarding the first message to a third network node is determined based on the destination address of the first message and the first routing table.
  • determining the first routing table corresponding to the first slice according to the interface identifier of the first interface includes: according to the interface identifier of the first interface and a seventh corresponding relationship , determine the first routing table, and the seventh correspondence includes a correspondence between the interface identifier of the first interface and the identifier of the first routing table.
  • the first slice is a slice corresponding to a flexible algorithm.
  • determining the first routing table corresponding to the first slice according to the interface identifier of the first interface includes: determining the first routing table according to the interface identifier of the first interface.
  • the global identifier of the interface the global identifier is used to identify the first slice; the first routing table is determined according to the global identifier.
  • determining the first routing table according to the global identifier includes: determining the first routing table according to the global identifier and an eighth correspondence, and the eighth correspondence The relationship includes a corresponding relationship between the global identifier and the identifier of the first routing table.
  • the global identifier of the first interface includes: a slice identifier associated with the first interface; or a flexible algorithm identifier associated with the first interface; or, the first interface The associated multi-topology MT identifier.
  • an embodiment of the present application provides a device.
  • the device includes a processor and memory.
  • the memory is used to store instructions or computer programs.
  • the processor is configured to execute the instructions or computer programs in the memory, and perform the method described in any one of the above first aspects.
  • embodiments of the present application provide a computer-readable storage medium, which includes instructions or computer programs that, when run on a computer, cause the computer to perform any of the methods described in the first aspect above.
  • embodiments of the present application provide a computer program product containing instructions or computer programs, which, when run on a computer, cause the computer to perform any of the methods described in the first aspect above.
  • Figure 1 is a schematic diagram of an application scenario provided by an embodiment of the present application.
  • Figure 2 is a schematic diagram of an exemplary application scenario provided by the embodiment of the present application.
  • Figure 3 is a schematic flow chart of a message processing method provided by an embodiment of the present application.
  • Figure 4a is a schematic diagram of an exemplary application scenario provided by the embodiment of the present application.
  • Figure 4b is a schematic diagram of another exemplary application scenario provided by the embodiment of the present application.
  • Figure 4c is a schematic diagram of another exemplary application scenario provided by the embodiment of the present application.
  • Figure 4d is a schematic diagram of another exemplary application scenario provided by the embodiment of the present application.
  • Figure 5 is a schematic structural diagram of a message processing device provided by an embodiment of the present application.
  • Figure 6 is a schematic structural diagram of a device provided by an embodiment of the present application.
  • Embodiments of the present application provide a message processing method and device, which can rationally use slice resources.
  • a network node when a network node forwards a data packet, it first determines the next hop and outbound interface for packet forwarding based on the destination address of the packet. After determining the outbound interface, it can further determine the corresponding relationship between the outbound interface and the slice ID. , determine the message forwarding resources.
  • the packet forwarding resource mentioned here can be the physical sub-interface corresponding to the outbound interface, the channelized sub-interface corresponding to the outbound interface, or the FlexE interface.
  • FlexE interfaces can be understood as interfaces that apply FlexE technology. FlexE technology pools physical interface resources by time slots through FlexE Shim, and flexibly divides several FlexE interfaces through time slot resource pools on large-bandwidth physical interfaces to achieve flexibility in interface resources. , Refined management. Bandwidth resources are strictly isolated between each FlexE interface.
  • the channelized sub-interface adopts the sub-interface model to achieve flexible allocation of bandwidth by configuring independent channelized sub-interfaces for network slices.
  • Each network slice occupies exclusive bandwidth and scheduling trees to provide resource reservation for slice services.
  • FIG. 1 is a schematic diagram of an application scenario provided by an embodiment of the present application.
  • network node B includes interfaces GE0/1/0 and GE0/2/0.
  • the forwarding table stored in network node B includes correspondence relationship 110 and correspondence relationship 120. in:
  • Correspondence 110 includes two correspondences, namely: the correspondence between prefix A6::1, next hop C, and outbound interface GE0/1/0, and the correspondence between prefix A6::2, next hop G, And the corresponding relationship between the outbound interface GE0/2/0.
  • the corresponding relationship 120 also includes two corresponding relationships, namely: the corresponding relationship between the outbound interface GE0/1/0, slice ID 1 and FlexE interface 1, and the outbound interface GE0/2/0, slice ID 2 and FlexE interface. The correspondence between 2.
  • network node B can first match the destination address A6::1 with the corresponding relationship 110, and determine The first hop is network node C, and the outbound interface is determined to be GE0/1/0; further, network node B can match the outbound interface GE0/1/0 with the corresponding relationship 120, and determine that the forwarding resource is FlexE interface 1. Further, the network node B can use the FlexE interface 1 to forward the message 1 to the network node C.
  • network node B can first match the destination address A6::2 with the corresponding relationship 110 , determine the next hop to be network node G, and determine the outbound interface to be GE0/2/0; further, network node B can match the outbound interface GE0/2/0 to the corresponding relationship 120, and determine that the forwarding resource is FlexE interface 2. Further, the network node B can use the FlexE interface 2 to forward the message 1 to the network node G.
  • the head node needs to encapsulate the slice identifier in the message when forwarding the data message.
  • the intermediate node can extract the slice identifier from the data message, thereby implementing slice forwarding based on the slice identifier. .
  • adopting this approach may lead to unreasonable use of slice resources.
  • the intermediate node may not have the ability to parse the slice identifier in the data message. After receiving the data message carrying the slice identifier, the intermediate node will discard the data message, making the data message unavailable. Use slice resources for forwarding.
  • each data packet carries a slice identifier, resulting in a larger total bandwidth occupied by the slice identifier.
  • embodiments of the present application provide a message processing method and device. By using this method, slice forwarding can be realized without carrying a slice identifier in the data message.
  • FIG. 2 is a schematic diagram of an exemplary application scenario provided by the embodiment of the present application.
  • Figure 3 for the implementation of this application The example provides a flow diagram of a message processing method.
  • network node A and network node C are connected through network node B.
  • Network node B is the intermediate node in the slice tunnel.
  • the method shown in Figure 3 can be applied to the second network node, and the second network node can correspond to network node B shown in Figure 2.
  • the packet processing method shown in Figure 3 may include the following S101-S104.
  • S101 Receive the first message sent by the first network node through the link corresponding to the first slice through the first interface of the second network node.
  • the first interface may be a physical interface of the second network node, such as a physical sub-interface, or it may be a channelized sub-interface of the second network node, such as a VLAN corresponding to
  • the interface may also be the FlexE interface of the second network node, which is not specifically limited in the embodiments of this application.
  • the first network node and the second network node may be connected through a link corresponding to the first slice.
  • the second network node corresponds to network node B
  • the first network node may correspond to network node A.
  • S102 Determine the slice information of the first slice according to the interface information of the first interface.
  • the slice information is used to identify the first slice.
  • the first packet does not include the first slice.
  • the second network node may determine the slice information of the first slice according to the interface information of the first interface.
  • the interface information of the first interface may be information related to the first interface.
  • the interface information of the first interface may be the first VLAN identifier corresponding to the first interface.
  • the first message may include the first VLAN identifier, and accordingly, the second network node may parse the first message to obtain the first VLAN identifier.
  • the interface information may be the first time slot information corresponding to the first interface, and the first time slot information may be used to indicate the first client
  • the first client identifier may correspond to the first time slot group, and the service data corresponding to the first client identifier may be forwarded through the first time slot group.
  • the first time slot group may include at least one time slot.
  • the first time slot information may include the first client identifier.
  • the first time slot information may include the information of each time slot included in the first time slot group. Identification, for example, the first time slot information may include a time slot number of each time slot included in the first time slot group.
  • the interface information of the first interface may be an interface identifier of the first interface.
  • the interface identifier of the first interface mentioned here may be, for example, the local identifier of the first interface at the second network node.
  • the slice information may be the slice identifier of the first slice.
  • the second network node may store a first correspondence relationship, where the first correspondence relationship includes a correspondence relationship between the first VLAN identifier and the slice identifier of the first slice.
  • the slice identifier of the first slice may be determined based on the first VLAN identifier and the first corresponding relationship.
  • the second network node receives the first message After that, the first VLAN identifier is extracted from the first message, and based on the first VLAN identifier and the first corresponding relationship, the slice identifier of the first slice can be determined.
  • the efficiency of determining the slice identifier is high. Accordingly, the slice identifier can be determined Improve the efficiency of message forwarding.
  • the interface information is a first VLAN identifier
  • the slice information may be a slice identifier of the first slice.
  • the second network node may first determine the interface identifier of the first interface based on the VLAN identifier in the first message.
  • the second network node may store a correspondence between the first VLAN identifier and the interface identifier of the first interface, and the second network node may store the corresponding relationship between the first VLAN identifier and the interface identifier of the first interface.
  • the corresponding relationship between the interface identifier of the first interface and the first VLAN identifier determines the interface identifier of the first interface.
  • the slice identifier of the first slice may be determined based on the interface identifier and a second correspondence relationship, where the second correspondence relationship may also be the second network node
  • the stored correspondence relationship, the second correspondence relationship includes the correspondence relationship between the interface identifier of the first interface and the slice identifier.
  • the second network node extracts the first VLAN identifier from the first message, then determines the interface identifier of the first interface based on the first VLAN identifier, and further determines the interface identifier of the first interface based on the first VLAN identifier.
  • the interface identifier and the second correspondence are related to determine the slice identifier of the first slice.
  • the slice of the first slice can be obtained based on the first VLAN identifier in the first packet. Identification to facilitate subsequent slice forwarding.
  • the slice information may be a slice identifier of the first slice.
  • the second network node may store a fourth correspondence relationship, where the fourth correspondence relationship includes a correspondence relationship between the first time slot information and the slice identifier of the first slice.
  • the slice identifier of the first slice may be determined based on the first time slot information and the fourth corresponding relationship.
  • the second network node determines the first time slot information corresponding to the first message, and based on the first time slot information and the fourth corresponding relationship, the first time slot information can be determined.
  • the slice identifier of the slice is highly efficient in determining the slice identifier. Correspondingly, the efficiency of packet forwarding can be improved.
  • the interface information is first time slot information
  • the slice information may be a slice identifier of the first slice.
  • the second network node may first determine the interface identifier of the first interface based on the first time slot information.
  • the second network node may store a correspondence between the first time slot information and the interface identifier of the first interface, and the second network node may store the corresponding relationship between the first time slot information and the interface identifier of the first interface. The corresponding relationship between the interface identifier of the first interface and the first time slot information determines the interface identifier of the first interface.
  • the slice identifier of the first slice may be determined based on the interface identifier and a fifth correspondence, wherein the fifth correspondence may also be the second network node
  • the stored correspondence relationship, the fifth correspondence relationship includes the correspondence relationship between the interface identifier of the first interface and the slice identifier.
  • the second network node determines the first time slot information corresponding to the first message, and then determines the interface identifier of the first interface based on the first time slot information, and further determines the interface identifier of the first interface based on the first time slot information.
  • the interface identifier of the interface and the fifth corresponding relationship determine the slice identifier of the first slice. In this way, when the first packet does not carry the slice ID, the slice ID of the first slice can be obtained based on the first time slot information corresponding to the first packet, so as to facilitate subsequent slice forwarding.
  • the interface information of the first interface is the interface identifier of the first interface.
  • the slice information of the first slice may be the first route corresponding to the first slice. surface.
  • the root When determining the slice information based on the interface information, for example, the first routing table corresponding to the first slice may be determined based on the interface identifier of the first interface.
  • each slice has a routing table corresponding to the slice.
  • each slice uses its own routing table to guide forwarding. In this way, there is no need to divide an independent address space for each slice.
  • the network addresses corresponding to each slice can be in the same address space, thereby reducing the calculation amount of the network node calculating the routing table and saving the computing resources of the network node.
  • the first routing table is determined based on the interface identifier of the first interface
  • a seventh correspondence relationship may be stored in the second network node, and the seventh correspondence relationship includes a correspondence relationship between an interface identifier of the first interface and an identifier of the first routing table,
  • the second network node may determine the identifier of the first routing identifier according to the interface identifier of the first interface and the seventh corresponding relationship, and further, determine the identifier of the first routing identifier according to the first routing table. identification to obtain the first routing table.
  • the first slice may be, for example, a slice corresponding to a flexible algorithm (flex-algo).
  • network nodes can calculate the shortest path based on the configured algorithm.
  • a business can be associated with a flexible algorithm, thereby transmitting business data through a path corresponding to the flexible algorithm, thereby meeting business requirements.
  • a flexible algorithm can correspond to a slice, and the slice can include multiple network nodes configured with the flexible algorithm.
  • specific implementation of determining the first routing table according to the interface identifier of the first interface may include the following steps A1-A2.
  • Step A1 Determine the global identifier of the first interface according to the interface identifier of the first interface, where the global identifier is used to identify the first slice.
  • the second network node may store a correspondence between the interface identifier of the first interface and the global identifier of the first interface. Therefore, the second network node may store the corresponding relationship between the interface identifier of the first interface and the global identifier of the first interface. The corresponding relationship between the interface identifier of an interface and the global identifier of the first interface and the interface identifier of the first interface are used to obtain the global identifier of the first interface.
  • the embodiment of the present application does not specifically limit the global identifier of the first interface.
  • the global identifier of the first interface may be any identifier that can identify the first slice.
  • the global identifier of the first interface may be the slice identifier associated with the first interface.
  • the slice identifier associated with the first interface may also be understood as the slice identifier of the first slice.
  • the global identifier of the first interface may be the flexible algorithm identifier associated with the first interface.
  • the global identity of the first interface may be the MT identity associated with the first interface.
  • MT When a physical network includes MT, MT The address spaces corresponding to each network topology are different. Therefore, network nodes need to calculate routing tables for multiple address spaces, resulting in more resources required for route calculation. Using this solution, there is no need to divide independent address spaces for each network topology in MT. The network addresses corresponding to each network topology can be in the same address space, thus reducing the calculation amount of routing tables for network nodes and saving network nodes. Computing resources.
  • Step A2 Determine the first routing table according to the global identifier.
  • the first routing table may be determined based on the global identifier.
  • each routing table stored by the second network node may include a global identifier corresponding to the routing table.
  • the second network node may use the global identifier of the first interface as an index to search The second network node stores each routing table, thereby obtaining the first routing table including the global identifier.
  • an eighth correspondence relationship may be stored in the second network node, and the eighth correspondence relationship may include a correspondence relationship between the global identifier and the identifier of the first routing table. For this situation, after the global identifier is determined, the identifier of the first routing identifier can be obtained according to the global identifier and the eighth correspondence relationship. Further, the identifier of the first routing identifier can be obtained according to the identifier of the first routing table. Describe the first routing table.
  • S103 Determine the forwarding information for forwarding the first message to the third network node according to the slice information.
  • the second network node may further determine message forwarding information for forwarding the first message to a third network node based on the slice information.
  • the message forwarding information is used to forward the first message to the third network node.
  • the message is forwarded to the third network node.
  • the third network node and the second network node may be connected through a link corresponding to the first slice.
  • the second network node corresponds to network node B
  • the third network node may correspond to network node C.
  • the forwarding information may be, for example, a second VLAN identifier.
  • the forwarding information may be a second VLAN identifier.
  • the forwarding information may be, for example, a second client identifier.
  • the forwarding information may be a second client identifier.
  • the forwarding information may also be an outbound interface used to forward the first packet.
  • S103 can be implemented in a variety of ways. The following describes several possible implementation ways.
  • the forwarding information may be a second VLAN identifier.
  • the second network node may obtain the second VLAN identifier based on the slice information and the third correspondence.
  • the third correspondence may include a correspondence between the slice information and the second VLAN identifier.
  • the third correspondence may include a correspondence between the slice identifier and the second VLAN identifier.
  • the third corresponding relationship may also include a main interface, and the main interface may be an outbound interface that forwards the first packet.
  • the third corresponding relationship may be a corresponding relationship between the main interface, the slice identifier, and the second VLAN identifier.
  • the second network node may first search a locally stored routing table to determine the main interface according to the destination address of the first message, and then use the main interface and the slice identifier as indexes to find the third three corresponding relationships, and further obtain the second VLAN identifier based on the third corresponding relationship.
  • the second network node determines the main interface, it can obtain the second VLAN ID based on the correspondence between the main interface, the slice ID, and the second VLAN ID, thereby quickly and efficiently determining the second VLAN.
  • the identification accordingly, also improves the efficiency of message forwarding.
  • the third correspondence relationship may include a two-level correspondence relationship, which is the correspondence relationship between the slice information (such as slice identification) and the second interface, and the correspondence relationship between the second interface and the second interface.
  • the second interface is an interface associated with both the second VLAN identifier and the slice information.
  • the second interface can also be understood as a logical interface that forwards the first message to the third network node.
  • the two-level corresponding relationship may include, for example: the corresponding relationship between the main interface, slice information (such as slice identification) and the second interface, and the main interface , the corresponding relationship between the second interface and the second VLAN identifier.
  • slice information such as slice identification
  • main interface the corresponding relationship between the second interface and the second VLAN identifier.
  • the forwarding information may be second time slot information.
  • the second network node may obtain the second time slot information based on the slice information and the sixth corresponding relationship, so The second time slot information is used to indicate a second client identifier or a second time slot group.
  • the second client identifier may correspond to a second time slot group, and the second time slot group may include at least one time slot.
  • the sixth correspondence may include a correspondence between the slice information and the second time slot information.
  • the slice information is a slice identifier
  • the sixth correspondence may include a correspondence between the slice identifier and the second time slot information.
  • the second time slot information may include the second client identifier.
  • the second time slot information may include the information of each time slot included in the second time slot group. Identification, for example, the second time slot information may include a time slot number of each time slot included in the second time slot group.
  • the sixth correspondence relationship may also include a main interface, which may be an outbound interface that forwards the first message, and the outbound interface may correspond to a FlexE group, for example.
  • the sixth correspondence relationship may be a correspondence relationship between the main interface, the slice identifier, and the second time slot information.
  • the second network node may first search a locally stored routing table to determine the main interface (for example, FlexE group) based on the destination address of the first message, and then use the main interface and the slice identifier as an index, The sixth corresponding relationship is found, and the second time slot information is further obtained based on the sixth corresponding relationship.
  • the second network node determines the aforementioned main interface, it can obtain the second time slot information based on the correspondence between the main interface, the slice identifier, and the second time slot information, thereby quickly and efficiently determining the second time slot information.
  • the time slot information accordingly, also improves the efficiency of packet forwarding.
  • the sixth correspondence relationship may include a two-level correspondence relationship, which is the correspondence relationship between the slice information (such as slice identification) and the third interface, and the correspondence relationship between the third interface and the third interface.
  • the third interface is an interface associated with both the second time slot information and the slice information.
  • the third interface can also be understood as a logical interface (for example, FlexE group) that forwards the first message to the third network node.
  • the two-level corresponding relationship may include, for example: the corresponding relationship between the main interface, slice information (such as slice identification) and the third interface, and the third interface.
  • the second network node Correspondence between the interface, the second client identifier and the second time slot group.
  • the second network node determines the aforementioned main interface, it can determine the second client identifier based on the two-level correspondence relationship included in the sixth correspondence relationship, and further determine the second client identifier based on the second time slot group corresponding to the second client identifier.
  • the third network node forwards the first message, thereby realizing slice forwarding.
  • the forwarding information may be an outgoing link that forwards the first packet to a third network node. mouth.
  • the forwarding information may be an outbound interface that forwards the first packet to the third network node.
  • the second network node may match the destination address of the first message with the first routing table, thereby obtaining an outbound interface for forwarding the first message to the third network node.
  • S104 Forward the first message to the third network node through the forwarding information.
  • the second network node may further forward the first message to a third network node based on the forwarding information.
  • S104 can be implemented in a variety of ways. The following describes several possible implementation ways.
  • the second network node can obtain the information including the second VLAN identifier based on the first message and the second VLAN identifier. the second message, and further forwards the second message to the second network node.
  • the second network node obtains the second message based on the first message and the second VLAN identifier, for example, the second VLAN identifier may be used to replace the first VLAN identifier in the first message, thereby obtaining the second message.
  • the forwarding information is a second client identifier.
  • the second network node can forward the information to the third client through the second time slot group corresponding to the second client identifier.
  • Three network nodes forward the first message.
  • the second network node may load the first message into a time slot corresponding to the second time slot group and forward it to the third network node.
  • the forwarding information is an outbound interface that forwards the first packet to a third network node.
  • the second network node may forward the first message to the third network node through the outbound interface.
  • the second network node may determine the packet forwarding resource based on the outbound interface and the slice identifier of the first slice, and further forward the packet based on the determined packet forwarding resource.
  • the packet forwarding resources mentioned here include but are not limited to the physical sub-interface corresponding to the outbound interface, the channelized sub-interface corresponding to the outbound interface, or the FlexE interface.
  • the slice identifier of the first slice it can also be obtained through the interface information of the first interface.
  • the specific implementation of obtaining the slice identifier according to the interface information of the first interface you can refer to the relevant description section above, which will not be done here. Repeat description.
  • the second network node can implement slice forwarding, and the second network node can reasonably utilize the slice resources of the first slice to forward the first message. message.
  • the first message can be forwarded to the third network node based on the slice information.
  • the first packet does not carry the slice identifier, which reduces the length of the data packet and accordingly saves the occupation of slice resources by the data packet.
  • FIG. 4a is a schematic diagram of an exemplary application scenario provided by an embodiment of the present application.
  • Network node A and network node C are connected through network node B. There is a slice tunnel between network node A and network node C. Network node B is an intermediate node in the slice tunnel.
  • Network node A includes physical interface GE1/1/0, and physical interface GE1/1/0 includes three sub-interfaces: GE1/1/0.1, GE1/1/0.2, and GE1/1/0.3.
  • Network node B includes physical interface GE2/1/0, and physical interface GE2/1/0 includes three sub-interfaces, namely GE2/1/0.1, GE2/1/0.2, and GE2/1/0.3.
  • GE1/1/0.1 is connected to GE2/1/0.1
  • GE1/1/0.2 is connected to GE2/1/0.2
  • GE1/1/0.3 Connected to GE2/1/0.3.
  • Network node B also includes physical interface GE2/2/0.
  • Physical interface GE2/2/0 includes three sub-interfaces, namely GE2/2/0.1, GE2/2/0.2 and GE2/2/0.3.
  • Network node C includes physical interface GE3/2/0, and physical interface GE3/2/0 includes three sub-interfaces, namely GE3/2/0.1, GE3/2/0.2, and GE3/2/0.3.
  • GE3/2/0.1 is connected to GE2/2/0.1
  • GE3/2/0.2 is connected to GE2/2/0.2
  • GE3/2/0.3 is connected to GE2/2/0.3.
  • the mapping relationship between network slices and interfaces is configured on network node A, network node B, and network node C, with three logical interfaces GE1/1/0.1 under the physical interface GE1/1/0 of network node A, Take GE1/1/0.2 and GE1/1/0.3 as an example.
  • the slice ID bound to GE1/1/0.1 is 1
  • the slice ID bound to GE1/1/0.2 is 2
  • the slice ID bound to GE1/1/0.3 is 3.
  • Network node A stores the mapping relationship shown in Table 1.
  • mapping relationship between interfaces and VLANs on network node A, network node B, and network node C configure the mapping relationship between interfaces and VLANs on network node A, network node B, and network node C.
  • the three logical interfaces GE1/1/0.1, GE1/1/ under the physical interface GE1/1/0 of network node A are configured.
  • 0.2, GE1/1/0.3 is used as an example.
  • the VLAN ID bound to GE1/1/0.1 is 10
  • the VLAN ID bound to GE1/1/0.2 is 20
  • the VLAN ID bound to GE1/1/0.3 is 30.
  • the mapping relationship table shown in Table 2 is stored on network node A.
  • network node B can store the mapping relationships in Table 3 and Table 4 below.
  • the solution of the embodiment of the present application may include the following steps S1-S3.
  • Network node A serves as the head node of the slice tunnel.
  • network node A queries the local routing table according to the destination address of the service packet, obtains the outbound interface GE1/1/0, and then obtains the outbound interface GE1/1/0 based on the outbound interface and slice identifier. 1Query Table 1 above to obtain the logical sub-interface GE1/1/0.1. Since GE1/1/0.1 is a logical interface, there is no interface entity.
  • Network node A obtains the VLAN ID associated with the sub-interface by querying Table 2, which is 10, and uses the VLAN ID to encapsulate the service packet, obtains the first packet including the VLAN ID, and forwards the first packet to network node B.
  • network node B After receiving the first message through physical interface GE2/1/0, network node B parses the first message and obtains that the VLAN ID included in the first message is 10, and further queries Table 4 to obtain the received message.
  • the logical sub-interface information of the packet is GE2/1/0.1, and then query Table 3 to obtain the value of the slice identifier associated with the sub-interface, which is 1.
  • Network node B matches the local routing table according to the destination address of the first message, and obtains that the outbound interface for forwarding the message is interface GE2/2/0, and then queries Table 3 based on outbound interface GE2/2/0 and slice identifier 1. , obtain the logical sub-interface GE2/2/0.1. Since GE2/2/0.1 is a logical interface, there is no interface entity. Network node B obtains that the VLAN identifier associated with the sub-interface is 100 by querying Table 4. Therefore, network node B replaces VLAN identifier 100 with VLAN identifier 10 in the first message, obtains the second message, and replaces the second message with Forwarded to network node C.
  • mapping relationship between network slices and VLANs is configured on network node A, network node B, and network node C. Taking the physical interface GE1/1/0 of network node A as an example. Network node A stores the mapping relationship shown in Table 5.
  • network node B can store the mapping relationship in Table 6 below.
  • the solution of the embodiment of the present application may include the following steps S4-S6:
  • Network node A serves as the head node of the slice tunnel.
  • network node A queries the local routing table according to the destination address of the service packet, obtains the outbound interface GE1/1/0, and then obtains the outbound interface GE1/1/0 based on the outbound interface and slice identifier.
  • 1 Query Table 5 above to obtain the VLAN ID of 10, and use the VLAN ID to encapsulate the service packet, obtain the first packet including the VLAN ID, and forward the first packet to network node B.
  • network node B After receiving the first message through physical interface GE2/1/0, network node B parses the first message and obtains that the VLAN ID included in the first message is 10, and further queries Table 6 to obtain slices. Identified as 1.
  • Network node B matches the local routing table according to the destination address of the first message, and obtains that the outbound interface for forwarding the message is interface GE2/2/0, and then queries Table 6 based on outbound interface GE2/2/0 and slice identifier 1. , the obtained VLAN ID is 100, so network node B replaces VLAN ID 100 with VLAN ID 10 in the first message, obtains the second message, and forwards the second message to network node C.
  • FIG. 4b is a schematic diagram of another exemplary application scenario provided by an embodiment of the present application.
  • Network node A and network node C are connected through network node B. There is a slice tunnel between network node A and network node C. Network node B is an intermediate node in the slice tunnel.
  • Network node A, network node B and network node C are all configured with FlexE capabilities.
  • the interface used by network node A to communicate with network node B enables the FlexE capability to form a FlexE group1.
  • network node B is used to communicate with network node A.
  • the communication interface enables FlexE capabilities and forms FlexE group1.
  • the interface used by network node B to communicate with network node C enables the FlexE capability to form a FlexE group2.
  • FlexE group1 is divided into 10 time slots, and network node A includes 3 FlexE interfaces, namely FlexE 1/1/129, FlexE 1/1/130, and FlexE 1/1/131.
  • network node B includes 3 FlexE interfaces, FlexE 2/1/129, FlexE 2/1/130, and FlexE 2/1/131.
  • FlexE 2/1/129 is connected to FlexE 1/1/129 and is bound to slice ID 1;
  • FlexE 2/1/130 is connected to FlexE 1/1/130 and is bound to slice ID 2;
  • FlexE 2/1 /131 is connected to FlexE 1/1/131 and bound to slice ID 3.
  • FlexE group2 is divided into 10 time slots, and network node B also includes three other FlexE interfaces, namely FlexE 2/2/139, FlexE 2/2/140, and FlexE 2/2/141.
  • FlexE 2/2/139 occupies time slot 11, Timeslot 12 and timeslot 13 are bound to slice ID 1;
  • FlexE 2/2/140 occupies timeslot 14, timeslot 15, timeslot 16 and timeslot 17, and is bound to slice ID 2;
  • FlexE 2/ 2/141 occupies time slot 18 and time slot 19, and is bound to slice ID 3.
  • Network node A may store the mapping relationship between the following table 1' and the following table 2'.
  • mapping relationship between the following table 3' and the following table 4' can be stored on the network node B.
  • the solution of the embodiment of the present application may include the following steps S7-S9.
  • Network node A serves as the head node of the slice tunnel.
  • network node A queries the local routing table according to the destination address of the service packet, obtains the outbound interface FlexE group1, and then queries the upstream interface based on the outbound interface and slice ID 1.
  • Table 1' obtain the logical sub-interface FlexE1/1/129.
  • Network node B receives the first message from timeslot 1 to timeslot 3 of FlexE group1, and queries table 4' to determine The interface that receives the first message is FlexE2/1/129. Further, network node B queries table 3' and obtains that the slice identifier associated with FlexE2/1/129 is 1.
  • Network node B matches the local routing table based on the destination address of the first message and obtains that the outbound interface for forwarding the message is Flex E group2. Then it queries table 3' based on the outbound interface Flex E group2 and slice identifier 1 to obtain the forwarding service.
  • the logical interface is FlexE2/2/139. It can be seen from Table 4' that because there is a binding relationship between interface FlexE2/2/139 and timeslot 11 to timeslot 13 in FlexE Group2, when network node B sends data packets at the PHY layer, it starts over and over again through cyclic polling. The first message is filled into time slots 11 to 13, thereby sending the first message to network node C.
  • mapping relationship between network slices and clients is configured on network node A, network node B, and network node C. Taking the physical interface GE1/1/0 of network node A as an example. Network node A stores the mapping relationship shown in Table 5'.
  • network node B can store the mapping relationship shown in Table 6' below.
  • the solution of the embodiment of this application may include the following S10-S12.
  • Network node A serves as the head node of the slice tunnel.
  • network node A queries the local routing table according to the destination address of the service packet, obtains the outbound interface FlexE group1, and then queries the upstream interface based on the outbound interface and slice identifier 1.
  • Table 5' obtains time slots 1 to 3. Therefore, when network node A sends a data message at the physical (PHY) layer, it fills the first message into time slots 1 to 3 through cyclic polling. In time slot 3, the first message is sent to network node B.
  • PHY physical
  • Network node B receives the first message from timeslot 1 to timeslot 3 of FlexE group1, and queries table 6’ to determine that the slice identifier is 1.
  • Network node B matches the local routing table according to the destination address of the first message, and obtains that the outbound interface for forwarding the message is Flex E group2, and then queries table 6' according to the outbound interface Flex E group2 and slice identifier 1 to obtain timeslot 11 to time slot 13, so when network node B sends a data message at the PHY layer, it fills the first message into time slots 11 to 13 over and over again through cyclic polling, thereby sending the first message to Network node C.
  • FIG. 4c is a schematic diagram of another exemplary application scenario provided by an embodiment of the present application.
  • Network node A and network node C are connected through network node B. There is a slice tunnel between network node A and network node C. Network node B is an intermediate node in the slice tunnel.
  • Network node B can communicate with network interface A through interface 1/1/1 and interface 1/1/2.
  • Interface 1/1/1 is associated with flexible algorithm 128, and interface 1/1/2 is associated with flexible algorithm 129.
  • Network node B can communicate with network interface C through interface 2/2/1 and interface 2/2/2.
  • Interface 2/2/1 is associated with flexible algorithm 128, and interface 2/2/2 is associated with flexible algorithm 129.
  • network device C its interface that supports flexible algorithm 128 and its interface that supports flexible algorithm 129 share the same network prefix.
  • the locator of network node C is: 2001:1::/64.
  • the routing table corresponding to the slice network corresponding to the flexible algorithm 128 is stored in network node B, and the identifier of the routing table is 100; the routing table corresponding to the slice network corresponding to the flexible algorithm 129 is stored in network node B.
  • the identifier of the routing table is 100. 200.
  • the routing table 100 includes the corresponding relationship between the prefix 2001:1::/64, the outbound interface 2/2/1 and the next hop network node C; the routing table 200 includes the prefix The corresponding relationship between 2001:1::/64, outbound interface 2/2/2 and next-hop network node C.
  • the network node B also stores the corresponding relationship between interface 1/1/1 and the routing table identifier 100, and the corresponding relationship between the interface 1/1/2 and the routing table identifier 200.
  • network node B When network node B receives the first message from interface 1/1/1, it can determine the route corresponding to the slice network corresponding to flexible algorithm 128 based on the correspondence between interface 1/1/1 and the routing table identifier 100 table, and search the routing table corresponding to the slice network corresponding to flexible algorithm 128 according to the destination address of the first message. For example, when the destination address of the first message matches the prefix 2001:1::/64, the outbound interface can be determined is 2/2/1, and further forwards the first message through the outbound interface 2/2/1.
  • FIG. 4d is a schematic diagram of another exemplary application scenario provided by an embodiment of the present application.
  • Network node A and network node C are connected through network node B. There is a slice tunnel between network node A and network node C. Network node B is an intermediate node in the slice tunnel.
  • Network node B can communicate with network interface A through interface 1/1/1 and interface 1/1/2.
  • the global ID associated with interface 1/1/1 is 100
  • the global ID associated with interface 1/1/2 is 200.
  • the network node B stores the corresponding relationship between interface 1/1/1 and the global identifier 100, and the corresponding relationship between the interface 1/1/2 and the global identifier 200.
  • Network node B can communicate with network interface C through interface 2/2/1 and interface 2/2/2.
  • Interface 2/2/1 is associated with global identity 100
  • interface 2/2/2 is associated with global identity 200.
  • network device C its interface corresponding to global identifier 100 and its interface corresponding to global identifier 200 share the same network prefix.
  • the locator of network node C is: 2001:1::/64.
  • network node B stores a routing table corresponding to the slice network corresponding to the global identifier 100, and the identifier of the routing table is 100; network node B stores a routing table corresponding to the slice network corresponding to the global identifier 200, and the routing table has The ID is 200.
  • the network node B also stores the corresponding relationship between the global identifier 100 and the routing table identifier 100, and the corresponding relationship between the global identifier 200 and the routing table identifier 200.
  • the routing table 100 includes the corresponding relationship between the prefix 2001:1::/64, the outbound interface 2/2/1 and the next hop network node C; the routing table 200 Including the correspondence between prefix 2001:1::/64, outbound interface 2/2/2, and next-hop network node C.
  • network node B When network node B receives the first message from interface 1/1/1, it can determine the global identity 100 based on the correspondence between interface 1/1/1 and the global identity 100, and further determine the global identity 100 based on the global identity 100 and Correspondence between routing table identifiers 100, determine the routing table corresponding to the slice network corresponding to the global identifier 100, and search for the routing table corresponding to the slice network corresponding to the global identifier 100 according to the destination address of the first message. For example, when the first When the destination address of the packet matches the prefix 2001:1::/64, it can be determined that the outbound interface is 2/2/1, and the first packet is further forwarded through the outbound interface 2/2/1.
  • the embodiment of the present application also provides a message processing device, which can be applied to the second network node and used to execute the second network node provided by the above method embodiment.
  • the message processing method performed by the network node.
  • FIG. 5 is a schematic structural diagram of a message processing device provided by an embodiment of the present application.
  • the message processing device 500 shown in Figure 5 includes: a receiving unit 501, a processing unit 502 and a sending unit 503.
  • the receiving unit 501 is configured to receive the first message sent by the first network node through the link corresponding to the first slice through the first interface of the second network node.
  • the processing unit 502 is configured to determine the slice information of the first slice according to the interface information of the first interface.
  • the slice information is used to indicate the first slice.
  • the first packet does not include the slice information. a slice identifier of the first slice; and determining, according to the slice information, forwarding information for forwarding the first packet to a third network node.
  • the sending unit 503 is configured to forward the first message to the third network node through the forwarding information.
  • the interface information of the first interface includes: a first virtual LAN VLAN identifier corresponding to the first interface, and the first message includes the first VLAN identifier.
  • determining the slice information of the first slice according to the interface information of the first interface includes: determining the first slice according to the first VLAN identifier and the first corresponding relationship.
  • a slice identifier of a slice, and the first correspondence includes a correspondence between the first VLAN identifier and the slice identifier.
  • the determining the slice information of the first slice according to the interface information of the first interface includes: determining the interface identifier of the first interface according to the first VLAN identifier; The slice identifier of the first slice is determined according to the interface identifier of the first interface and a second correspondence relationship, where the second correspondence relationship includes a correspondence relationship between the interface identifier and the slice identifier.
  • determining the forwarding information of forwarding the first message to a third network node according to the slice information includes: determining to forward the first message according to the slice information and a third corresponding relationship.
  • the second VLAN identifier of the first message, the third corresponding relationship includes the corresponding relationship between the slice information and the second VLAN identifier;
  • the sending unit 503 is configured to: according to the second VLAN identifier and the first message to obtain a second message including the second VLAN identifier; and forward the second message.
  • the third correspondence includes: a correspondence between the slice information and the second interface, and a correspondence between the second interface and the second VLAN identifier,
  • the second interface is an interface corresponding to the second VLAN identifier and the slicing information.
  • the interface information of the first interface includes: first time slot information corresponding to the first interface, and the first time slot information is used to indicate the first client identifier or the first client identifier.
  • a time slot group, the first client identifier corresponds to the first time slot group.
  • determining the slice information of the first slice according to the interface information of the first interface includes: determining the first slot information and a fourth corresponding relationship.
  • the slice identifier of the first slice, and the fourth corresponding relationship includes the corresponding relationship between the first time slot information and the slice identifier.
  • determining the slice information of the first slice according to the interface information of the first interface includes: determining an interface identifier of the first interface according to the first timeslot information. ; Determine the slice identifier of the first slice according to the interface identifier of the first interface and a fifth correspondence relationship, where the fifth correspondence relationship includes a correspondence relationship between the interface identifier and the slice identifier.
  • determining the forwarding information of forwarding the first message to a third network node according to the slice information includes: determining to forward the first message according to the slice information and a sixth correspondence relationship.
  • the second time slot information of the first message, the second time slot information is used to indicate a second client identification or a second time slot group, the second client identification corresponds to the second time slot group, and the second time slot information is used to indicate a second client identification or a second time slot group.
  • the six corresponding relationships include the corresponding relationship between the slice information and the second time slot information; the sending unit 503 is configured to forward the third network node to the third network node through the second time slot group.
  • the sixth correspondence includes: a correspondence between the slice information and the third interface, and a correspondence between the third interface and the second timeslot information.
  • the third interface is an interface corresponding to the slice information and the second timeslot information.
  • the interface information of the first interface includes: an interface identifier of the first interface, and the processing unit 502 is configured to: determine the The first routing table corresponding to the first slice; determining an outbound interface for forwarding the first message to the third network node according to the destination address of the first message and the first routing table.
  • determining the first routing table corresponding to the first slice according to the interface identifier of the first interface includes: according to the interface identifier of the first interface and a seventh corresponding relationship , determine the first routing table, and the seventh correspondence includes a correspondence between the interface identifier of the first interface and the identifier of the first routing table.
  • the first slice is a slice corresponding to a flexible algorithm.
  • determining the first routing table corresponding to the first slice according to the interface identifier of the first interface includes: determining the first routing table according to the interface identifier of the first interface.
  • the global identifier of the interface the global identifier is used to identify the first slice; the first routing table is determined according to the global identifier.
  • determining the first routing table according to the global identifier includes: determining the first routing table according to the global identifier and an eighth correspondence, and the eighth correspondence The relationship includes a corresponding relationship between the global identifier and the identifier of the first routing table.
  • the global identifier of the first interface includes: a slice identifier associated with the first interface; or a flexible algorithm identifier associated with the first interface; or, the first interface The associated multi-topology MT identifier.
  • Figure 6 is a schematic structural diagram of a device provided by an embodiment of the present application.
  • the device 600 includes: a processor 610 , a communication interface 620 and a memory 630 .
  • the number of processors 610 in the device 600 may be one or more. In FIG. 6 , one processor is taken as an example. Examples of this application , the processor 610, the communication interface 620 and the memory 630 may be connected through a bus system or other means. In FIG. 6, the connection through the bus system 640 is taken as an example.
  • the processor 610 may be a central processing unit (CPU), a network processor (NP), or a combination of CPU and NP.
  • the processor 610 may further include hardware chips.
  • the above-mentioned hardware chip can be an application-specific integrated circuit (ASIC), a programmable logic device (PLD) or a combination thereof.
  • the above-mentioned PLD can be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a general array logic (GAL) or any combination thereof.
  • the memory 630 may include volatile memory (English: volatile memory), such as random-access memory (random-access memory, RAM); the memory 630 may also include non-volatile memory (English: non-volatile memory), such as fast memory. Flash memory (English: flash memory), hard disk drive (HDD) or solid-state drive (SSD); the memory 630 may also include a combination of the above types of memory.
  • the memory 630 may, for example, store each corresponding relationship mentioned in the above method embodiment, such as storing the first corresponding relationship, the second corresponding relationship, and so on.
  • the memory 630 stores an operating system and programs, executable modules or data structures, or a subset thereof, or an extended set thereof, where the program may include various operating instructions for implementing various operations.
  • the operating system may include various system programs that are used to implement various basic services and handle hardware-based tasks.
  • the processor 610 can read the program in the memory 630 to implement the message processing method provided by the embodiment of the present application.
  • the bus system 640 may be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc.
  • PCI peripheral component interconnect
  • EISA extended industry standard architecture
  • the bus system 640 can be divided into an address bus, a data bus, a control bus, etc. For ease of presentation, only one thick line is used in Figure 6, but it does not mean that there is only one bus or one type of bus.
  • Embodiments of the present application also provide a computer-readable storage medium, which includes instructions or computer programs that, when run on a computer, cause the computer to execute the message processing method provided in the above embodiments.
  • Embodiments of the present application also provide a computer program product containing instructions or computer programs, which when run on a computer causes the computer to execute the message processing method provided in the above embodiments.
  • the disclosed systems, devices and methods can be implemented in other ways.
  • the device embodiments described above are only illustrative.
  • the division of units is only a logical service division.
  • the coupling or direct coupling or communication connection between each other shown or discussed may be through some interfaces, and the indirect coupling or communication connection of the devices or units may be in electrical, mechanical or other forms.
  • a unit described as a separate component may or may not be physically separate.
  • a component shown as a unit may or may not be a physical unit, that is, it may be located in one place, or it may be distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.
  • each business unit in various embodiments of this application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the above integrated units can be implemented in the form of hardware or software business units.
  • Integrated units may be stored in a computer-readable storage medium when implemented in the form of software business units and sold or used as independent products.
  • the technical solution of the present application is essentially or contributes to the existing technology, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is 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 of various embodiments of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program code. .
  • Computer-readable media includes computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another.
  • Storage media can be any available media that can be accessed by a general purpose or special purpose computer.

Landscapes

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

Abstract

Est divulgué dans les modes de réalisation de la présente demande un procédé de traitement de messages. Le procédé comprend les étapes suivantes : un deuxième nœud de réseau permet de recevoir, au moyen d'une première interface du deuxième nœud de réseau, un premier message, qui est envoyé par un premier nœud de réseau au moyen d'une liaison correspondant à une première tranche, le premier message ne comprenant pas d'identifiant de tranche de la première tranche ; après la réception du premier message, le deuxième nœud de réseau détermine des informations de tranche de la première tranche selon des informations d'interface de la première interface, les informations de tranche étant utilisées pour indiquer la première tranche ; et après la détermination des informations de tranche, le deuxième nœud de réseau permet de déterminer, selon les informations de tranche, des informations de transfert concernant le transfert du premier message à un troisième nœud de réseau, puis transfère le premier message au troisième nœud de réseau au moyen des informations de transfert déterminées. Il peut être constaté à partir de ceci, en utilisant la solution, qu'un deuxième nœud de réseau peut réaliser un transfert de tranche sans transporter un identifiant de tranche dans un premier message, et que le deuxième nœud de réseau peut transférer le premier message par utilisation rationnelle d'une ressource de tranche de la première tranche.
PCT/CN2023/103150 2022-09-14 2023-06-28 Procédé et appareil de traitement de messages WO2024055682A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN202211117704.8 2022-09-14
CN202211117704 2022-09-14
CN202211457513.6A CN117714288A (zh) 2022-09-14 2022-11-21 一种报文处理方法及装置
CN202211457513.6 2022-11-21

Publications (1)

Publication Number Publication Date
WO2024055682A1 true WO2024055682A1 (fr) 2024-03-21

Family

ID=90146718

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/103150 WO2024055682A1 (fr) 2022-09-14 2023-06-28 Procédé et appareil de traitement de messages

Country Status (2)

Country Link
CN (1) CN117714288A (fr)
WO (1) WO2024055682A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112491713A (zh) * 2019-09-11 2021-03-12 华为技术有限公司 一种数据传输的控制方法及装置
WO2021110894A1 (fr) * 2019-12-04 2021-06-10 Koninklijke Kpn N.V. Fourniture d'interface entre gestion de réseau et gestion de tranche
CN113923161A (zh) * 2021-10-08 2022-01-11 新华三信息安全技术有限公司 一种报文转发方法及装置
CN114826918A (zh) * 2021-01-29 2022-07-29 华为技术有限公司 一种报文转发的方法、报文处理方法及设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112491713A (zh) * 2019-09-11 2021-03-12 华为技术有限公司 一种数据传输的控制方法及装置
WO2021110894A1 (fr) * 2019-12-04 2021-06-10 Koninklijke Kpn N.V. Fourniture d'interface entre gestion de réseau et gestion de tranche
CN114826918A (zh) * 2021-01-29 2022-07-29 华为技术有限公司 一种报文转发的方法、报文处理方法及设备
CN113923161A (zh) * 2021-10-08 2022-01-11 新华三信息安全技术有限公司 一种报文转发方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
HUAWEI: "Support of Network Slice Discovery", 3GPP DRAFT; R3-162462 SUPPORT OF NETWORK SLICE DISCOVERY, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG3, no. Sophia Antipolis, France; 20161010 - 20161014, 6 October 2016 (2016-10-06), Mobile Competence Centre ; 650, route des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France , XP051152110 *

Also Published As

Publication number Publication date
CN117714288A (zh) 2024-03-15

Similar Documents

Publication Publication Date Title
WO2020182150A1 (fr) Procédé, appareil, dispositif et système de traitement de message
WO2020164473A1 (fr) Procédé, appareil et dispositif de calcul de chemin
US8954992B2 (en) Distributed and scaled-out network switch and packet processing
JP6881861B2 (ja) パケット処理方法および装置
WO2020236269A1 (fr) Système et procédé conçus pour faciliter l'utilisation efficace d'un tampon de sortie dans un contrôleur d'interface de réseau (nic)
JP2021530912A (ja) ネットワークスライス制御方法及び装置、コンピュータ読み取り可能な記憶媒体
CN107113241B (zh) 路由确定方法、网络配置方法以及相关装置
EP3723329A1 (fr) Procédé, n ud, et système de transmission de données
WO2019000866A1 (fr) Procédé de traitement de données et passerelle de l'internet des objets (ido)
WO2021043232A1 (fr) Procédé par lequel des exigences de performance de réseau hôte peuvent être programmées, dispositif et système
JP2022537296A (ja) Ｅｖｐｎメッセージ転送方法、システム、記憶媒体及び端末
WO2023116580A1 (fr) Procédé et appareil de commutation de trajet, dispositif de réseau et système de réseau
WO2022078297A1 (fr) Procédé de transfert de paquets, procédé d'envoi de paquets, dispositif et support lisible par ordinateur
WO2021244356A1 (fr) Procédé et appareil de transmission de données
WO2024159962A1 (fr) Procédé et appareil de mise en miroir de trafic pour instance virtuelle, plateforme de machine virtuelle et support de stockage
JP2024504466A (ja) パケット転送方法、パケット処理方法、およびデバイス
WO2024055682A1 (fr) Procédé et appareil de traitement de messages
CN114978986B (zh) 一种数据传输方法、装置及存储介质
WO2021213382A1 (fr) Procédé et appareil de transmission de données
CN116938829A (zh) 一种数据转发方法及相关设备
CN113132273B (zh) 一种数据转发方法及装置
WO2019233381A1 (fr) Procédé et appareil de traitement de données de plan utilisateur
TW200402969A (en) System and method of annotating network packets
US10805436B2 (en) Deliver an ingress packet to a queue at a gateway device
CN110958185A (zh) 基于业务的QoS配置方法及装置

Legal Events

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

Ref document number: 23864421

Country of ref document: EP

Kind code of ref document: A1