SRv6 header compression method and device, electronic equipment, storage medium and program product

Abstract

The invention provides an SRv6 header compression method and device, electronic equipment, a storage medium and a program product. According to the header compression method, based on a network topology and a data packet forwarding path, an optimal relay node combination and stack compression nodes are dynamically determined by using an optimal relay node selection algorithm, and then segmented stack compression transmission is realized by marking relay forwarding labels. Therefore, the starting node and the relay node only need to store the stack pushing information required locally, and do not need to carry all SIDs of a complete path, so that the redundant information of the SRv6 header is remarkably reduced. Meanwhile, through dynamic interaction between the control center and the nodes, the network can optimize a forwarding path in real time, it is guaranteed that a data packet is efficiently transmitted according to a specified path, the overall performance of the electric power communication network is improved, and the problems of bandwidth waste and transmission delay caused by the fact that a traditional SRv6 header is too long are effectively solved.

Description

Technical Field

[0001] The present application relates to the field of network communication technology, and in particular to an SRv6 header compression method, device, electronic device, storage medium, and program product. Background Art

[0002] Power communication networks need to support large-scale device access, real-time data transmission, and highly reliable, low-latency communication services. However, traditional network protocols struggle to meet these requirements due to low transmission efficiency, complex path control, and insufficient resource utilization. While IPv6 and its derivative, SRv6, improve network performance through flexible path control, their headers are lengthy due to the large number of segment identifiers (SIDs), resulting in increased bandwidth usage and transmission latency, limiting their widespread application in power communication.

[0003] Therefore, existing methods struggle to balance compression efficiency and path control flexibility, resulting in limited practical application and an inability to fully meet the power communication network's needs for efficient transmission and resource optimization. A more efficient, flexible, and reliable SRv6 header compression scheme is urgently needed to improve the overall performance of power communication networks. Summary of the Invention

[0004] In view of this, the purpose of this application is to propose an SRv6 header compression method, device, electronic device, storage medium and program product.

[0005] Based on the above objectives, this application provides an SRv6 header compression method, including:

[0006] Determine the data packets to be transmitted, network topology information, and data packet forwarding paths;

[0007] Determining an optimal relay node combination using an optimal relay node selection algorithm based on the network topology information and the data packet forwarding path;

[0008] Determining a push node of the optimal relay node combination according to the optimal relay node combination and the data packet forwarding path;

[0009] According to the push node, marking the data packet to be transmitted with a relay forwarding label;

[0010] The data packet to be transmitted is pushed and transmitted according to the relay forwarding label and the pushing node.

[0011] Optionally, the network topology information includes: a node set;

[0012] Determining the data packet forwarding path includes:

[0013] Determining, based on the node set, a target node sequence for forwarding the data packet to be transmitted;

[0014] Determine the data packet forwarding path according to the target node sequence.

[0015] Optionally, determining an optimal relay node combination by using an optimal relay node selection algorithm based on the network topology information and the data packet forwarding path includes:

[0016] Determining a relay node set according to the node set and the forwarding path;

[0017] The maximum number of nodes in the relay node combination is determined, and the optimal relay node combination is determined by the optimal relay node selection algorithm based on the maximum number of nodes in the relay node combination and the relay node set.

[0018] Optionally, the maximum number of nodes in the relay node combination and the relay node set are used to determine the optimal relay node combination through the optimal relay node selection algorithm, including:

[0019] According to the maximum number of nodes in the relay node combination, the relay nodes in the relay node set are arranged and combined to determine a relay node combination set;

[0020] By using the optimal relay node selection algorithm, an iterative calculation is performed on any relay node combination in the relay combination set to determine the optimal relay node combination.

[0021] Optionally, determining a push node of the optimal relay node combination according to the optimal relay node combination and the data packet forwarding path includes:

[0022] Determining a data packet forwarding sub-path of the optimal relay node combination according to the optimal relay node combination and the data packet forwarding path; wherein the data packet forwarding path includes n+1 data packet forwarding sub-paths, where n is the number of relay nodes in the relay node combination;

[0023] The push node is determined according to the data packet forwarding sub-path.

