WO2021197141A1 - 业务处理方法、装置、设备及存储介质 - Google Patents

业务处理方法、装置、设备及存储介质 Download PDF

Info

Publication number
WO2021197141A1
WO2021197141A1 PCT/CN2021/082399 CN2021082399W WO2021197141A1 WO 2021197141 A1 WO2021197141 A1 WO 2021197141A1 CN 2021082399 W CN2021082399 W CN 2021082399W WO 2021197141 A1 WO2021197141 A1 WO 2021197141A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
transmission path
identifier
compression
network
Prior art date
Application number
PCT/CN2021/082399
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 KR1020227037671A priority Critical patent/KR20220159456A/ko
Priority to EP21780960.7A priority patent/EP4131870A4/en
Publication of WO2021197141A1 publication Critical patent/WO2021197141A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/06—Deflection routing, e.g. hot-potato 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/34—Source 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/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/04—Protocols for data compression, e.g. ROHC

Definitions

  • This application relates to the field of communication technology, for example, to a service processing method, device, equipment, and storage medium.
  • Segment Routing is an extended source routing technology. It has defined SR-MPLS based on the Multi-Protocol Label Switching (MPLS) forwarding plane and Internet Protocol version 6 (Internet Protocol). Version 6, IPv6) Two standard SR mechanisms of SR-IPv6 (SRv6) on the forwarding plane. Among them, the SRv6 mechanism is to newly define the extended segment routing header (SRH) in the IPv6 extended routing header. SRH is composed of a series of segment routing identifiers (Segment Identifier, SID), and the SID is used to identify the message The network node or the combination of the network node and the transmission link through which the transmission passes. The SID corresponding to the same transmission path is stored in a segment routing list, and the SRH can carry multiple segment routing lists.
  • SID Segment Identifier
  • SRH In an SRv6 network, SRH usually needs to carry more than 10 segment routing lists, and each segment routing list includes multiple SIDs.
  • the length of the SID is mainly 128 bits, and the length of the segment routing list of SRH alone exceeds 160 bytes.
  • the present application provides a service processing method, device, equipment, and storage medium, which reduce the requirements for hardware while reducing packaging overhead.
  • SRv6 network Provides a service processing method, applied to SRv6 network, including:
  • the target node determines the transmission path of the service message from the source node to the target node; compress the network identification of each node in the multiple nodes on the transmission path to obtain the compressed identification of each node; Compress the identifier, and transmit the service message on the transmission path.
  • a service processing device is also provided, which is applied to an SRv6 network, including:
  • the path determination module is set to determine the transmission path of the service message from the source node to the target node according to the service request; the compression module is set to compress the network identification of each node in the multiple nodes on the transmission path to obtain the each The compression identifier of each node; the transmission module is configured to transmit the service message on the transmission path according to the compression identifier of each node.
  • a device including:
  • One or more processors comprising: a memory, configured to store one or more programs; when the one or more programs are executed by the one or more processors, the one or more processors are allowed to implement the above Business processing methods.
  • a storage medium is also provided, on which a computer program is stored, and when the program is executed by a processor, the above-mentioned service processing method is realized.
  • FIG. 1 is a flowchart of a service processing method provided by an embodiment of the application
  • FIG. 2 is a flowchart of another service processing method provided by an embodiment of the application.
  • FIG. 3 is a schematic structural diagram of a common SID provided by an embodiment of this application.
  • FIG. 4 is a schematic diagram of a transmission path provided by an embodiment of the application.
  • FIG. 5 is a schematic diagram of an encapsulation format corresponding to the transmission path shown in FIG. 4;
  • FIG. 6 is a schematic diagram of another transmission path provided by an embodiment of the application.
  • FIG. 7 is a schematic diagram of an encapsulation format corresponding to the transmission path shown in FIG. 6;
  • FIG. 8 is a structural diagram of a service processing apparatus provided by an embodiment of this application.
  • FIG. 9 is a structural diagram of a device provided by an embodiment of the application.
  • Figure 1 is a flowchart of a service processing method provided by an embodiment of the application. This embodiment is applicable to service processing. By compressing the network identifiers of multiple nodes on the transmission path, the encapsulation generated during the transmission of service packets is reduced. Overhead. This method is applied to SRv6 network. The method can be executed by a business processing device, which can be implemented in software and/or hardware, and is generally integrated in a computer, tablet, etc. With reference to Figure 1, the method includes the following steps:
  • S110 Determine the transmission path of the service message from the source node to the target node according to the service request.
  • the service request can be regarded as a service transmission request, and the service transmission is usually transmitted in the form of a service message.
  • the transmission request may only perform the forwarding of the business message, or may perform a specified operation on the business message during the forwarding process of the business message, such as modifying the business message or counting the business message.
  • the service request may include information such as the source node, the target node of the service, and the intermediate nodes through which the service passes.
  • the source node, target node, and intermediate node can be considered as network equipment in the SRv6 network.
  • the source node is the network equipment that initially sends the service
  • the target node is the network equipment that finally receives the service
  • the intermediate node is the network equipment that the service passes from the source node to the target node.
  • intermediate nodes may or may not exist.
  • the transmission path can also carry corresponding links.
  • node B can pass through the port 1 Transmit business packets to node E, or transmit business packets to node E through port 2.
  • the designated transmission link such as transmission through port 2
  • the network identifier is used to uniquely identify the network node or the combination of the network node and the transmission link.
  • the transmission link between multiple network nodes in the transmission path is fixed and unique, it can only identify the network node.
  • the network identification may be expressed as SID, and the number of SIDs is the same as the number of network nodes included in the transmission path.
  • the transmission path of the service message is usually stored in the message header in the form of a list.
  • the message header generally carries multiple lists, and each list contains multiple SIDs.
  • the length of the SID is mainly 128 bits, which leads to a longer length of the message header, and a large encapsulation overhead is generated when the encapsulation message header and the message body obtain the service message.
  • the hardware in the network due to the long message header, which makes the service message longer, the hardware in the network usually cannot complete the reading of the service message in one cycle, and can only read it in a loop, thus reducing the throughput. For this reason, this embodiment compresses the SID corresponding to each node on the transmission path to obtain a compressed SID.
  • the length of the compressed SID is less than the length of the ordinary SID, thereby reducing the length of the message header.
  • the encapsulation overhead is reduced when the message is sent.
  • the length of the service message is reduced, so that the network hardware can complete the reading of the service message in one cycle, which reduces the hardware requirements.
  • the common SID is a 128-bit SID.
  • the common SIDs of multiple nodes in the transmission path have a common prefix
  • the common SID parts other than the common prefix can be regarded as corresponding to each node.
  • Compress the SID Compressed SID plus a common prefix can get ordinary SID.
  • a compression function or a mapping function can be used to obtain the compressed SID.
  • the embodiment does not limit the types of the compression function and the mapping function.
  • the compression function may adopt Hash, and the mapping function may adopt Mapping. Multiple common SIDs in the same transmission path use the same compression method. When encapsulating, you only need to save the compressed SID into the corresponding list, and then put it into the message header.
  • the common SID can also be compressed in other ways, which is not limited in this embodiment.
  • flag bits can be defined in the message header.
  • the positions that can be used for marking include the Flags and Tag of the message header and the optional Type-Length-Value (Type-Length-Value). , TLV), the way to define the logo can be customized, for example, the SID format type indication can be used, the format type includes ordinary 128bit, compression format n, etc., where n represents the number of compression methods, for example, there are two compression methods , Then these two compression methods are respectively denoted as compression format 1 and compression format 2.
  • the list of message headers carries path information.
  • the path information includes the address information of the network node passing through and compressed SID information.
  • the compressed SID information includes the length and compression format of the compressed SID. According to the path information carried in the message header, the forwarding of the service message is realized. If you need to perform other operations on the service message during the transmission of the service message, for example, when the service message is transmitted to node D, terminate the Layer 3 Virtual Private Network (L3VPN) with the instance number of 88 For services, you can also store node D and the operation identifier corresponding to the L3VPN service with instance number 88 in the message header list.
  • L3VPN Layer 3 Virtual Private Network
  • the operation of the service where the operation performed on the service message at the designated node can be a conventional L2VPN/L3VPN operation, or it can be a self-defined operation through programming.
  • the embodiment of the application provides a service processing method, which determines the transmission path of the service message from the source node to the target node according to the service request; compresses the network identifier of each node on the transmission path to obtain the compressed identifier; Identification, transmitting the service message on the transmission path.
  • the above method reduces the length of the network identifier by compressing the network identifier of each node on the transmission path, reduces the encapsulation overhead in the process of transmitting service messages based on the compressed identifier, and the length of the network identifier The reduction reduces the length of the business message, reduces the hardware requirements when using the hardware to read the business message, and improves the forwarding and processing efficiency of the business message.
  • Fig. 2 is a flowchart of another service processing method provided by an embodiment of the application.
  • S210 Determine the transmission path of the service message from the source node to the target node according to the service request.
  • the common SID is divided into prefix and node information, and the network node or the network node and the transmission link are uniquely identified through the prefix and node information.
  • the node information represents the part of the ordinary SID except the prefix.
  • Fig. 3 which is a schematic diagram of the structure of a general SID provided by an embodiment of the application, and N represents the length of the node information.
  • the expression form of the ordinary SID can be 10::A:0/128, 10:: represents the prefix, :: represents the omission of multiple 0s, and A:0 represents the node information, where A represents the node, and 128 represents the length of the ordinary SID.
  • S230 Determine whether the prefixes of the multiple network identities are the same, if the prefixes of the multiple network identities are the same, execute S240, and if the prefixes of the multiple network identities are different, execute S250.
  • the embodiment of the present application compresses the common SID based on whether the common SIDs of multiple nodes have a common prefix, and obtains the compressed SID.
  • the node information part is directly used as the compressed SID corresponding to the common SID, and the compression method is recorded as compression format 1.
  • this embodiment takes the compressed SID obtained through the compression function as an example, and this compression method is recorded as compression format 2.
  • the network identities of all network nodes contained in the SRv6 network can be compressed in advance, and the common SID and compressed SID can be stored in association, and then directly applied by looking up the table. It can also be selected according to the service transmission requirements.
  • the compression format is compressed.
  • Compressing the ordinary SID can reduce the length of the service message and improve the forwarding efficiency.
  • the compressed SID cannot reflect all the information of the ordinary SID. , May affect the execution of the operation. Therefore, this embodiment divides the compressed SID into a global compressed SID and a local compressed SID.
  • the global compression SID can represent topology-related functions such as End or End.X, and can be applied to the simple transmission of business messages, that is, only the business messages need to be forwarded, and no other operations are required on the business messages.
  • the global compression SID can globally locate each node in the transmission path, and can be used alone, that is, multiple nodes in the transmission path can use the global compression SID.
  • the local compression SID is used to represent complex local functions, such as L3VPN instances or functions related to the service chain. For example, when a node adopts local compression SID, it means that the node can perform L3VPN instances or operations related to the service chain on service packets.
  • the local compressed SID cannot globally locate each node in the transmission path, and usually needs to be used together with the global compressed SID, and the local compressed SID only follows the global compressed SID.
  • both of the aforementioned compression format 1 and compression format 2 may include a global compression SID and a local compression SID.
  • the highest bit of the compressed SID can be used as a sign of the global compressed SID or the local compressed SID. For example, when the highest bit is 0, it means the global compressed SID, and when the highest bit is 1, it means Local compression SID.
  • the global compressed SID is unique in the SRv6 network and has a unified coding format, including two parts: locator and function.
  • Locator is used to locate the corresponding network node of the global compressed SID in the SRv6 network
  • Function is used to represent the specific functions provided by the global compressed SID in the SRv6 network, including network topology-related functions and business-related functions.
  • Locator+Function has global uniqueness. Among them, the length of Locator and Function can be customized.
  • the local compression SID only needs to be unique locally and does not require a unified encoding format.
  • the global compressed SID is also unique in the SRv6 network.
  • the encoding format of the global compressed SID corresponding to multiple nodes can be the same or different.
  • Each node needs to store the global compressed SID and common SID of multiple nodes.
  • Mapping table is used to store the mapping relationship between the global compressed SID and the ordinary SID.
  • the local compressed SID only needs to be unique locally and does not require a unified encoding format.
  • the node corresponding to the local compressed SID only needs to store the mapping table of the local compressed SID and the ordinary SID of the node, and does not need to store the mapping table of the local compressed SID and the ordinary SID of other nodes.
  • S260 Transmit the service message on the transmission path according to the global compression identifier and the local compression identifier; or, transmit the service message on the transmission path according to the global compression identifier.
  • Transmitting the service message on the transmission path includes forwarding the service message on the transmission path, or executing the service message on the service message during the process of forwarding the service message on the transmission path Programming operation.
  • the global compressed SID and the local compressed SID reference may be made to the above-mentioned embodiment, which will not be repeated here.
  • the operation of terminating the L3VPN service with instance number 88 is performed on node D, and the length of the Function part of the global compression SID is 12 bits, and the global compression SID and the local compression SID need to be used in combination.
  • the node D adopts the local compression SID
  • Other nodes use global compression SID.
  • the process of a node performing a specified operation on a service message is called a programmable operation.
  • the second embodiment of the present application provides a service processing method.
  • different compression formats can be used to compress common SIDs to obtain compressed SIDs, reduce encapsulation overhead, and improve service forwarding efficiency.
  • the designated node performs an operation on the business message, and divides the compressed SID into a global compressed SID and a local compressed SID.
  • the business message can be flexibly transmitted when the business message is transmitted. deal with.
  • the transmission includes simple transmission or an operation performed at a node during the transmission process.
  • each node adopts a global compressed SID, and the length of the global compressed SID is 32 bits.
  • FIG. 4 is a schematic diagram of a transmission path provided by an embodiment of the application.
  • A, B, C, D, E, and F are network nodes in the SRv6 network.
  • the solid line represents the transmission link between the network nodes. If there is a solid line between the two network nodes, it represents the connection between the two network nodes. There is only one transmission link, such as A and B, B and C, C and D, A and E, E and F, and F and D. There is only one transmission link between two network nodes.
  • a line indicates that there are multiple transmission links between two network nodes.
  • the transmission link can be specified when the service message is transmitted.
  • the dotted line represents the transmission path of the service message from the source node to the target node.
  • the source node is A and the target node is D.
  • Figure 4 takes the restriction of intermediate nodes B and E as an example, that is, specifies some of the nodes through which the service message passes. According to the association relationship between multiple network nodes in Figure 4, when the service is transmitted to the intermediate node E, it can be automatically determined that the next hop is transmitted to the intermediate node F, and the intermediate node F forwards it to the target node D.
  • the global compression SID corresponding to this compression format has a unified encoding method, which is composed of Locator and Function.
  • the length of the Locator part is 19 bits
  • the length of the Function part is 12 bits.
  • the Locator of multiple network nodes is different.
  • the Locator part represents each node with A, B, C, D, E, and F respectively. When it is necessary to perform an operation on a service packet on a node, the operation can be represented by the corresponding operation identifier in the Function part. If the Function part is 0, it means that the network node only performs forwarding operations on the service packet.
  • Each network node in the SRv6 network advertises the local SID table and routing information to the node.
  • Other network nodes can determine the next hop of the path to the node based on the transmission path, install this routing information into the routing table, and advertise it to the outside.
  • the routing information advertised by network node A is 10::A:0/116
  • network node B calculates the next hop of the path to network node A according to the transmission path, installs the routing information into the routing table, and advertises it to the outside .
  • the process of other network nodes is similar.
  • the local SID table is used to store the operations performed by the business message at this node.
  • the A node is 10::A:0/128.
  • the Function part is 0, which means that the A node only forwards the business message. That is, after the service message reaches the node A, the node A performs the End operation and then transfers to the next hop.
  • the local SID table of node B includes 10::B:0/128, the local SID table of node C includes 10::C:0/128, and the local SID table of node D includes 10::D: 0/128, the local SID table of the E node includes 10::E:0/128, and the local SID table of the F node includes 10::F:0/128.
  • the processor delivers the transmission path information to the source node.
  • the processor delivers the transmission path information to the source node A, where the transmission path information includes the compressed SID information of the constrained node, and the constrained node is
  • the designated transmission nodes for example, the constraint nodes in FIG. 4 are A, B, E, and D.
  • the compressed SID information includes the compression format corresponding to the compressed SID and the compression type, such as global compression or local compression.
  • SA represents the source node, for example, node A (10::A:0) in Figure 4
  • DA represents the source node in the transmission path
  • SL represents a pointer, the type of SID is different, and the meaning of SL minus 1 is different.
  • SL minus 1 means moving the length of 128bit.
  • the length of compressed SID is 32bit
  • SL minus 1 means moving 32bit. length.
  • a 128bit pointer movement mechanism compatible with ordinary SID can also be used, that is, the pointer operation of ordinary SID is still performed in units of 128bit, but the compressed SID operation inside the 128bit pointer is added.
  • Empty SID if all compressed SIDs in 128bit are empty SIDs, then the 128bit pointer is reduced by 1. The former is an example.
  • the number of SLs can be determined according to the number of nodes included in the transmission path.
  • the indicated compressed SID, namely E:0, at this time DA is 10::E:0, query the routing table, get 10::E:0/116, perform the normal forwarding process, and forward the business message from the corresponding interface to the node E.
  • the indicated SID, namely D:0, at this time DA is 10::D:0, query the routing table, get 10::D:0/116, perform the normal forwarding process, and follow the constraint node information shown in Figure 5,
  • the service message needs to be forwarded to node D at node E through the corresponding interface.
  • the service message needs to pass through node F from node E to node D, and there is only one transmission link between node F, node E and node D, so there is no need to restrict node F, and it can still be achieved.
  • Normal transmission of business messages Similar to the previous process, the business message performs a normal forwarding operation at point E, and the business message is forwarded to node F.
  • the node F queries the routing table according to the received DA, and obtains 10::F:0/116, performs a normal forwarding operation, and forwards the service message to the node D from the corresponding interface.
  • all nodes including the transmission link through which the service message passes can also be restricted.
  • the transmission path can also be AB (port 2)- EFD
  • Extract the compressed SID indicated by the pointer after the update, that is, E:0, at this time DA is 10::E:0
  • End.X operation does not need to continue to look up the table, you can directly send business packets from the designated port 2 to avoid Equal-cost multi-path routing (Equal Cost Multi-Path, ECMP) brings path uncertainty.
  • Equal-cost multi-path routing Equal-cost Multi-Path, ECMP brings path uncertainty.
  • the process of forwarding a business message from node E to node F, and then from node F to node D is similar to the process of forwarding a business message from node A to no
  • the function of the global compression SID can be used to represent topology-related operations such as End or End.X, or it can be a simple forwarding operation.
  • the length is still 12bit as an example.
  • Figure 6 is a schematic diagram of another transmission path provided by an embodiment of this application.
  • the transmission path is ABED.
  • the difference from Figure 4 is that Figure 6 requires the L3VPN with the instance number of 88 in the service message from node D to The service executes the termination operation, and CE represents the part with the instance number of 88 in the service message. It is still assumed that the length of the common prefix part of multiple nodes is 96 bits, and the length of the compressed SID is 32 bits.
  • the local SID tables corresponding to node A, node B, node C, node D, node E, and node F respectively include 10::A:0/128, 10::B:0/128, 10::C:0/128 , 10::D:0/128, 10::E:0/128, 10::F:0/128, in addition, the local SID table of node D also includes 10::FFFF:88/128, Represents End.DT4Function, which represents the L3VPN with instance number 88, that is to say, node D performs the termination operation on the L3VPN service with instance number 88.
  • Example 1 for the routing information advertised by each node.
  • FIG. 7 is a schematic diagram of the encapsulation format corresponding to the transmission path shown in FIG. 6.
  • the service message is transmitted to node E and sent by node E
  • node F checks the routing table according to the received DA, and obtains 10::D:0/116, performs a normal forwarding operation, and forwards the business packet from the corresponding interface to node D, and node D according to the received DA Query the local SID table, get 10::D:0/128, execute End operation, subtract 1 from SL, extract the SID indicated by the updated pointer, get FFFF:88, at this time DA is 10::FFFF:88, continue to query the local SID table, get 10::FFFF:88/128, execute End.DT4 operation. Strip the message header and message body, send the message body to VRF88, look up
  • the local compressed SID can be placed at the end of the encapsulation list, indicating VPN, and can also be placed in other positions.
  • the encapsulation list is the table shown in Figure 7.
  • a specified operation can also be performed on node E, for example, when a service packet reaches node E, it needs to pass through the firewall of node E.
  • the local SID table of multiple nodes is based on example 2, and 10::FFFF:1/128 is added to the local SID table of node E to indicate the firewall (FW) function, and the service packets are in multiple nodes
  • the transmission process is similar to the above example, and will not be repeated here.
  • compression format 2 can be used for compression. Assuming that the length of the compressed SID is 32 bits, this example uses the global compressed SID to transmit service packets and use A:0-F:0 respectively. Represents AF to indicate multiple network nodes.
  • the local SID table of the network node corresponding to compression format 2 includes ordinary SID entries, corresponding global compressed SIDs, and a mapping table reflecting the mapping relationship between the two. For example, the local SID table of node A includes 10::1 :0/128, which means the End Function, the corresponding global compressed SID A:0, and the mapping table.
  • the local SID tables of other nodes are similar.
  • the prefix of the routing information advertised by each node is the Locator part of the ordinary SID.
  • the routing information advertised by node A is 10::1:0/64
  • node B The advertised routing information is 20::1:0/64
  • the routing information advertised by node C is 30::1:0/64
  • the routing information advertised by node D is 40::1:0/64
  • the routing information advertised by node E is 40::1:0/64.
  • the routing information is 50::1:0/64
  • the routing information advertised by node F is 60::1:0/64.
  • the compression format which will not be repeated here.
  • the compressed format 2 can also be used to constrain all the nodes through which the service message passes, and the operation of the above example can be performed on the service message at the target node or intermediate node, and the process is similar to that of the compressed format 1.
  • the technical solution of this application is not only applicable to a variety of compression formats, but also when a node performs operations on business messages, it can also use a combination of global compression SID and local compression SID, which improves processing efficiency while ensuring normal business processing .
  • Fig. 8 is a structural diagram of a service processing apparatus provided by an embodiment of this application.
  • the apparatus can execute the service processing method of the foregoing embodiment.
  • the apparatus includes:
  • the path determining module 31 is configured to determine the transmission path of the service message from the source node to the target node according to the service request; the compression module 32 is configured to compress the network identifier of each node on the transmission path to obtain the compressed identifier; transmission module 33. Set to transmit the service message on the transmission path according to the compression identifier.
  • the service processing device determines the transmission path of the service message from the source node to the target node according to the service request; compresses the network identifier of each node on the transmission path to obtain the compressed identifier; according to the compressed identifier , Transmitting the service message on the transmission path.
  • the device compresses the network identifier of each node on the transmission path, reduces the length of the network identifier, reduces the encapsulation overhead in the process of transmitting service messages based on the compressed identifier, and reduces the length of the network identifier, so that the length of the service message is reduced.
  • the length is also reduced, which reduces the hardware requirements when using hardware to read business messages.
  • the compression module 32 is set to:
  • the network identifier includes a prefix and node information; if the prefixes of multiple network identifiers are the same, the node information of the network identifier of each node is taken as the node information of each node Compression ID; if the prefixes of multiple network IDs are different, the network ID of each node is compressed according to the compression function to obtain the compression ID.
  • the compression identifier includes a global compression identifier and a local compression identifier.
  • the transmission module 33 is configured as:
  • the service message is transmitted on the transmission path; or the service message is transmitted on the transmission path according to the global compression identifier; wherein, in the Transmitting the business message on the transmission path includes forwarding the business message on the transmission path, or performing a programmable operation on the business message during the process of forwarding the business message on the transmission path .
  • the service processing apparatus provided in the embodiment of the present application can execute the service processing method in the foregoing embodiment, and has the corresponding functional modules and effects of the execution method.
  • FIG. 9 is a structural diagram of a device provided by an embodiment of the application.
  • the device includes: a processor 41, a memory 42, an input device 43, and an output device 640.
  • the number of processors 41 in the device may be one or more. In FIG. 9, one processor 41 is taken as an example.
  • the processor 41, the memory 42, the input device 43, and the output device 44 can be connected by a bus or other means. In FIG. 9, the connection by a bus is taken as an example.
  • the memory 42 can be configured to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the business processing method in the embodiments of the present application.
  • the processor 41 executes various functional applications and data processing of the device by running the software programs, instructions, and modules stored in the memory 42, that is, realizes the service processing method of the foregoing embodiment.
  • the memory 42 mainly includes a storage program area and a storage data area.
  • the storage program area can store an operating system and an application program required by at least one function; the storage data area can store data created according to the use of the terminal, and the like.
  • the memory 42 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices.
  • the memory 42 may include a memory remotely provided with respect to the processor 41, and these remote memories may be connected to the device through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.
  • the input device 43 may be configured to receive inputted numeric or character information, and generate key signal inputs related to user settings and function control of the device.
  • the output device 44 may include a display device such as a display screen, a speaker, and an audio device such as a buzzer.
  • the device provided in the embodiment of this application and the service processing method provided in the above embodiment belong to the same concept.
  • the embodiment of the present application further provides a storage medium on which a computer program is stored, and when the program is executed by a processor, the service processing method as described in the foregoing embodiment of the present application is implemented.
  • An embodiment of the application provides a storage medium containing computer-executable instructions.
  • the computer-executable instructions are not limited to the operations in the business processing method described above, and can also execute the business processing method provided in any embodiment of the application. The relevant operations in, and have corresponding functions and effects.
  • this application can be implemented by software and necessary general-purpose hardware, or can be implemented by hardware.
  • the technical solution of this application can essentially be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as a computer floppy disk, read-only memory (ROM), random access Memory (Random Access Memory, RAM), flash memory (FLASH), hard disk or optical disk, etc., including multiple instructions to make a computer device (can be a robot, personal computer, server, or network device, etc.) execute the above-mentioned implementation of this application The business processing method described in the example.

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