[0024] Optionally, before stacking and transmitting the data packet to be transmitted according to the relay forwarding label and the stacking node, the method further includes:

[0025] The push node information contained in the data packet forwarding sub-path is notified to the push node.

[0026] Based on the same inventive concept, an embodiment of the present application further provides an SRv6 header compression device, including:

[0027] a determination module, configured to determine a data packet to be transmitted, network topology information, and a data packet forwarding path;

[0028] an optimal relay node combination selection module, configured to determine an optimal relay node combination according to the network topology information and the data packet forwarding path by using an optimal relay node selection algorithm;

[0029] a push node determining module, configured to determine a push node according to the optimal relay node combination and the data packet forwarding path;

[0030] a marking module configured to mark the data packet to be transmitted with a relay forwarding label according to the push node;

[0031] The transmission module is configured to push the data packet to be transmitted according to the relay forwarding label and the pushing node.

[0032] Based on the same inventive concept, an embodiment of the present application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and runnable on the processor. When the processor executes the program, it implements the SRv6 header compression method as described in any one of the above items.

[0033] Based on the same inventive concept, an embodiment of the present application further provides a non-transitory computer-readable storage medium, which stores computer instructions, and the computer instructions are used to enable a computer to execute any of the above-mentioned SRv6 header compression methods.

[0034] Based on the same inventive concept, an embodiment of the present application further provides a computer program product, including computer program instructions. When the computer program instructions are executed on a computer, the computer executes any of the above-mentioned SRv6 header compression methods.

[0035] From the above, it can be seen that the present application provides an SRv6 header compression method, device, electronic device, storage medium and program product. The present application is based on the network topology and data packet forwarding path, and uses the optimal relay node selection algorithm to dynamically determine the optimal relay node combination and stacking node, and then realizes segmented stacking transmission by marking the relay forwarding label. The starting node and the relay node only need to store the stacking information required locally, without the need to carry all the SIDs of the complete path, thereby significantly reducing the redundant information of the SRv6 header. At the same time, through the dynamic interaction between the control center and the nodes, the network can optimize the forwarding path in real time, which not only ensures the efficient transmission of data packets along the specified path, but also improves the overall performance of the power communication network, and effectively solves the bandwidth waste and transmission delay problems caused by the excessive length of the traditional SRv6 header. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] In order to more clearly illustrate the technical solutions in this application or related technologies, the following briefly introduces the drawings required for use in the embodiments or related technical descriptions. Obviously, the drawings described below are merely embodiments of this application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0037] Figure 1 This is a flowchart of the SRv6 header compression method according to an embodiment of the present application;

[0038] Figure 2 A schematic diagram of the topology structure of the SRv6 header compression method according to an embodiment of the present application;

[0039] Figure 3 This is a schematic structural diagram of the SRv6 header compression device according to an embodiment of the present application;

[0040] Figure 4 This is a schematic structural diagram of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0041] In order to make the objectives, technical solutions and advantages of this application more clear, this application is further described in detail below in combination with specific embodiments and with reference to the accompanying drawings.

[0042] It should be noted that, unless otherwise defined, the technical terms or scientific terms used in the embodiments of the present application should have the usual meanings understood by people with ordinary skills in the field to which this application belongs. The "first", "second" and similar words used in the embodiments of the present application do not indicate any order, quantity or importance, but are only used to distinguish different components. "Include" or "comprise" and similar words mean that the elements or objects appearing before the word cover the elements or objects listed after the word and their equivalents, without excluding other elements or objects. "Connect" or "connected" and similar words are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "Up", "down", "left", "right" and the like are only used to indicate relative positional relationships. When the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0043] In order to facilitate understanding of the technical solutions of the present disclosure, some technical terms involved in the present disclosure are introduced below.

[0044] SID: Segment Identifier, used to identify each node or link on a path. By embedding a series of SIDs in the header of a data packet, the transmission path of the data packet in the network can be clearly specified.

[0045] Link Cost: An important parameter in network communications that measures the quality, performance, or resource utilization of a link (communication link).

[0046] Push: The process of adding a new element to the top of the stack. Therefore, a push only affects the top position and does not affect other elements. A stack is a special linear list that allows insertion and deletion operations only at one end (called the top). Stacks have the "last in, first out" (LIFO) principle, meaning the last element inserted is the first to be deleted.

[0047] Header: The beginning of a data packet, frame, or message in network communications, computer protocols, and data transmission, containing various information used to control, describe, and manage data transmission.

[0048] SRH: Segment Routing Header, which guides the transmission path of data packets by embedding path information (i.e., "segments") in data packets instead of relying on traditional hop-by-hop routing protocols. It is used to simplify network management and operation while improving network flexibility and scalability.

[0049] Relay node: In network communications, an intermediate node used to forward data between multiple nodes. It transmits data from the source node to the destination node through relay transmission, enabling data transmission over long distances or in complex environments.

[0050] In order to make the technical solution of the present disclosure clearer and easier to understand, the SRv6 header compression method provided by the embodiment of the present disclosure is described in detail below with reference to the accompanying drawings.

[0051] As mentioned in the technical background section, the rapid development of the power system has placed higher demands on the performance of communication networks by power grid companies. Power communication networks must support large-scale device access, real-time data transmission, and highly reliable and low-latency communication services. However, traditional network protocols, when faced with complex power business scenarios, suffer from low transmission efficiency, complex path control, and low resource utilization, making them unable to meet the actual needs of power communication networks. In scenarios involving large-scale device access and dynamic business scheduling, network transmission efficiency and flexibility are particularly important.

[0052] To address these issues, the next-generation Internet Protocol (IPv6) and its extended technologies are gradually becoming key support for power communication networks. Among them, SRv6 (Segment Routing over IPv6) technology implements flexible path control and traffic engineering by embedding path information in the IPv6 header. SRv6 can significantly simplify network operations, improve the flexibility of path selection, and meet the power communication network's needs for dynamic scheduling and efficient transmission. However, the SRv6 header contains a large number of segment identifiers (SIDs), which significantly increases the header length. This redundant information not only consumes valuable bandwidth resources but also increases data packet transmission delays, limiting the widespread application of SRv6 technology in power communication networks.

[0053] Existing technologies for SRv6 header compression primarily include static and centralized compression methods. Static compression methods compress headers using fixed rules, but are unable to adapt to dynamically changing network environments and lack flexibility. Centralized compression methods rely on central nodes to process headers. While they can achieve a certain degree of compression, they increase network complexity and pose a risk of single points of failure. Furthermore, these methods struggle to strike a balance between compression efficiency and path control flexibility, resulting in limited effectiveness in practical applications and failing to fully meet the demands of power communication networks for efficient transmission and resource optimization.

[0054] Specifically, in communication networks, data is transmitted in the form of packets. Each packet consists of a header and a payload. The header contains important information such as the source address, destination address, and protocol type, guiding the transmission and processing of the packet within the network. Header compression can reduce the bandwidth occupied by the header, thereby improving network transmission efficiency. Because header compression reduces the size of the packet, the packet's transmission time within the network may be shortened, thereby helping to reduce latency.

[0055] In view of this, the embodiments of the present application provide an SRv6 header compression method, device, electronic device, storage medium and program product. Based on the network topology and the data packet forwarding path, the optimal relay node selection algorithm is used to dynamically determine the optimal relay node combination and push node, and then segmented push transmission is achieved by marking the relay forwarding label. The starting node and the relay node only need to store the push information required locally, without the need to carry all the SIDs of the complete path, thereby significantly reducing the redundant information of the SRv6 header. At the same time, through the dynamic interaction between the control center and the nodes, the network can optimize the forwarding path in real time, which not only ensures the efficient transmission of data packets along the specified path, but also improves the overall performance of the power communication network, and effectively solves the problems of bandwidth waste and transmission delay caused by the excessive length of the traditional SRv6 header.

[0056] like Figure 1 As shown, the SRv6 header compression method, applied to a control center, includes:

[0057] Step S102: Determine the data packet to be transmitted, network topology information, and data packet forwarding path.