本文公开了一种业务处理方法、装置、设备及存储介质。该业务处理方法包括：根据业务请求，确定业务报文从源节点到目标节点的传输路径；压缩所述传输路径上多个节点中每个节点的网络标识，得到所述每个节点的压缩标识；根据每个节点的缩标识，在所述传输路径上传输所述业务报文。

Description

业务处理方法、装置、设备及存储介质 技术领域
本申请涉及通信技术领域，例如涉及一种业务处理方法、装置、设备及存储介质。
背景技术
段路由(Segment Routing，SR)是一种扩展的源路由技术，已定义了基于多协议标签交换(Multi-Protocol Label Switching，MPLS)转发面的SR-MPLS和基于互联网协议第6版(Internet Protocol Version 6，IPv6)转发面的SR-IPv6(SRv6)两种标准的SR机制。其中，SRv6机制是在IPv6扩展路由头中新定义扩展的段路由报文头(Segment Routing Header，SRH)，SRH由一系列的段路由标识(Segment Identifier，SID)组成，SID用于标识报文传输经过的网络节点或网络节点与传输链路的组合。同一传输路径对应的SID存储在一个段路由列表中，SRH中可以携带多个段路由列表。
在SRv6网络中，SRH中通常需要携带超过10个段路由列表，每个段路由列表包括多个SID。而SID的长度主要为128bit，仅SRH的段路由列表长度就超过160Byte，在封装报文时，产生较大的封装开销，而且由于SID较长，导致报文长度过长，硬件需要将报文回环读取，无法在一个周期内完成，使得吞吐量降低，影响了业务报文的转发和处理效率。
发明内容
本申请提供一种业务处理方法、装置、设备及存储介质，在减少封装开销的同时降低对硬件的要求。
提供了一种业务处理方法，应用于SRv6网络，包括：
根据业务请求，确定业务报文从源节点到目标节点的传输路径；压缩所述传输路径上多个节点中每个节点的网络标识，得到所述每个节点的压缩标识；根据每个节点的压缩标识，在所述传输路径上传输所述业务报文。
还提供了一种业务处理装置，应用于SRv6网络，包括：
路径确定模块，设置为根据业务请求，确定业务报文从源节点到目标节点的传输路径；压缩模块，设置为压缩所述传输路径上多个节点中每个节点的网络标识，得到所述每个节点的压缩标识；传输模块，设置为根据每个节点的压 缩标识，在所述传输路径上传输所述业务报文。
还提供了一种设备，包括：
一个或多个处理器；存储器，设置为存储一个或多个程序；当所述一个或多个程序被所述一个或多个处理器执行时，使得所述一个或多个处理器实现上述的业务处理方法。
还提供了一种存储介质，其上存储有计算机程序，该程序被处理器执行时实现上述的业务处理方法。
附图说明
图1为本申请实施例提供的一种业务处理方法的流程图；
图2为本申请实施例提供的另一种业务处理方法的流程图；
图3为本申请实施例提供的一种普通SID的结构示意图；
图4为本申请实施例提供的一种传输路径的示意图；
图5为图4所示传输路径对应的封装格式示意图；
图6为本申请实施例提供的另一种传输路径的示意图；
图7为图6所示传输路径对应的封装格式示意图；
图8为本申请实施例提供的一种业务处理装置的结构图；
图9为本申请实施例提供的一种设备的结构图。
具体实施方式
下面结合附图和实施例对本申请进行说明。
图1为本申请实施例提供的一种业务处理方法的流程图，本实施例可适用于处理业务的情况，通过压缩传输路径上多个节点的网络标识，降低业务报文传输过程产生的封装开销。该方法应用于SRv6网络。该方法可以由业务处理装置来执行，该装置可以采用软件和/或硬件的方式实现，并一般集成在计算机、平板等设备中，参考图1，该方法包括如下步骤：
S110、根据业务请求，确定业务报文从源节点到目标节点的传输路径。
业务请求可以认为是业务的传输请求，业务传输通常以业务报文的形式传输。该传输请求可以仅执行业务报文的转发，也可以在业务报文转发过程中对业务报文进行指定操作，例如修改业务报文或对业务报文进行计数等。可选的，业务请求可以包含业务的源节点、目标节点以及传输经过的中间节点等信息。 源节点、目标节点和中间节点可以认为是SRv6网络中的网络设备，源节点是初始发送业务的网络设备，目标节点是最终接收业务的网络设备，中间节点是业务从源节点到目标节点经过的网络设备，实际应用时，中间节点可以存在也可以不存在。
传输路径是基于源节点、中间节点和目标节点生成的传输线路，例如A-B-E-D，表示业务报文从源节点A，经过中间节点B和中间节点E转发至目标节点D。再如，当业务报文传输至中间节点E时，对该业务报文执行计数操作，传输路径可以表示为A-B-(E-100)-D，其中100为计数操作对应的操作标识，不同的操作对应唯一的操作标识。
当传输路径中两个节点之间具有多条链路时，传输路径中还可以携带对应的链路，例如上述传输路径中，B和E之间存在两条链路，即节点B可以通过端口1将业务报文传输至节点E，也可以通过端口2将业务报文传输至节点E，当指定传输链路，例如通过端口2传输时，可以在传输路径中携带对应的链路编号，例如A-(B:2)-E-D。
S120、压缩传输路径上每个节点的网络标识，得到压缩标识。
网络标识用于唯一标识网络节点或者网络节点与传输链路的组合，当传输路径中多个网络节点之间的传输链路固定且唯一时，可以仅标识网络节点，当两个网络节点之间的传输链路不唯一且指定传输链路时，可以将网络节点和传输链路组合。可选的，网络标识可以表示为SID，SID的数量与传输路径中包含的网络节点的数量相同。
在SRv6网络中，业务报文的传输路径通常以列表的形式存入报文头，实际应用时，报文头中一般携带多个列表，每个列表包含多个SID。SID的长度主要为128bit，导致报文头的长度较长，在封装报文头和报文体得到业务报文时产生较大的封装开销。此外，由于报文头较长，使得业务报文较长，网络中的硬件通常无法在一个周期内完成业务报文的读取，只能回环读取，也因此降低了吞吐量。为此，本实施例压缩传输路径上每个节点对应的SID，得到压缩SID，压缩SID的长度小于普通SID的长度，从而降低了报文头的长度，在封装报文头和报文体得到业务报文时降低了封装开销，与此同时，业务报文的长度降低，使得网络的硬件可以在一个周期内完成业务报文的读取，降低了对硬件的要求。普通SID为长度为128bit的SID。
压缩普通SID的方法可以有多种，例如针对一传输路径，当该传输路径中多个节点的普通SID具有共同的前缀时，可以将普通SID中除共同前缀以外的部分作为每个节点对应的压缩SID。压缩SID加上共同的前缀即可得到普通SID。再如，当该传输路径中多个节点的普通SID缺乏相同的前缀时，可以采用压缩 函数或映射函数得到压缩SID。实施例对压缩函数和映射函数的类型不作限定，例如压缩函数可以采用Hash，映射函数可以采用Mapping。同一传输路径中多个普通SID采用的压缩方法相同。封装时只需将压缩SID存入对应列表，再放入报文头即可。还可以采用其他的方式压缩普通SID，本实施例不作限定。
为了便于区分是普通SID还是压缩SID，可以在报文头中定义标志位，其中可以用于标志的位置包括报文头的Flags、Tag以及可选的类型-长度-值(Type-Length-Value，TLV)，定义标志的方式可以自定义，例如可以采用SID格式类型指示的方式，格式类型包括普通128bit、压缩格式n等，其中，n表示的是压缩方法的数量，例如压缩方法有两种，则将这两种压缩方法分别记为压缩格式1和压缩格式2。
S130、根据压缩标识，在传输路径上传输业务报文。
业务报文传输时，报文头的列表中携带了路径信息，路径信息包含所经过网络节点的地址信息和压缩SID信息，压缩SID信息包括压缩SID的长度和压缩格式。根据报文头携带的路径信息，实现业务报文的转发。如果在业务报文传输过程中，需要对该业务报文执行其他操作，例如业务报文传输至节点D时，终结实例号为88的第三层虚拟专用网(Layer 3 Virtual Private Networks，L3VPN)业务，还可以在报文头的列表中存入节点D以及实例号为88的L3VPN业务对应的操作标识，当业务报文到达D节点时，通过解析报文头执行终结实例号为88的L3VPN业务的操作，其中，对业务报文在指定节点执行的操作可以是常规的L2VPN/L3VPN等操作，也可以是通过编程自定义的操作。
本申请实施例提供一种业务处理方法，根据业务请求，确定业务报文从源节点到目标节点的传输路径；压缩所述传输路径上每个节点的网络标识，得到压缩标识；根据所述压缩标识，在所述传输路径上传输所述业务报文。与相关技术相比，上述方法通过对传输路径上每个节点的网络标识进行压缩，降低了网络标识的长度，在基于压缩标识传输业务报文的过程中降低了封装开销，而且网络标识的长度降低，使得业务报文的长度也降低，在利用硬件读取业务报文时降低了对硬件的要求，提升了业务报文的转发和处理效率。
图2为本申请实施例提供的另一种业务处理方法的流程图。
S210、根据业务请求，确定业务报文从源节点到目标节点的传输路径。
S220、获取传输路径上每个节点的网络标识，网络标识包括前缀和节点信息。
本实施例将普通SID分为前缀和节点信息，通过前缀和节点信息唯一标识网络节点或网络节点与传输链路。其中，节点信息表示的是普通SID中除前缀 以外的部分，参考图3，图3为本申请实施例提供的一种普通SID的结构示意图，N表示节点信息的长度。普通SID的表现形式可以是10::A:0/128，10::表示前缀，::表示省略多个0，A:0表示节点信息，其中，A表示节点，128表示普通SID的长度。
S230、判断多个网络标识的前缀是否相同，若多个网络标识的前缀相同，执行S240，若多个网络标识的前缀不相同，执行S250。
可选的，本申请实施例基于多个节点的普通SID是否具备共同的前缀来压缩普通SID，得到压缩SID。当多个节点的普通SID具有共同的前缀时，直接将节点信息部分作为该普通SID对应的压缩SID，并将该种压缩方式记为压缩格式1。当多个节点的普通SID不具有相同的前缀时，本实施例以通过压缩函数得到压缩SID为例，并将该种压缩方式记为压缩格式2。可选的，可以预先将SRv6网络中包含的全部网络节点的网络标识进行压缩，并将普通SID和压缩SID关联存储，后续通过查表直接应用，也可以根据业务传输需求在应用时根据选定的压缩格式压缩。
将普通SID进行压缩，虽然可以降低业务报文的长度，提高转发效率，但当涉及中间操作，例如在一节点对业务报文进行指定功能的操作时，由于压缩SID无法反映普通SID的全部信息，可能会影响操作的执行，因此，本实施例将压缩SID划分为全局压缩SID和本地压缩SID。全局压缩SID可以表示End或者End.X等与拓扑相关的功能，可以适用于业务报文的简单传输，即只需要转发业务报文，不需要对业务报文执行其他操作。全局压缩SID可以全局定位传输路径中的每个节点，而且可以单独使用，即传输路径中的多个节点均可采用全局压缩SID。本地压缩SID用于表示复杂的本地功能，例如L3VPN实例或者跟业务链相关的功能。例如当一节点采用本地压缩SID时，表示在该节点可以对业务报文执行L3VPN实例或者跟业务链相关功能的操作。本地压缩SID无法全局定位传输路径中的每个节点，通常需要和全局压缩SID共同使用，而且本地压缩SID仅跟在全局压缩SID之后。
在仅涉及业务报文简单传输的情况下，可以只采用全局压缩SID，在需要在一节点执行特定功能的操作的情况下，例如在一节点执行L3VPN/EVPN等业务相关功能的操作，可以使仅执行传输功能的节点采用全局压缩SID，执行特定操作的节点采用本地压缩SID，通过全局压缩SID和本地压缩SID结合的方式，在保证业务报文高效传输的同时，又不影响指定操作的执行。上述压缩格式1和压缩格式2均可以包括全局压缩SID和本地压缩SID。为便于区分全局压缩SID和本地压缩SID，可以将压缩SID的最高位作为全局压缩SID或本地压缩SID的标志，例如当最高位为0时，表示全局压缩SID，当最高位为1时，表示 本地压缩SID。
针对压缩格式1，全局压缩SID在SRv6网络唯一，且具有统一的编码格式，包括定位符(Locator)和功能(Function)两部分，Locator用来定位该全局压缩SID在SRv6网络中对应的网络节点，Function用来表示该全局压缩SID在SRv6网络中提供的特定功能，包括网络拓扑相关的功能和业务相关的功能。在SRv6网络中，多个节点对应的Locator均不同，因此，Locator+Function具有全局唯一性，其中，Locator和Function的长度可以自定义。本地压缩SID只需要在本地唯一即可，不需要统一的编码格式。
针对压缩格式2，全局压缩SID在SRv6网络中也具有唯一性，多个节点对应的全局压缩SID的编码格式可以相同也可以不同，每个节点都需要存储多个节点的全局压缩SID和普通SID的映射表。映射表用于存储全局压缩SID和普通SID的映射关系。本地压缩SID只需在本地唯一即可，也不需要统一的编码格式。本地压缩SID对应的节点只需存储本节点的本地压缩SID和普通SID的映射表，不需要存储其他节点本地压缩SID和普通SID的映射表。
S240、将每个节点的网络标识的节点信息作为所述每个节点的压缩标识。
S250、根据压缩函数，压缩每个节点的网络标识，得到压缩标识。
S260、根据全局压缩标识和本地压缩标识，在传输路径上传输业务报文；或者，根据全局压缩标识在传输路径上传输业务报文。
在所述传输路径上传输所述业务报文包括在所述传输路径上转发所述业务报文，或在所述传输路径上转发所述业务报文的过程中对所述业务报文执行可编程的操作。全局压缩SID和本地压缩SID的场景可以参考上述实施例，此处不再赘述。
当需要在一节点对业务报文执行转发以外的指定操作，例如跟L3VPN/EVPN等业务相关的操作，由于跟L3VPN/EVPN等业务相关的操作支持大量的实例数，当全局压缩SID的Function部分的长度不够时，容易导致操作无法正常进行，为此本实施例在全局压缩SID的Function部分的长度不够时，组合使用全局压缩SID和本地压缩SID，保证了操作的顺利执行。示例性的，在节点D执行终结实例号为88的L3VPN业务的操作，全局压缩SID的Function部分的长度为12bit，则需要组合使用全局压缩SID和本地压缩SID，例如节点D采用本地压缩SID，其他节点采用全局压缩SID。实施例将在一节点对业务报文执行指定操作的过程称为可编程的操作。
本申请实施例二提供一种业务处理方法，在SRv6网络中，可以采用不同的压缩格式压缩普通SID，得到压缩SID，减小封装开销，提升业务转发效率，在 此基础上，为了不影响在指定节点对业务报文执行一项操作，将压缩SID划分为全局压缩SID和本地压缩SID，通过全局压缩SID和本地压缩SID的结合，使得业务报文传输时，可以对业务报文进行灵活的处理。
下面通过几个示例描述一下全局压缩SID和本地压缩SID在不同压缩格式下如何实现业务报文的传输，该传输包括简单传输或传输过程中在一节点执行操作。
示例一
在SRv6网络中基于压缩格式1的压缩SID传输业务报文
可选的，每个节点采用全局压缩SID，全局压缩SID的长度为32bit。参考图4，图4为本申请实施例提供的一种传输路径的示意图。A、B、C、D、E和F为SRv6网络中的网络节点，实线表示网络节点之间的传输链路，如果两个网络节点之间存在一条实线，表示两个网络节点之间只有一条传输链路，例如A和B、B和C、C和D、A和E、E和F以及F和D之间均只有一条传输链路，如果两个网络节点之间存在多条实线，表示两个网络节点之间存在多条传输链路，例如B和E之间存在两条传输链路，业务报文传输时可以指定传输链路。虚线表示业务报文从源节点到目标节点的传输路径，图4中源节点为A，目标节点为D。传输时，可以对业务报文经过的部分或全部中间节点进行约束，图4以约束中间节点B和E为例，即指定业务报文经过的部分节点。根据图4中多个网络节点之间的关联关系，业务传输至中间节点E时，可以自动确定下一跳是传输给中间节点F，由中间节点F转发给目标节点D。
假定传输路径中多个节点的普通SID的共同前缀为96bit，则压缩SID的长度为32bit，压缩SID的最高位设置为0，表示全局压缩SID。该种压缩格式对应的全局压缩SID具有统一的编码方式，由Locator和Function组成，示例性的，Locator部分的长度为19bit，Function部分的长度为12bit，多个网络节点的Locator不同，本示例中Locator部分分别以A、B、C、D、E、F来表示每个节点。当需要对业务报文在一节点执行一种操作时，可以在Function部分以对应的操作标识来表示操作，如果Function部分为0，表示该网络节点对业务报文仅执行转发操作。
SRv6网络中每个网络节点向外通告本地SID表以及到达本节点的路由信息，本节点的路由信息为共同前缀加上全局压缩SID的Locator，路由信息的长度为96bit+20bit＝116bit。其他网络节点根据传输路径可以确定到本节点的路径下一跳，并将这条路由信息安装到路由表中，向外通告。例如，网络节点A通告的路由信息为10::A:0/116，网络节点B根据传输路径计算到网络节点A的路径下一跳，并将该路由信息安装到路由表中，向外通告，其他网络节点的过程类似。本地 SID表用于存储业务报文在本节点执行的操作，例如A节点为10::A:0/128，根据前面所述，Function部分为0，表示A节点仅对业务报文进行转发，即业务报文达到A节点后，A节点执行End操作，然后转入下一跳。类似的，B节点的本地SID表中包括10::B:0/128，C节点的本地SID表中包括10::C:0/128，D节点的本地SID表中包括10::D:0/128，E节点的本地SID表中包括10::E:0/128，F节点的本地SID表中包括10::F:0/128。
传输之前，处理器将传输路径信息下发至源节点，以图4为例，处理器将传输路径信息下发至源节点A，其中，传输路径信息包括约束节点的压缩SID信息，约束节点为指定的传输节点，例如图4中约束节点为A、B、E和D，压缩SID信息包括压缩SID对应的压缩格式以及压缩类型如全局压缩还是本地压缩。业务流进入A节点后，对获取的路径信息进行封装。
封装格式参考图5，图5为图4所示传输路径对应的封装格式示意图。压缩格式＝1表示该传输路径中多个节点均采用压缩格式1压缩普通SID，SA表示源节点，例如图4中的节点A(10::A:0)，DA表示传输路径中源节点的下一跳对应的节点，参考图4，SA为节点A(10::A:0)时，DA为节点B(10::B:0)，32bit表示压缩SID的长度。SL表示指针，SID的类型不同，SL减1代表的含义不同，例如对于普通SID，SL减1表示移动128bit的长度，对于压缩SID，例如压缩SID的长度为32bit，SL减1则表示移动32bit的长度。也可以采用兼容普通SID的128bit指针移动机制，即普通SID的指针操作仍然按照128bit为单位进行，但是增加128bit指针内部的压缩SID操作，例如从128bit内部取出当前处理压缩SID后将压缩SID设置为空SID，如果128bit内所有的压缩SID均为空SID，则将128bit指针减1。实施例以前者为例，SL的数量可以根据传输路径所包含节点的数量确定，例如，传输路径包括A、B、E、D四个节点，则SL的数量为3，并且当业务报文在A节点时，SL＝2，当业务报文在B节点时，SL＝1，当业务报文在E节点时，SL＝0。
业务报文到达B节点时，B节点根据收到的DA查询本地SID表，得到10::B:0/128，执行End操作，然后将SL减1，此时SL＝1，提取更新后指针指示的压缩SID，即E:0，此时DA为10::E:0，查询路由表，得到10::E:0/116，执行普通转发过程，将业务报文从对应接口转发给节点E，图4中节点B和节点E之间具有两条等价的传输链路，可以从两条传输链路中传输。业务报文达到节点E后，节点E根据收到的DA查询本地SID表，得到10::E:0/128，执行End操作，并将SL减1，此时SL＝0，提取更新后指针指示的SID，即D:0，此时DA为10::D:0，查询路由表，得到10::D:0/116，执行普通转发过程，按照图5所示的约束节点的信息，业务报文需要在节点E经过对应接口转发给节点D。但根据图4的传输路径可知，业务报文从节点E到节点D需要经过节点F，而 节点F与节点E和节点D之间均只有一条传输链路，因此无需约束节点F，依然可以实现业务报文的正常传输。与前面的过程类似，业务报文在E点执行普通转发操作，将业务报文转发至节点F。节点F根据收到的DA，查询路由表，得到10::F:0/116，执行普通转发操作，将业务报文从对应接口转发给节点D。业务报文到达节点D后，节点D根据收到的DA查询本地SID表，得到10::D:0/128，执行End操作，此时SL＝0，剥离报文头，还原报文体即可得到业务内容。
可选的，还可以对业务报文经过的所有节点包括传输链路进行约束，例如根据图4，业务报文仍然从节点A传输至节点D，则传输路径还可以为A-B(端口2)-E-F-D，当业务报文到达节点B时，B节点根据收到的DA查询本地SID表，得到10::B:2/128，执行End.X操作，然后将SL减1，此时SL＝2，提取更新后指针指示的压缩SID，即E:0，此时DA为10::E:0，End.X操作无需继续查表，可以直接将业务报文从指定的端口2发出，避免了等价多路径路由(Equal Cost Multi-Path，ECMP)带来的路径不确定问题。业务报文从节点E转发至节点F，再由节点F转发至节点D的过程与业务报文从节点A转发至节点B的过程类似，此处不再赘述。
示例二
在SRv6网络中基于压缩格式1的压缩SID对业务报文在指定节点执行L3VPN/EVPN等业务相关的操作
在使用压缩格式1时，全局压缩SID的Function可以用来表示End或End.X等与拓扑相关的操作，也可以为简单的转发操作，长度仍然以12bit为例，对于跟L3VPN/EVPN等业务相关的操作支持大量的实例数，此例Function的长度不够，因此需要组合使用全局压缩SID和本地压缩SID。
参考图6，图6为本申请实施例提供的另一种传输路径的示意图，传输路径为A-B-E-D，与图4不同的是，图6需要在节点D对业务报文中实例号为88的L3VPN业务执行终结操作，CE表示的是业务报文中实例号为88的部分。仍然假定多个节点的共同前缀部分的长度为96bit，压缩SID的长度为32bit。节点A、节点B、节点C、节点D、节点E、节点F对应的本地SID表分别包括10::A:0/128、10::B:0/128、10::C:0/128、10::D:0/128、10::E:0/128、10::F:0/128，除此之外，节点D的本地SID表还包括10::FFFF:88/128，表示End.DT4Function，代表实例号为88的L3VPN，也就是说在节点D对实例号为88的L3VPN业务执行终结操作。每个节点向外通告的路由信息可以参考示例一。
参考图7，图7为图6所示传输路径对应的封装格式示意图。业务报文在节点A、B、E之间的传输过程可以参考示例一，由于图7未对业务报文经过的所有节点进行约束，因此，业务报文传输至节点E后，由节点E发送给节点F， 节点F根据收到的DA查路由表，得到10::D:0/116，执行普通的转发操作，将业务报文从对应接口转发给节点D，节点D根据收到的DA查询本地SID表，得到10::D:0/128，执行End操作，SL减1，提取更新后指针指示的SID，得到FFFF:88，此时DA为10::FFFF:88，继续查询本地SID表，得到10::FFFF:88/128，执行End.DT4操作。剥离报文头和报文体，将报文体发送给VRF88，并在VRF88内查找路由表，将报文发给与VRF88相连的设备。其中，节点D采用的是本地压缩SID。
本地压缩SID除了可以放在封装列表的最后，表示VPN以外，还可以放在其他位置，封装列表为图7所示的表格。例如在图7的基础上，还可以在节点E执行指定操作，例如业务报文到达节点E时需要经过节点E的防火墙。多个节点的本地SID表在示例二的基础上，还需要在节点E的本地SID表中增加10::FFFF:1/128表示防火墙(Fire Wall，FW)Function，业务报文在多个节点之间的传输过程与上述示例类似，此处不再赘述。
示例三
在SRv6网络中基于压缩格式2的压缩SID传输业务报文
当多个网络节点对应的普通SID没有共同的前缀时，可以采用压缩格式2压缩，假定压缩SID的长度为32bit，本示例采用全局压缩SID传输业务报文并以A:0-F:0分别代表A-F来表示多个网络节点。与压缩格式1不同，压缩格式2所对应网络节点的本地SID表包括普通SID表项、对应的全局压缩SID以及反映两者映射关系的映射表，例如节点A的本地SID表包括10::1:0/128，表示End Function、对应的全局压缩SID A:0以及映射表，其他节点的本地SID表类似。
这种方式中每个节点向外通告的路由信息的前缀为普通SID的Locator部分，假设普通SID的Locator长度为64bit，则节点A通告的路由信息为10::1:0/64，节点B通告的路由信息为20::1:0/64，节点C通告的路由信息为30::1:0/64，节点D通告的路由信息为40::1:0/64，节点E通告的路由信息为50::1:0/64，节点F通告的路由信息为60::1:0/64。其他细节以及传输过程可以参考压缩格式，此处不再赘述。
除此之外，利用压缩格式2也可以对业务报文经过的全部节点进行约束、在目标节点或中间节点对业务报文执行上述示例的操作，过程与压缩格式1类似。本申请的技术方案不仅可以适用于多种压缩格式，而且在一节点对业务报文执行操作时，还可以组合使用全局压缩SID和本地压缩SID，在提高处理效率的同时保证了业务的正常处理。
图8为本申请实施例提供的一种业务处理装置的结构图，该装置可以执行 上述实施例的业务处理方法，参考图8，该装置包括：
路径确定模块31，设置为根据业务请求，确定业务报文从源节点到目标节点的传输路径；压缩模块32，设置为压缩所述传输路径上每个节点的网络标识，得到压缩标识；传输模块33，设置为根据所述压缩标识，在所述传输路径上传输所述业务报文。
本申请实施例提供的业务处理装置，根据业务请求，确定业务报文从源节点到目标节点的传输路径；压缩所述传输路径上每个节点的网络标识，得到压缩标识；根据所述压缩标识，在所述传输路径上传输所述业务报文。该装置对传输路径上每个节点的网络标识进行压缩，降低了网络标识的长度，在基于压缩标识传输业务报文的过程中降低了封装开销，而且网络标识的长度降低，使得业务报文的长度也降低，在利用硬件读取业务报文时降低了对硬件的要求。
在上述实施例的基础上，压缩模块32，设置为：
获取所述传输路径上每个节点的网络标识，所述网络标识包括前缀和节点信息；如果多个网络标识的前缀相同，则将每个节点的网络标识的节点信息作为所述每个节点的压缩标识；如果多个网络标识的前缀不相同，根据压缩函数，压缩每个节点的网络标识，得到压缩标识。
在上述实施例的基础上，所述压缩标识包括全局压缩标识和本地压缩标识。
在上述实施例的基础上，传输模块33，设置为：
根据所述全局压缩标识和本地压缩标识，在所述传输路径上传输所述业务报文；或者，根据所述全局压缩标识在所述传输路径上传输所述业务报文；其中，在所述传输路径上传输所述业务报文包括在所述传输路径上转发所述业务报文，或在所述传输路径上转发所述业务报文的过程中对所述业务报文执行可编程的操作。
本申请实施例提供的业务处理装置可执行上述实施例中的业务处理方法，具备执行方法相应的功能模块和效果。
图9为本申请实施例提供的一种设备的结构图。
参考图9，该设备包括：处理器41、存储器42、输入装置43和输出装置640，设备中处理器41的数量可以是一个或多个，图9中以一个处理器41为例，设备中的处理器41、存储器42、输入装置43和输出装置44可以通过总线或其他方式连接，图9中以通过总线连接为例。
存储器42作为一种计算机可读存储介质，可设置为存储软件程序、计算机可执行程序以及模块，如本申请实施例中业务处理方法对应的程序指令/模块。 处理器41通过运行存储在存储器42中的软件程序、指令以及模块，从而执行设备的多种功能应用以及数据处理，即实现上述实施例的业务处理方法。
存储器42主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序；存储数据区可存储根据终端的使用所创建的数据等。此外，存储器42可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储器件。在一些实例中，存储器42可包括相对于处理器41远程设置的存储器，这些远程存储器可以通过网络连接至设备。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
输入装置43可设置为接收输入的数字或字符信息，以及产生与设备的用户设置以及功能控制有关的键信号输入。输出装置44可包括显示屏等显示设备、扬声器以及蜂鸣器等音频设备。
本申请实施例提供的设备与上述实施例提供的业务处理方法属于同一构思，未在本实施例中描述的技术细节可参见上述实施例，并且本实施例具备执行业务处理方法相同的效果。
本申请实施例还提供一种存储介质，其上存储有计算机程序，该程序被处理器执行时实现如本申请上述实施例所述的业务处理方法。
本申请实施例所提供的一种包含计算机可执行指令的存储介质，其计算机可执行指令不限于如上所述的业务处理方法中的操作，还可以执行本申请任意实施例所提供的业务处理方法中的相关操作，且具备相应的功能和效果。
通过以上关于实施方式的描述，本申请可借助软件及必需的通用硬件来实现，也可以通过硬件实现。本申请的技术方案本质上可以以软件产品的形式体现出来，该计算机软件产品可以存储在计算机可读存储介质中，如计算机的软盘、只读存储器(Read-Only Memory，ROM)、随机存取存储器(Random Access Memory，RAM)、闪存(FLASH)、硬盘或光盘等，包括多个指令用以使得一台计算机设备(可以是机器人，个人计算机，服务器，或者网络设备等)执行本申请上述实施例所述的业务处理方法。