[0058] In step S102, the data packet to be transmitted is: a data packet to be transmitted in the communication network through the network topology diagram. The network topology information includes: connection information between the control center and the node, the node set N, the link set L and the link cost C. Figure 2 As shown in the figure, the node set N = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, the link set L = {{1, 2}, {2, 3}, {3, 4}, {4, 5}, {5, 6}, {2, 7}, {7, 8}, {8, 10}, {10, 4}, {3, 8}, {4, 9}, {9, 5}}, and the link cost C = {1, 1, 1, 1, 2, 2, 3, 1, 2, 1, 1, 1}. The control center is connected to nodes 1, 7, and 8.

[0059] In some implementations, the data packet forwarding path may be a user-specified forwarding path.

[0060] Exemplarily, the data packet forwarding path may be P_req={1→2→7→8→10→4→5→6}.

[0061] Step S104: Determine an optimal relay node combination based on the network topology information (1-2-...-10) and the data packet forwarding path using an optimal relay node selection algorithm.

[0062] In this step S104, the determination of the data packet forwarding path includes: determining the target node sequence for forwarding the data packet to be transmitted according to the node set; and determining the data packet forwarding path according to the target node sequence. The target node sequence is the forwarding path of the data packet to be transmitted specified by the user, that is, Figure 2 The nodes to be passed in the topology diagram shown in .

[0063] For example, if the user specifies a forwarding path for a data packet to be transmitted, P_req = {1, 2, 7, 8, 10, 4, 5, 6}, with the starting node start = 1 and the end node end = 6, the target node sequence is {1, 2, 7, 8, 10, 4, 5, 6}. Therefore, the corresponding data packet forwarding path is: 1 → 2 → 7 → 8 → 10 → 4 → 5 → 6.

[0064] In some embodiments, determining the optimal relay node combination by using an optimal relay node selection algorithm based on the network topology information and the data packet forwarding path includes:

[0065] Determine a relay node set according to the node set (1, 2, ..., 10) and the forwarding path;

[0066] The maximum number of nodes in the relay node combination is determined, and the optimal relay node combination is determined by the optimal relay node selection algorithm based on the maximum number of nodes in the relay node combination and the relay node set.

[0067] For example, Figure 2 As shown in the figure, if the node set is {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} and the forwarding path is 1→2→7→8→10→4→5→6, then the nodes passed through by the forwarding path are {1, 2, 7, 8, 10, 4, 5, 6}, where node 1 is the starting node and node 6 is the ending node. Therefore, after excluding the starting and ending nodes, the relay node set (candidate relay node set) is: {2, 7, 8, 10, 4, 5}.

[0068] Furthermore, the maximum number of nodes k in the relay node combination can be customized according to actual conditions, and the relay nodes in the relay node set are arranged and combined according to the customized maximum number of nodes k in the relay node combination to determine the relay node combination set; and further, through the optimal relay node selection algorithm, any relay node combination in the relay combination set is iteratively calculated to determine the optimal relay node combination.

[0069] For example, when k is 2, the relay node set is {2, 7, 8, 10, 4, 5} according to k=2, that is, there can be 15 relay node combinations R_combinations={(2, 7), (2, 8), (2, 10), (2, 4), (2, 5), (7, 8), (7, 10), (7, 4), (7, 5), (8, 10), (8, 4), (8, 5), (10, 4), (10, 5), (4, 5)}.

[0070] Furthermore, based on the forwarding path of the data packet and the 15 relay node combinations, the path and push point corresponding to any relay node combination in Table 1 can be determined. The path corresponding to the relay node combination includes m data packet forwarding sub-paths, and the number of data packet forwarding sub-paths m is determined by the number of relay nodes n in the relay node combination. The path m corresponding to the relay node combination = the number of relay nodes n + 1. As shown in Table 1, when the relay node combination is (2, 7), the forwarding path of the data packet is (1) 1-2, (2) 2-7, and (3) 7-10-6, a total of three forwarding sub-paths. The push nodes corresponding to the relay node combination (2, 7) are 2, 7, 10, and 6.

[0071] Table 1 Forwarding paths and push nodes of relay node combinations

[0072]

[0073]