Claims (10)

  1. 一种业务处理方法，应用于段路由互联网协议第6版SRv6网络，包括：
    根据业务请求，确定业务报文从源节点到目标节点的传输路径；
    压缩所述传输路径上多个节点中每个节点的网络标识，得到所述每个节点的压缩标识；
    根据每个节点的压缩标识，在所述传输路径上传输所述业务报文。
  2. 根据权利要求1所述的方法，其中，所述压缩所述传输路径上多个节点中每个节点的网络标识，所述每个节点的得到压缩标识，包括：
    获取所述传输路径上每个节点的网络标识，其中，所述网络标识包括前缀和节点信息；
    在与所述多个节点一一对应的多个网络标识的前缀相同的情况下，将每个节点的网络标识的节点信息作为所述每个节点的压缩标识；
    在与所述多个节点一一对应的多个网络标识的前缀不相同的情况下，根据压缩函数，压缩每个节点的网络标识，得到所述每个节点的压缩标识。
  3. 根据权利要求1所述的方法，其中，所述压缩标识包括全局压缩标识和本地压缩标识。
  4. 根据权利要求3所述的方法，其中，所述根据每个节点的压缩标识，在所述传输路径上传输所述业务报文，包括：
    根据每个节点的全局压缩标识和本地压缩标识，在所述传输路径上传输所述业务报文；或者，
    根据每个节点的全局压缩标识在所述传输路径上传输所述业务报文；
    其中，在所述传输路径上传输所述业务报文包括在所述传输路径上转发所述业务报文，或在所述传输路径上转发所述业务报文的过程中对所述业务报文执行可编程的操作。
  5. 一种业务处理装置，应用于段路由互联网协议第6版SRv6网络，包括：
    路径确定模块，设置为根据业务请求，确定业务报文从源节点到目标节点的传输路径；
    压缩模块，设置为压缩所述传输路径上多个节点中每个节点的网络标识，得到所述每个节点的压缩标识；
    传输模块，设置为根据每个节点的压缩标识，在所述传输路径上传输所述业务报文。
  6. 根据权利要求5所述的装置，其中，所述压缩模块，设置为：
    获取所述传输路径上每个节点的网络标识，其中，所述网络标识包括前缀和节点信息；
    在与所述多个节点一一对应的多个网络标识的前缀相同的情况下，将每个节点的网络标识的节点信息作为所述每个节点的压缩标识；
    在与所述多个节点一一对应的多个网络标识的前缀不相同的情况下，根据压缩函数，压缩每个节点的网络标识，得到所述每个节点的压缩标识。
  7. 根据权利要求5所述的装置，其中，所述压缩标识包括全局压缩标识和本地压缩标识。
  8. 根据权利要求7所述的装置，其中，所述传输模块，设置为：
    根据每个节点全局压缩标识和本地压缩标识，在所述传输路径上传输所述业务报文；或者，
    根据每个节点全局压缩标识在所述传输路径上传输所述业务报文；
    其中，在所述传输路径上传输所述业务报文包括在所述传输路径上转发所述业务报文，或在所述传输路径上转发所述业务报文的过程中对所述业务报文执行可编程的操作。
  9. 一种设备，包括：
    至少一个处理器；
    存储器，设置为存储至少一个程序；
    当所述至少一个程序被所述至少一个处理器执行时，使得所述至少一个处理器实现如权利要求1-4中任一项所述的业务处理方法。
  10. 一种存储介质，存储有计算机程序，其中，所述程序被处理器执行时实现如权利要求1-4中任一项所述的业务处理方法。