[0074] It can be seen from Table 1 above that the node combination (7, 10) has the least number of pushed nodes, which is 3 (nodes 7, 10, 6). Therefore, the node combination (7, 10) is determined as the optimal relay node combination.

[0075] In some implementations, in addition to determining the optimal relay node combination based on the number of stacked nodes, an iterative calculation approach can be used to perform a multi-dimensional evaluation of each candidate relay node combination in the relay node combination set, including but not limited to key indicators such as transmission delay, bandwidth stability, node load balancing, and energy efficiency. During each iteration, the algorithm dynamically adjusts the weight parameters and, in combination with real-time network status data, accurately calculates the comprehensive score of each combination. Through multiple rounds of optimization and comparison, inefficient solutions are gradually eliminated, ultimately converging on a global optimal solution. The optimal relay node combination is then determined based on the global optimal solution and the number of stacked node combinations.

[0076] Exemplarily, by the optimal relay node selection algorithm, any relay node combination in the relay combination set is iteratively calculated to determine the optimal relay node combination. The optimal relay node combination can be, according to the arrangement order of the relay node combination, first obtaining the stacking nodes of the combination (2, 7) with sequence number 1 as shown in Table 1 as 4 (nodes 2, 7, 10, 6), that is, the relay node combination (2, 7) is used as the current optimal relay node combination, and further obtaining the next relay node combination (2, 8) according to the arrangement order of the relay node combination, as well as the data packet forwarding path and stacking node of the relay node combination (2, 8), and the relay node combination (2, 8) is received. The number of pushed nodes of the power node combination (2, 8) is compared with the number of pushed nodes of the current optimal relay node combination (2, 7). If the number of pushed nodes of the relay node combination (2, 8) is greater than the number of pushed nodes of the current optimal relay node combination (2, 7), the relay node combination (2, 7) is still used as the current optimal relay node combination. If the number of pushed nodes of the relay node combination (2, 8) is less than the number of pushed nodes of the current optimal relay node combination (2, 7), the relay node combination (2, 8) is used as the current optimal relay node combination, and the optimal relay node combination is determined in this way.

[0077] As shown in Table 1, the number of pushed nodes of the relay node combination (2, 7) is 4, and the number of pushed nodes of the relay node combination (2, 8) is 5. When the number of pushed nodes of the relay node combination (2, 8) is compared with the number of pushed nodes of the current optimal relay node combination (2, 7), the relay node combination (2, 7) is taken as the current optimal relay node combination. Then, the number of pushed nodes of the third relay node combination (2, 10) is further obtained, and the number of pushed nodes of the relay node combination (2, 10) is compared with the number of pushed nodes of the current optimal relay node combination (2, 7). The relay node combination (2, 7) is still taken as the current optimal relay node combination. Similarly, the number of pushed nodes of the current optimal relay node combination is compared with the number of pushed nodes of the next relay node combination, and finally the optimal relay node combination (7, 10) is determined.

[0078] In some embodiments, when the number of stacked nodes in two relay node combinations being compared is the same, the relay node combinations can be randomly selected, one of which is selected as the optimal relay node combination, and the relay node combinations that are not selected as the optimal relay node combination are marked. For example, if the number of stacked nodes in relay node combinations (2, 7) and (2, 10) is the same, then (2, 7) can be selected as the current optimal relay node combination and relay node combination (2, 10) can be marked. Of course, relay node combination (2, 10) can also be selected as the current optimal relay node combination, and relay node combination (2, 7) can be marked to facilitate the acquisition of relay node combinations during data packet transmission.

[0079] Step S106: Determine a push node of the optimal relay node combination according to the optimal relay node combination and the data packet forwarding path.

[0080] In step S106 , the optimal relay node combination is (7, 10), and when the data packet forwarding path is 1→2→7→8→10→4→5→6, the push nodes of the optimal relay node combination are 7, 10, and 6.

[0081] Furthermore, after determining the optimal relay node combination (7, 10) and the push nodes 7, 10, and 6 of the optimal relay node combination, the control center notifies the starting node 1 and the corresponding relay nodes 7 and 10 of the node information that needs to be pushed on each path; specifically, the following steps are included:

[0082] (1) Notify the node information {7} to be pushed to the stack of the first segment of the path to the starting node 1;

[0083] (2) Notify the node information {10} to be pushed to the relay node 7 for the second segment of the path;

[0084] (3) Notify the node information {6} to be pushed to the relay node 10 on the third segment of the path;

[0085] The starting node 1 and the relay nodes 7 and 10 receive and store the push information for subsequent data packet forwarding.

[0086] Step S108: Mark the data packet to be transmitted with a relay forwarding label according to the push node.

[0087] In this step S108, the starting node 1 indicates in the data packet that the data packet needs to be relayed, and marks the order of the forwarding path: first stage nodes 1-7 transmit, second stage nodes 7-10 transmit, and third stage nodes 10-6 transmit.

[0088] Step S110: Push the data packet to be transmitted according to the relay forwarding label and the push node.

[0089] In this step, starting node 1 pushes node information {7} into the SRH and forwards the data packet to relay node 7 based on the shortest path. Relay node 7 pushes node information {10} into the SRH and forwards the data packet to relay node 10 based on the shortest path. Relay node 10 pushes node information {6} into the SRH and forwards the data packet to destination 6 based on the shortest path. This ensures that the control center's actual forwarding path for the data packet meets the user-specified forwarding requirement P_req = {1 → 2 → 7 → 8 → 10 → 4 → 5 → 6}.

[0090] In some embodiments, when transmitting a data packet to be transmitted, the starting node pushes the node information required for the first segment of the path into the SRH based on information notified by the control center, and forwards the data packet to the first relay node based on the shortest path. After receiving the data packet, the relay node pushes the node information required for the next segment of the path into the SRH based on the label information, and forwards the data packet to the next relay node based on the shortest path. This process is repeated until the data packet reaches the destination.

[0091] Furthermore, after completing the transmission of a data packet based on the optimal relay node combination, the control center verifies and optimizes the transmission path corresponding to the optimal relay node combination. Specifically, the control center verifies the actual forwarding path of the data packet to ensure that the path meets the user-specified forwarding requirement P_req. If the path does not meet the requirements or the total number of stacked nodes is not optimal, the control center re-executes the iterative optimal node selection algorithm, further selecting the optimal relay node combination from the set of relay node combinations, and then proceeds with the next data packet transmission.

[0092] As can be seen from the above, the SRv6 header compression method is based on network topology and packet forwarding paths. It uses an optimal relay node selection algorithm to dynamically determine the optimal relay node combination and push node, and then implements segmented push transmission by marking relay forwarding labels. This allows the starting node and relay nodes to only store the push information required locally, without having to carry all SIDs for the entire path, significantly reducing redundant information in the SRv6 header. At the same time, through dynamic interaction between the control center and nodes, the network can optimize the forwarding path in real time, ensuring the efficient transmission of data packets along the designated path while improving the overall performance of the power communication network. This effectively solves the bandwidth waste and transmission delay problems caused by the overly long traditional SRv6 header.

[0093] It should be noted that the method of the embodiment of the present application can be performed by a single device, such as a computer or server. The method of this embodiment can also be applied in a distributed scenario and performed by multiple devices working together. In such a distributed scenario, one of the multiple devices may only perform one or more steps of the method of the embodiment of the present application, and the multiple devices will interact with each other to complete the method.

[0094] It should be noted that the above description is limited to some embodiments of the present application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recited in the claims may be performed in an order different from that described in the above embodiments and still achieve the desired results. Furthermore, the processes depicted in the accompanying drawings do not necessarily require the specific order or sequential order shown to achieve the desired results. In certain embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0095] Based on the same inventive concept, corresponding to any of the above-mentioned embodiment methods, the present application also provides an SRv6 header compression device.

[0096] refer to Figure 3 , the SRv6 header compression device includes:

[0097] The determination module 302 is configured to determine the data packet to be transmitted, the network topology information, and the data packet forwarding path;

[0098] The optimal relay node combination selection module 304 is configured to determine the optimal relay node combination according to the network topology information and the data packet forwarding path by using the optimal relay node selection algorithm;