PCT/CN2021/082399 2020-03-30 2021-03-23 业务处理方法、装置、设备及存储介质 WO2021197141A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
KR1020227037671A KR20220159456A (ko) 2020-03-30 2021-03-23 서비스 처리 방법, 장치, 설비 및 저장 매체
EP21780960.7A EP4131870A4 (en) 2020-03-30 2021-03-23 SERVICE PROCESSING METHOD AND APPARATUS, AND DEVICE AND STORAGE MEDIUM

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010239569.9 2020-03-30
CN202010239569.9A CN113472718A (zh) 2020-03-30 2020-03-30 一种业务处理方法、装置、设备及存储介质

Publications (1)

Publication Number Publication Date
WO2021197141A1 true WO2021197141A1 (zh) 2021-10-07

Family

ID=77866058

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/082399 WO2021197141A1 (zh) 2020-03-30 2021-03-23 业务处理方法、装置、设备及存储介质

Country Status (4)

Country Link
EP (1) EP4131870A4 (zh)
KR (1) KR20220159456A (zh)
CN (1) CN113472718A (zh)
WO (1) WO2021197141A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114338498A (zh) * 2021-12-28 2022-04-12 中国电信股份有限公司 基于SRv6的报文处理方法、系统、电子设备及介质

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114448865B (zh) * 2021-12-23 2024-01-02 东莞市李群自动化技术有限公司 业务报文的处理方法、系统、设备及存储介质
CN117319509A (zh) * 2022-06-24 2023-12-29 中兴通讯股份有限公司 网络数据处理方法、装置和计算机可读存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140369356A1 (en) * 2013-03-15 2014-12-18 Cisco Technology, Inc. Opportunistic compression of routing segment identifier stacks
CN108429685A (zh) * 2018-04-28 2018-08-21 电子科技大学 一种基于分段路由技术的服务功能链寻路方法
CN109218189A (zh) * 2017-07-03 2019-01-15 中兴通讯股份有限公司 跨域的路径的标识信息的确定方法、装置及存储介质
CN111917640A (zh) * 2019-05-09 2020-11-10 华为技术有限公司 SRv6网络生成段列表、报文转发的方法、设备和系统

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110219357A1 (en) * 2010-03-02 2011-09-08 Microsoft Corporation Compressing source code written in a scripting language
CN109688057B (zh) * 2018-12-13 2021-08-24 Ut斯达康通讯有限公司 基于ipv6的段路由网络的报文转发方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140369356A1 (en) * 2013-03-15 2014-12-18 Cisco Technology, Inc. Opportunistic compression of routing segment identifier stacks
CN109218189A (zh) * 2017-07-03 2019-01-15 中兴通讯股份有限公司 跨域的路径的标识信息的确定方法、装置及存储介质
CN108429685A (zh) * 2018-04-28 2018-08-21 电子科技大学 一种基于分段路由技术的服务功能链寻路方法
CN111917640A (zh) * 2019-05-09 2020-11-10 华为技术有限公司 SRv6网络生成段列表、报文转发的方法、设备和系统

Non-Patent Citations (1)

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

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114338498A (zh) * 2021-12-28 2022-04-12 中国电信股份有限公司 基于SRv6的报文处理方法、系统、电子设备及介质
CN114338498B (zh) * 2021-12-28 2024-04-09 中国电信股份有限公司 基于SRv6的报文处理方法、系统、电子设备及介质

Also Published As

Publication number Publication date
EP4131870A4 (en) 2024-04-24
KR20220159456A (ko) 2022-12-02
EP4131870A1 (en) 2023-02-08
CN113472718A (zh) 2021-10-01

Similar Documents

Publication Publication Date Title
WO2021197141A1 (zh) 业务处理方法、装置、设备及存储介质
WO2022078509A1 (zh) IPv6报文的扩展头封装方法及装置
US11902049B2 (en) BIER packet sending method and apparatus
US11979322B2 (en) Method and apparatus for providing service for traffic flow
US9894003B2 (en) Method, apparatus and system for processing data packet
WO2020156166A1 (zh) 用于处理报文的方法和装置
US20180278522A1 (en) System and method to facilitate content forwarding using bit index explicit replication (bier) in an information-centric networking (icn) environment
US10791051B2 (en) System and method to bypass the forwarding information base (FIB) for interest packet forwarding in an information-centric networking (ICN) environment
CN112187647B (zh) 报文转发方法、设备及计算机可读存储介质
CN114189473A (zh) 一种报文的发送方法和装置
WO2021082879A1 (zh) 传输组播报文的方法和相关装置
WO2021043232A1 (zh) 主机网络性能需求可编程化的方法、设备和系统
US20180048593A1 (en) Flow entry generating and packet processing based on flow entry
WO2021088561A1 (zh) 位索引显式复制网络中负载分担的方法、装置及设备
CN109936492A (zh) 一种通过隧道传输报文的方法、装置和系统
WO2017193732A1 (zh) 一种伪线数据报文的封装、解封装方法和相关装置
CN106992918B (zh) 报文转发方法和装置
WO2024001701A1 (zh) 数据处理方法、装置及系统
WO2022134674A1 (zh) 报文传输的方法、装置、设备、存储介质及系统
EP4304144A1 (en) Communication method and apparatus
WO2023005018A1 (zh) 一种报文转发的方法及网络设备
WO2021164245A1 (zh) 负载分担的方法、第一网络设备
US11962673B2 (en) Packet tunneling and decapsulation with split-horizon attributes
WO2015131617A1 (zh) 流表处理方法、装置、开放流控制器及开放流交换机
WO2022199486A1 (zh) 路径跟踪方法、设备和存储介质

Legal Events

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

Ref document number: 21780960

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 20227037671

Country of ref document: KR

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2021780960

Country of ref document: EP

Effective date: 20221031