[0099] A push node determining module 306 is configured to determine a push node according to the optimal relay node combination and the data packet forwarding path;

[0100] The marking module 308 is configured to mark the data packet to be transmitted with a relay forwarding label according to the push node;

[0101] The transmission module 310 is configured to push the data packets to be transmitted according to the relay forwarding label and the pushing node.

[0102] For the convenience of description, the above devices are described as being divided into various modules according to their functions. Of course, when implementing this application, the functions of each module can be implemented in the same or multiple software and / or hardware.

[0103] The apparatus of the above embodiment is used to implement the corresponding SRV6 header compression method in any of the above embodiments, and has the beneficial effects of the corresponding method embodiment, which will not be described in detail here.

[0104] Based on the same inventive concept, corresponding to any of the above-mentioned embodiments and methods, the present application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and runnable on the processor, wherein when the processor executes the program, the SRV6 header compression method described in any of the above embodiments is implemented.

[0105] Figure 4 10 is a schematic diagram showing a more specific hardware structure of an electronic device provided in this embodiment. The device may include: a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040 are communicatively connected to each other within the device via the bus 1050.

[0106] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0107] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage devices, dynamic storage devices, etc. The memory 1020 can store an operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.

[0108] The input / output interface 1030 is used to connect input / output modules to implement information input and output. The input / output modules can be configured as components within the device (not shown in the figure) or can be externally connected to the device to provide corresponding functions. Input devices may include a keyboard, mouse, touch screen, microphone, various sensors, etc., and output devices may include a display, speaker, vibrator, indicator light, etc.

[0109] The communication interface 1040 is used to connect to a communication module (not shown) to enable communication between the device and other devices. The communication module can communicate via a wired method (such as USB, network cable, etc.) or a wireless method (such as mobile network, WiFi, Bluetooth, etc.).

[0110] The bus 1050 comprises a path for transmitting information between the various components of the device (eg, the processor 1010 , the memory 1020 , the input / output interface 1030 , and the communication interface 1040 ).

[0111] It should be noted that although the above device only shows the processor 1010, the memory 1020, the input / output interface 1030, the communication interface 1040, and the bus 1050, in a specific implementation, the device may also include other components necessary for normal operation. In addition, it will be understood by those skilled in the art that the above device may only include the components necessary to implement the embodiments of this specification, and does not necessarily include all the components shown in the figure.

[0112] The electronic device of the above embodiment is used to implement the corresponding SRV6 header compression method in any of the above embodiments, and has the beneficial effects of the corresponding method embodiment, which will not be repeated here.

[0113] Based on the same inventive concept, corresponding to any of the above-mentioned embodiment methods, the present application also provides a non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium stores computer instructions, and the computer instructions are used to enable the computer to execute the SRV6 header compression method described in any of the above embodiments.

[0114] The computer-readable media of this embodiment include permanent and non-permanent, removable and non-removable media that can be used to store information by any method or technology. The information can be computer-readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, read-only compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device.

[0115] The computer instructions stored in the storage medium of the above embodiment are used to enable the computer to execute the SRV6 header compression method described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0116] Based on the same inventive concept, corresponding to the SRV6 header compression method described in any of the above embodiments, the present disclosure further provides a computer program product comprising computer program instructions. In some embodiments, the computer program instructions can be executed by one or more processors of a computer to cause the computer and / or the processor to perform the SRV6 header compression method. For the execution entities corresponding to the steps in each embodiment of the SRV6 header compression method, the processors executing the corresponding steps can belong to the corresponding execution entities.

[0117] The computer program product of the above embodiment is used to enable the computer and / or the processor to execute the SRV6 header compression method as described in any of the above embodiments, and has the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0118] Those skilled in the art should understand that the discussion of any of the above embodiments is merely illustrative and is not intended to imply that the scope of the present application (including the claims) is limited to these examples. Within the scope of the present application, the technical features in the above embodiments or different embodiments may be combined, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present application as described above, which are not provided in detail for the sake of simplicity.

[0119] In addition, for simplicity of description and discussion, and in order not to make the embodiment of the application difficult to understand, the known power supply / ground connection with integrated circuit (IC) chip and other components may or may not be shown in the accompanying drawings provided. In addition, the device can be shown in the form of a block diagram to avoid making the embodiment of the application difficult to understand, and this also takes into account the following fact, that is, the details of the embodiment of these block diagram devices are highly dependent on the platform to be implemented in the embodiment of the application (that is, these details should be fully within the scope of understanding of those skilled in the art). When specific details (for example, circuit) are set forth to describe exemplary embodiments of the application, it will be apparent to those skilled in the art that the embodiment of the application can be implemented without these specific details or when these specific details are changed. Therefore, these descriptions should be considered to be illustrative rather than restrictive.

[0120] Although the present invention has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of these embodiments will be apparent to those skilled in the art based on the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may utilize the embodiments discussed.

[0121] The embodiments of the present application are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the embodiments of the present application should be included in the scope of protection of this application.

Claims

1. A SRv6 header compression method, characterized in that: Applied to control centers, including: Determine the data packets to be transmitted, network topology information, and data packet forwarding paths; Determining an optimal relay node combination using an optimal relay node selection algorithm based on the network topology information and the data packet forwarding path; Determining a push node of the optimal relay node combination according to the optimal relay node combination and the data packet forwarding path; According to the push node, marking the data packet to be transmitted with a relay forwarding label; The data packet to be transmitted is pushed and transmitted according to the relay forwarding label and the pushing node.

2. The method according to claim 1, characterized in that The network topology information includes: a node set; Determining the data packet forwarding path includes: Determining, based on the node set, a target node sequence for forwarding the data packet to be transmitted; Determine the data packet forwarding path according to the target node sequence.

3. The method according to claim 2, characterized in that The determining of the optimal relay node combination by an optimal relay node selection algorithm based on the network topology information and the data packet forwarding path includes: Determining a relay node set according to the node set and the forwarding path; The maximum number of nodes in the relay node combination is determined, and the optimal relay node combination is determined by the optimal relay node selection algorithm based on the maximum number of nodes in the relay node combination and the relay node set.

4. The method according to claim 3, characterized in that The maximum number of nodes in the relay node combination and the relay node set are used to determine the optimal relay node combination through the optimal relay node selection algorithm, including: According to the maximum number of nodes in the relay node combination, the relay nodes in the relay node set are arranged and combined to determine a relay node combination set; By using the optimal relay node selection algorithm, an iterative calculation is performed on any relay node combination in the relay combination set to determine the optimal relay node combination.

5. The method according to claim 1, wherein The step of determining a push node of the optimal relay node combination according to the optimal relay node combination and the data packet forwarding path includes: Determining a data packet forwarding sub-path of the optimal relay node combination according to the optimal relay node combination and the data packet forwarding path; wherein the data packet forwarding path includes n+1 data packet forwarding sub-paths, where n is the number of relay nodes in the relay node combination; The push node is determined according to the data packet forwarding sub-path.

6. The method according to claim 5, characterized in that Before stacking and transmitting the data packet to be transmitted according to the relay forwarding label and the stacking node, the method further includes: The push node information contained in the data packet forwarding sub-path is notified to the push node.

7. An SRv6 header compression device, characterized in that: include: a determination module, configured to determine a data packet to be transmitted, network topology information, and a data packet forwarding path; an optimal relay node combination selection module, configured to determine an optimal relay node combination according to the network topology information and the data packet forwarding path by using an optimal relay node selection algorithm; a push node determining module, configured to determine a push node according to the optimal relay node combination and the data packet forwarding path; a marking module configured to mark the data packet to be transmitted with a relay forwarding label according to the push node; The transmission module is configured to push the data packet to be transmitted according to the relay forwarding label and the pushing node.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable by the processor, wherein the processor implements the method according to any one of claims 1 to 6 when executing the computer program. 9 . A non-transitory computer-readable storage medium storing computer instructions for causing a computer to execute the method according to claim 1 .

10. A computer program product comprising computer program instructions, which, when executed on a computer, cause the computer to execute the method according to any one of claims 1 to 6.

Images