WO2022062679A1 - 数据处理方法、系统、封装节点和解封装节点 - Google Patents

数据处理方法、系统、封装节点和解封装节点 Download PDF

Info

Publication number
WO2022062679A1
WO2022062679A1 PCT/CN2021/110348 CN2021110348W WO2022062679A1 WO 2022062679 A1 WO2022062679 A1 WO 2022062679A1 CN 2021110348 W CN2021110348 W CN 2021110348W WO 2022062679 A1 WO2022062679 A1 WO 2022062679A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
prefix
suffix
local index
encapsulation
Prior art date
Application number
PCT/CN2021/110348
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 US18/027,936 priority Critical patent/US20230370375A1/en
Priority to EP21871056.4A priority patent/EP4220427A4/en
Publication of WO2022062679A1 publication Critical patent/WO2022062679A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2282—Tablespace storage structures; Management thereof
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/40—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using virtualisation of network functions or resources, e.g. SDN or NFV entities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2212/00—Encapsulation of packets
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route

Definitions

  • the embodiments of the present disclosure relate to the field of communication transmission, and in particular, to a data processing method, a system, an encapsulation node, and a decapsulation node.
  • the future network is a network oriented to the 5G era. Facing the 5G network, network virtualization is the main development direction of the bearer network.
  • Segment Routing IPv6 (SRv6) based on Internet Protocol Version 6 (IPv6) adopts the existing IPv6 forwarding technology.
  • IPv6 Internet Protocol Version 6
  • the routing segment in SRv6 directly uses the 128-bit IPv6 address identifier, and Some IPv6 addresses are defined as instantiated SIDs (Segment IDs), each SID has its own explicit role and function, and simple network virtualization is realized through different SID operations.
  • the traditional processing method of SID data is: apply for an index for each SID data, establish a SID encapsulation table as a direct index table, write the encapsulation index in the service prefix table, and search the SID encapsulation table through the encapsulation index.
  • the size of a SID in SRv6 technology is 128 bits
  • the length of the encapsulation packet required to encapsulate a complete SID is very large.
  • the SID encapsulation table usually needs to be checked multiple times. When a SID is obtained, the length of the encapsulation packet and the number of times of decapsulation lookup table increase, which increases the pressure of encapsulation and decapsulation of the network device, and reduces the network transmission efficiency at the same time.
  • the main purpose of the embodiments of the present disclosure is to propose a data processing method, system, encapsulation node, and decapsulation node, which aim to realize the separate storage of data in a table during storage, so that a large amount of table entry space can be saved, and the storage pressure of nodes can be greatly reduced .
  • an embodiment of the present disclosure provides a data processing method, the method includes the following steps: acquiring at least two groups of data to be sent, the data including prefix data and suffix data; acquiring common prefix data of the prefix data; Obtain the local index from the public prefix data, and write the local index and public prefix data into the preset prefix table; write the suffix data and local index into the preset suffix table; write the data in the prefix table and the data in the suffix table Enter the preset data encapsulation table, and send the data encapsulation table.
  • an embodiment of the present disclosure also provides a data processing method, the method includes the following steps: receiving a data encapsulation table, where the data encapsulation table contains common prefix data and suffix data; obtaining prefix data from a local data table ; Obtain the local index according to the prefix data, and write the local index into the preset public prefix table; Use the data in the public prefix table to obtain data from the data encapsulation table, and the data includes the public prefix data and the suffix data.
  • an embodiment of the present disclosure further provides a packaging node, including: at least one processor; and a memory communicatively connected to the at least one processor, where the memory stores instructions executable by the at least one processor, so The instructions, when executed by the at least one processor, enable the at least one processor to perform the above-described data processing method.
  • an embodiment of the present disclosure further provides a decapsulation node, comprising: at least one processor; and a memory communicatively connected to the at least one processor, where the memory stores instructions executable by the at least one processor, The instructions, when executed by at least one processor, enable the at least one processor to perform the above-described data processing method.
  • an embodiment of the present disclosure further provides a data processing system, including: the above-mentioned encapsulation node and the above-mentioned decapsulation node.
  • FIG. 1 is a flowchart of a data processing method provided by a first embodiment of the present disclosure
  • FIG. 2 is a schematic structural diagram of a preset prefix table, a preset suffix table, and a preset data encapsulation table in the data processing method provided by the first embodiment of the present disclosure shown in FIG. 1;
  • FIG. 3 is a flowchart of a data processing method provided by a second embodiment of the present disclosure.
  • FIG. 4 is a flowchart of a data processing method provided by a third embodiment of the present disclosure.
  • FIG. 5 is a flowchart of step 404 in the data processing method provided by the third embodiment of the present disclosure shown in FIG. 4;
  • FIG. 6 is a flowchart of a data processing method provided by a fourth embodiment of the present disclosure.
  • FIG. 7 is a schematic structural diagram of a packaging node provided by a fifth embodiment of the present disclosure.
  • FIG. 8 is a schematic structural diagram of a decapsulation node provided by a sixth embodiment of the present disclosure.
  • FIG. 9 is a schematic structural diagram of a data processing system provided by a seventh embodiment of the present disclosure.
  • the first embodiment of the present disclosure relates to a data processing method, as shown in FIG. 1 , which specifically includes the following steps 101 to 105 .
  • Step 101 Acquire at least two groups of data to be sent, where the data includes prefix data and suffix data.
  • the data is composed of two parts: prefix data and suffix data, and the specific format is prefix data: suffix data, wherein the prefix data occupies the high-order bits of the IPv6 address, and the suffix data part occupies the remaining part of the IPv6 address.
  • prefix data is the specified bit data Locator
  • the positioning data Locator has the positioning function.
  • the suffix data is Refers to the function data Function.
  • the function data Function represents the instruction instruction of the device. These instructions are preset by the device to instruct the generating node of the SID data to perform the corresponding function operation.
  • the suffix data part can also be divided into an optional parameter section.
  • Arguments the format of the SID data becomes Locator:Function:Arguments, Arguments occupies the low-order bits of the IPv6 address, and the Arguments field can define the flow and service information of some packets. Both Function and Arguments can be defined.
  • Step 102 Acquire common prefix data of prefix data.
  • the prefix data is unique in the SR domain, in some cases (such as in the Anycast protection scenario), multiple devices may be configured with the same Locator, and we can obtain the At least one common prefix data is extracted from the prefix data of the multiple sets of SID data obtained.
  • the obtained data includes: 2002::0:0:0/96, 2002::1:0:0/96, 2002 ::2:0:0/96, 2001::0:0:0/95, 2001::1:0:0/95, 2001::2:0:0/95, then the extracted common prefix For 2002:: and 2001::, the data extracted above and the method and form of obtaining the common prefix are only for illustration. In the actual application process of the present disclosure, other data and methods can also be adopted, which are not one by one here. Repeat.
  • Step 103 Obtain a local index according to the public prefix data, and write the local index and the public prefix data into a preset prefix table.
  • the process of using the public prefix data to obtain the local index can be completed by using a software module.
  • the software module contains an algorithm.
  • the public prefix data is obtained, it is first necessary to obtain the number of bits occupied by the public prefix data, and then The size of the acquired local index is selected according to the number of bits occupied, and the local index is obtained from the local index resource management; then the input public prefix data and the corresponding local index are written into the preset
  • the preset prefix table can clearly reflect the corresponding relationship between the local index and the public prefix data.
  • the style of the preset prefix table is shown in Figure 2.
  • the public prefix n refers to the nth public prefix
  • IDXn refers to the local indexes corresponding to the n common prefixes.
  • the method for obtaining the local indexes extracted above is only for illustration. In the actual application process of the present disclosure, other methods may also be adopted, which will not be described in detail here.
  • this step further includes: when the common prefix data is deleted, reducing the reference times of the local index corresponding to the common prefix data in the prefix table. For example, when the reference count of the local index is 0, the local index corresponding to the common prefix data in the prefix table is deleted.
  • the local index corresponding to the common prefix data can be deleted, so that the local index can establish a corresponding relationship with other public prefix data , thereby improving the utilization of index resources.
  • Step 104 Write the suffix data and the local index into a preset suffix table.
  • writing the suffix data and the local index into the preset suffix table includes the following steps: replacing the prefix data corresponding to the suffix data with the corresponding local index, and obtaining a new suffix data, the new suffix data is composed of The local index and suffix data are composed, and the new suffix data is written into the preset suffix table, and the preset suffix table can clearly reflect the corresponding relationship between the local index and the suffix data.
  • the style of the preset suffix table is shown in FIG. 2 , and the suffix data n+IDXn in the suffix table refers to new suffix data.
  • the prefix data corresponding to the suffix data is replaced with the local index corresponding to the prefix data, and the data can be restored according to the corresponding relationship of the local index when the data is unpacked , which in turn can restore the data more accurately.
  • Step 105 Write the data in the prefix table and the data in the suffix table into a preset data encapsulation table, and send the data encapsulation table.
  • the data encapsulation table actually contains two parts of data: the data of the prefix table and the data of the suffix table. These two parts of data are stored separately and do not interfere with each other. The two parts of data can be correlated through indexes.
  • the data encapsulation table can be sent out, and the sending of the data encapsulation table can be done through the IGP protocol or through other methods, here Not to repeat them one by one.
  • the style of the data encapsulation table is shown in Figure 2, which is formed by the prefix table and the suffix table, and an invisible correspondence is established between the two through the local index.
  • At least two groups of data to be sent are obtained at the encapsulation node, wherein the data includes prefix data and suffix data, common prefix data is extracted from the prefix data, and a local index is obtained according to the common prefix data, Write the local index and public prefix data into the preset prefix table, write the suffix data and the local index into the preset suffix table, and write the data in the prefix table and the data in the suffix table into the preset data encapsulation table, And sending the data encapsulation table, can realize the separate storage of common prefix data, and a common prefix only needs to be stored once, which can save a lot of table entry space and reduce node storage pressure.
  • the second embodiment of the present disclosure relates to a data processing method.
  • This embodiment is substantially the same as the first embodiment. The difference lies in that this embodiment refines step 103 and step 104, as shown in FIG. 3, and specifically includes the following step 301 to 308.
  • Step 301 Acquire at least two groups of data to be sent, where the data includes prefix data and suffix data.
  • this step is substantially the same as step 101 in the first embodiment, and will not be repeated here.
  • Step 302 Acquire common prefix data of prefix data.
  • this step is substantially the same as step 102 in the first embodiment, and will not be repeated here.
  • Step 303 Determine whether the common prefix data appears for the first time.
  • step 304 is executed. If the common prefix data is not the first If it occurs for the second time, step 305 is executed.
  • Step 304 Acquire a local index according to the public prefix data, and write the local index and the public prefix into the prefix table.
  • this step is substantially the same as step 103 in the first embodiment, and will not be repeated here.
  • Step 305 Increase the reference times of the local index corresponding to the common prefix data in the prefix table.
  • the acquired common prefix is not the first occurrence, it means that a local index has been obtained for this common prefix data before, and the prefix table contains this common prefix data and its corresponding For a local index, increasing the number of references to the local index is equivalent to writing the public prefix data and the local index into the prefix table. If the local index is repeatedly obtained for the public prefix data, the subsequent decapsulated data will be inaccurate. In fact, when it is detected that the public prefix data is deleted, the local index corresponding to the deleted public prefix data in the prefix table can be deleted, and the local index can be released into the index resource pool for re-allocation.
  • Step 306 replace the prefix data corresponding to the suffix data with the local index, and obtain new suffix data.
  • the data is composed of prefix data and suffix data, and we have applied for a local index for the prefix data, and also stored the prefix data in a separate table, so it is also necessary to store the suffix data separately, and store the suffix separately.
  • Step 307 Write the new suffix data into the preset suffix table.
  • the data written into the preset suffix table is composed of suffix data and a local index
  • the local index is a local index corresponding to the prefix data by replacing the prefix data corresponding to the suffix data.
  • Step 308 Write the data in the prefix table and the data in the suffix table into a preset data encapsulation table, and send the data encapsulation table.
  • this step is substantially the same as step 104 in the first embodiment, and will not be repeated here.
  • this embodiment can also avoid repeatedly applying for a local index for the same public prefix data when acquiring a local index, that is, only apply for one public prefix for the same public prefix data.
  • the index avoids the use of multiple local indexes for the same common prefix data, and when it is detected that the common prefix data is deleted, the corresponding local indexes can be released, thereby improving the utilization rate of index resources.
  • the third embodiment of the present disclosure relates to a data processing method, as shown in FIG. 4 , which specifically includes the following steps 401 to 404 .
  • Step 401 Receive a data encapsulation table, where the data encapsulation table includes common prefix data and suffix data.
  • the data encapsulation table is received at the decapsulation node, and the received data encapsulation table is actually divided into two parts.
  • the first part stores the common prefix data and the corresponding local index.
  • the two parts store the suffix data and the corresponding local index, and the contents of the two parts can correspond to each other through the local index.
  • Step 402 Acquire prefix data from a local data table.
  • the data is encapsulated in the data encapsulation table, and the prefix data of the local data needs to be obtained from the local data table.
  • the local refers to the decapsulation node that receives the data encapsulation table, and the data of this node is the same as the data of the encapsulation node. akin. During the data generation process, all defined data will be stored in this node.
  • Step 403 Acquire a local index according to the prefix data, and write the local index and the prefix data into a preset public prefix table.
  • the local index is obtained according to the local prefix data, and then the corresponding local index and the prefix data are written into the preset public prefix table.
  • the embodiment of the present disclosure is the same as step 103 in the first embodiment.
  • the content in steps 303 to 306 mentioned in the disclosure of the second embodiment can also be implemented in this step, and the style of the preset common prefix table is similar to the style of the prefix table shown in FIG. 2 .
  • Step 404 using the data in the common prefix table to obtain data from the data encapsulation table, where the data includes common prefix data and suffix data.
  • the encapsulated data when decapsulating data, the encapsulated data can be obtained from the data encapsulation table by using the local index, thereby ensuring the accuracy of the decapsulated data.
  • the encapsulated data is obtained from the data encapsulation table by using the data in the common prefix table, as shown in FIG. 5 , and the following steps 501 to 504 are further included.
  • Step 501 Obtain a local index from a common prefix table.
  • the local index is the local index and the corresponding relationship between the local index and the prefix data.
  • the public prefix table shown in Figure 2 when the obtained local index is IDX1, it also After obtaining the correspondence between the local index and the public prefix 1, when the public prefix data is subsequently obtained from the encapsulation data table, it can be determined whether the correspondence is correct.
  • Step 502 using the local index to obtain the public prefix data from the data encapsulation table.
  • the local index is used to match the data in the data encapsulation table to obtain the public prefix data corresponding to the local index.
  • Step 503 using the public prefix data and the local index to obtain the suffix data from the data encapsulation table.
  • the suffix data is extracted according to the correspondence between the local index and the prefix data and the correspondence between the local index and the suffix data.
  • Step 504 Acquire data according to the common prefix data and suffix data.
  • the data finally obtained in step 503 actually contains three parts: public prefix data, local index and suffix data.
  • the prefix data and suffix data are actually established through the local index to establish a corresponding relationship, and this corresponding relationship we
  • the common prefix data and suffix data can be combined to form a complete data, which can be restored to the way it was encapsulated.
  • the obtained data includes: common prefix 1, IDX1, suffix data 1 and suffix data 2.
  • the final unpacked data is: data "public prefix 1 + suffix data 1" and data : "Common prefix data 1 + suffix data 2".
  • this embodiment completes the decapsulation work of the data encapsulation table by using the local index obtained according to the local data.
  • the correspondence between the local index and the public prefix data and the public prefix data are used.
  • Correspondence with suffix data Obtaining the encapsulated data from the data encapsulation table can ensure the accuracy of the decapsulated data.
  • the fourth embodiment of the present disclosure relates to a data processing method. This embodiment is roughly the same as the third embodiment, except that after the data is acquired, data forwarding is implemented. The specific process is shown in FIG. 6 .
  • Step 601 Receive a data encapsulation table, where the data encapsulation table includes common prefix data and suffix data.
  • this step is substantially the same as step 401 in the third embodiment, and will not be repeated here.
  • Step 602 Acquire prefix data from a local data table.
  • this step is substantially the same as step 402 in the third embodiment, and will not be repeated here.
  • Step 603 Acquire a local index according to the prefix data, and write the local index and the prefix data into a preset public prefix table.
  • this step is substantially the same as step 403 in the third embodiment, and will not be repeated here.
  • Step 604 using the data in the common prefix table to obtain data from the data encapsulation table, where the data includes common prefix data and suffix data.
  • this step is substantially the same as step 404 in the third embodiment, and will not be repeated here.
  • Step 605 use the data to find the local data table.
  • a local data table will be set up in each node to store all the defined data of this node.
  • Step 606 Obtain the instruction type and forwarding information corresponding to the data.
  • the local data table contains the instruction type and forwarding information corresponding to each data.
  • SID data As an example: the type corresponding to SID data is End SID, and End SID represents Endpoint SID, which is used to identify the network A destination address prefix (Prefix), End SID is diffused to other network elements through the IGP protocol, and it is globally visible and effective; the corresponding type of SID data is End.X SID, and the End.X SID type of instruction indicates the Endpoint of the three-layer cross-connection SID is used to identify a link in the network.
  • Prefix Prefix
  • End SID is diffused to other network elements through the IGP protocol, and it is globally visible and effective
  • the corresponding type of SID data is End.X SID
  • the End.X SID type of instruction indicates the Endpoint of the three-layer cross-connection SID is used to identify a link in the network.
  • End.X SID is spread to other network elements through the IGP protocol, which is globally visible and effective; the type corresponding to the SID data is End.DT4 SID, and End.DT4 SID indicates the PE type Endpoint
  • the SID is used to identify an IPv4 VPN instance in the network.
  • the forwarding action corresponding to the End.DT4 SID is to decapsulate the packet and look up the routing table of the IPv4 VPN instance for forwarding.
  • the End.DT4 SID is in the Virtual Private Network (Virtual Private Network, VPN) scenario, which is equivalent to the label of IPv4 VPN; the corresponding type of SID data is End.OTP SID, and End.OTP SID (OAM Endpoint with Timestamp and Punt) is an OAM type SID, used for an OAM packet Implement timestamp and translation behavior, End.OTP SID is mainly used for network diagnosis Ping/TraceRoute Tracert scenarios.
  • VPN Virtual Private Network
  • Step 607 forward data according to the instruction type and forwarding information.
  • the data forwarding work can be completed according to the instruction type of the data and the forwarding information, so that the applicability of the technical solution of the present disclosure is stronger.
  • the fifth embodiment of the present disclosure relates to an encapsulation node, as shown in FIG. 7 , including: at least one processor 701 ; and a memory 702 communicatively connected to the at least one processor 701 .
  • the memory 702 stores instructions executable by the at least one processor 701, and when the instructions are executed by the at least one processor 701, the at least one processor 701 can execute the data processing method described in any of the above method embodiments.
  • the sixth embodiment of the present disclosure relates to a decapsulation node, as shown in FIG. 8 , including: at least one processor 801 ; and a memory 802 communicatively connected to the at least one processor 801 .
  • the memory 802 stores instructions executable by the at least one processor 801, and when the instructions are executed by the at least one processor 801, the at least one processor 801 can execute the data processing method described in any of the above method embodiments.
  • the memory and the processor are connected by a bus
  • the bus may include any number of interconnected buses and bridges, and the bus connects one or more processors and various circuits of the memory together.
  • the bus may also connect together various other circuits, such as peripherals, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein.
  • the bus interface provides the interface between the bus and the transceiver.
  • a transceiver may be a single element or multiple elements, such as multiple receivers and transmitters, providing a means for communicating with various other devices over a transmission medium.
  • the data processed by the processor is transmitted on the wireless medium through the antenna, and further, the antenna also receives the data and transmits the data to the processor.
  • the processor is responsible for managing the bus and general processing, and can also provide various functions, including timing, peripheral interface, voltage regulation, power management, and other control functions. Instead, memory may be used to store data used by the processor in performing operations.
  • the seventh embodiment of the present disclosure relates to a data processing system, as shown in FIG. 9 , including: an encapsulation node 901 and a decapsulation node 902 .
  • the encapsulation node 901 is configured to receive the data to be sent, encapsulate the data to be sent in a data encapsulation table, and send the data encapsulation table.
  • the decapsulation node 902 is configured to receive the data encapsulation table, decapsulate the acquired data encapsulation table, obtain the data, and complete the forwarding of the data according to the data type and the instruction.
  • each node involved in the seventh embodiment is a logic module.
  • a logical unit can be a physical unit, a part of a physical unit, or a combination of multiple physical units.
  • the seventh embodiment does not introduce units that are not so closely related to solving the technical problems proposed by the present disclosure, but this does not mean that there are no other units in this embodiment.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

一种数据处理方法、系统、封装节点和解封装节点。数据处理方法包括：获取至少两组待发送的数据，其中，该数据包括前缀数据和后缀数据（101）；获取前缀数据的公共前缀数据（102）；根据公共前缀数据获取本地索引，并将本地索引与公共前缀数据写入预设的前缀表（103）；将后缀数据和本地索引写入预设的后缀表（104）；将前缀表中的数据和后缀表中的数据写入预设数据封装表，并发送数据封装表（105）。

Description

数据处理方法、系统、封装节点和解封装节点
相关申请的交叉引用
本申请要求享有2020年09月24日提交的名称为“数据处理方法、系统、封装节点和解封装节点”的中国专利申请CN202011014205.7的优先权，其全部内容通过引用并入本申请中。
技术领域
本公开实施例涉及通信传输领域，特别涉及一种数据处理方法、系统、封装节点和解封装节点。
背景技术
未来的网络是面向5G时代的网络，面对5G网络，网络虚拟化是承载网的主要发展方向。基于互联网协议第6版(Internet Protocol Version 6，IPv6)的分段路由转发技术(Segment Routing IPv6，SRv6)就是采用现有的IPv6转发技术，SRv6中的路由Segment直接使用128bit的IPv6地址标识，并将一些IPv6地址定义成实例化的SID(Segment ID)，每个SID有着自己显式的作用和功能，通过不同的SID操作，实现简单的网络虚拟化。传统的SID数据的处理方式为：为每一个SID数据申请一个索引，建立的SID封装表为直接索引表，将封装索引写在业务前缀表中，通过封装索引来查找SID封装表。
然而，由于SRv6技术中一个SID的大小为128bit，使得封装一个完整的SID需要的封装报文长度很大，同时在解封装过程中，SID封装表通常需要查多次，每次查表只能够获取一个SID，封装报文长度和解封查表次数的增长使得网络设备的封装和解封装压力增大，同时导致网络传输效率下降。
发明内容
本公开实施例的主要目的在于提出一种数据处理方法、系统、封装节点和解封装节点，旨在实现数据在存储时的单独存表，使得可以节省大量的表项空间，大大减小节点存储压力。
为实现上述目的，本公开实施例提供了一种数据处理方法，该方法包括以下步骤：获取至少两组待发送的数据，该数据包括前缀数据和后缀数据；获取前缀数据的公共前缀数 据；根据公共前缀数据获取本地索引，并将本地索引与公共前缀数据写入预设的前缀表；将后缀数据和本地索引写入预设的后缀表；将前缀表中的数据和后缀表中的数据写入预设的数据封装表，并发送数据封装表。
为实现上述目的，本公开实施例还提供了一种数据处理方法，该方法包括以下步骤：接收数据封装表，该数据封装表中包含公共前缀数据和后缀数据；从本地数据表中获取前缀数据；根据前缀数据获取本地索引，并将本地索引写入预设公共前缀表；利用公共前缀表中的数据从数据封装表中获取数据，该数据包含公共前缀数据和后缀数据。
为实现上述目的，本公开实施例还提出了一种封装节点，包括：至少一个处理器；以及与至少一个处理器通信连接的存储器，该存储器存储有可被至少一个处理器执行的指令，所述指令被至少一个处理器执行时使至少一个处理器能够执行上述数据处理方法。
为实现上述目的，本公开实施例还提出了一种解封装节点，包括：至少一个处理器；以及与至少一个处理器通信连接的存储器，该存储器存储有可被至少一个处理器执行的指令，所述指令被至少一个处理器执行时使至少一个处理器能够执行上述数据处理方法。
为实现上述目的，本公开实施例还提出了一种数据处理系统，包括：上述封装节点和上述解封装节点。
附图说明
一个或多个实施例通过与之对应的附图进行示例性说明，这些示例性说明并不构成对实施例的限定。
图1是本公开第一实施例提供的数据处理方法的流程图；
图2是图1所示的本公开第一实施例提供的数据处理方法中预设的前缀表、预设的后缀表和预设的数据封装表的结构示意图；
图3是本公开第二实施例提供的数据处理方法的流程图；
图4是本公开第三实施例提供的数据处理方法的流程图；
图5是图4所示的本公开第三实施例提供的数据处理方法中步骤404的流程图；
图6是本公开第四实施例提供的数据处理方法的流程图；
图7是本公开第五实施例提供的封装节点的结构示意图；
图8是本公开第六实施例提供的解封装节点的结构示意图；
图9是本公开第七实施例提供的数据处理系统的结构示意图。
具体实施方式
为使本公开实施例的目的、技术方案和优点更加清楚，下面将结合附图对本公开的各实施例进行详细的阐述。然而，本领域的普通技术人员可以理解，在本公开各实施例中，为了使读者更好地理解本公开而提出了许多技术细节。但是，即使没有这些技术细节和基于以下各实施例的种种变化和修改，也可以实现本公开所要求保护的技术方案。以下各个实施例的划分是为了描述方便，不应对本公开的具体实现方式构成任何限定，各个实施例在不矛盾的前提下可以相互结合相互引用。
本公开第一实施例涉及一种数据处理方法，如图1所示，具体包括以下步骤101至105。
步骤101，获取至少两组待发送的数据，该数据包括前缀数据和后缀数据。
具体地说，数据由前缀数据和后缀数据两部分组成，具体的格式是前缀数据:后缀数据，其中前缀数据占据IPv6地址的高比特位，后缀数据部分占据IPv6地址的剩余部分。以SID数据为例，前缀数据是指定位数据Locator，定位数据Locator具有定位功能，节点配置Locator之后，系统会生成一条Locator网段路由，并且通过内部网关协议(Interior Gateway Protocol，IGP)在分段路由(segment routing，SR)域内扩散，网络里其他节点通过Locator网段路由就可以定位到本节点，同时本节点发布的所有SRv6SID也都可以通过该Locator数据对应的网段路由到达，后缀数据是指功能数据Function，功能数据Function代表设备的指令Instruction，这些指令都由设备预先设定，用于指示SID数据的生成节点进行相应的功能操作，后缀数据部分还可以分出一个可选的参数段Arguments，此时SID数据的格式变为Locator:Function:Arguments，Arguments占据IPv6地址的低比特位，通过Arguments字段可以定义一些报文的流和服务等信息，Function和Arguments都是可以定义的。
步骤102，获取前缀数据的公共前缀数据。
具体地说，以SID数据为例，虽然前缀数据在SR域内是唯一的，但在一些情况下(比如说在Anycast保护场景下)，多个设备可能配置相同的Locator，我们就可以从所获取到的多组SID数据的前缀数据中至少提取到一个公共前缀数据，比如说所获取到的数据包括：2002::0:0:0/96，2002::1:0:0/96，2002::2:0:0/96，2001::0:0:0/95，2001::1:0:0/95，2001::2:0:0/95，那么所提取到的公共前缀为2002::和2001::，以上所提取到的数据和获取公共前缀的方法及形式只为举例说明，在本公开实际应用过程中，也可以采取其他的数据和方法，此处不一一赘述。
步骤103，根据公共前缀数据获取本地索引，并将本地索引与公共前缀数据写入预设 的前缀表。
具体地说，利用公共前缀数据获取本地索引的过程可以使用软件模块来完成，软件模块中包含算法，当获取到公共前缀数据后，首先需要获取这个公共前缀数据的所占据的比特位数，再根据占据的比特位数，来选择所获取的本地索引的大小，本地索引的是从本地索引资源管理中获取的；之后再将输入的公共前缀数据和与之对应的本地索引一同写入预设的前缀表中，预设的前缀表可以清楚的反映出本地索引与公共前缀数据的对应关系，预设的前缀表的样式如图2所示，公共前缀n是指第n个公共前缀，IDXn是指与n个公共前缀所对应的本地索引，以上所提取到的获取本地索引的方法只为举例说明，在本公开实际应用过程中，也可以采取其他的方法，此处不一一赘述。
优选地，本步骤进一步包括：当公共前缀数据删除时，则减少前缀表中公共前缀数据对应的本地索引的引用次数。例如，当本地索引的引用次数为0时，删除前缀表中与公共前缀数据对应的本地索引。
借此，可以在检测到公共前缀数据删除，且该公共前缀数据对应的本地索引的引用次数为0时，删除与公共前缀数据对应的本地索引，使本地索引可以与其他公共前缀数据建立对应关系，进而可以提高索引资源的利用率。
步骤104，将后缀数据和本地索引写入预设的后缀表。
具体地说，将后缀数据和本地索引写入预设的后缀表包括以下步骤：将后缀数据对应的前缀数据替换为与之对应的本地索引，获取一个新的后缀数据，新的后缀数据是由本地索引和后缀数据组成的，再将新的后缀数据写入预设的后缀表，预设的后缀表可以清楚的反映出本地索引与后缀数据的对应关系。预设的后缀表的样式如图2所示，后缀表中后缀数据n+IDXn是指新的后缀数据。
借此，在将后缀数据和本地索引写入后缀表时，会将后缀数据所对应的前缀数据替换为与该前缀数据对应的本地索引，可以在数据解封时根据本地索引的对应关系还原数据，进而可以更准确地还原数据。
步骤105，将前缀表中的数据和后缀表中的数据写入预设的数据封装表，并发送数据封装表。
具体地说，数据封装表实际上包含两部分数据：前缀表的数据和后缀表的数据，这两部分数据是单独存放的，两者互不干扰，两部分数据可以通过索引建立对应的关系，将前缀表中的数据和后缀表中的数据全部写入数据封装表之后，便可以将数据封装表发送出去，而发送数据封装表可以通过IGP协议来完成，也可以通过其他方式进行，此处不一一赘述。 数据封装表的样式如图2所示，是由前缀表和后缀表共同形成的，两者之间通过本地索引建立隐形的对应关系。
本实施例相对于现有技术而言，在封装节点，获取至少两组待发送的数据，其中数据包括前缀数据和后缀数据，从前缀数据中提取公共前缀数据，根据公共前缀数据获取本地索引，并将本地索引与公共前缀数据写入预设的前缀表，将后缀数据和本地索引写入预设的后缀表，将前缀表中的数据和后缀表中的数据写入预设数据封装表，并发送数据封装表，可以将实现将公共前缀数据的单独存放且一个公共前缀只需存储一次，进而可以节省大量的表项空间的同时减小节点存储压力。
本公开第二实施例涉及一种数据处理方法，本实施例与第一实施例大致相同，区别在于，本实施例细化了步骤103和步骤104，如图3所示，具体包括以下步骤301至308。
步骤301，获取至少两组待发送的数据，该数据包括前缀数据和后缀数据。
具体地说，本步骤与第一实施例中的步骤101大致相同，此处不一一赘述。
步骤302，获取前缀数据的公共前缀数据。
具体地说，本步骤与第一实施例中的步骤102大致相同，此处不一一赘述。
步骤303，判断公共前缀数据是否首次出现。
具体地说，每次获取到一个公共前缀数据时，首先要判断这个公共前缀数据之间有没有出现过，若这个公共前缀数据第一次出现则执行步骤304，若这个公共前缀数据并非第一次出现则执行步骤305。
步骤304，根据公共前缀数据获取本地索引，并将本地索引与公共前缀写入前缀表。
具体地说，本步骤与第一实施例中的步骤103大致相同，此处不一一赘述。
步骤305，增加前缀表中公共前缀数据对应的本地索引的引用次数。
具体地说，因为所获取到的公共前缀并非第一次出现，就说明在此之前，就已经为这个公共前缀数据获取过本地索引了，前缀表中是包含这个公共前缀数据和与之对应的本地索引的，增加这个本地索引的引用次数就相当于将公共前缀数据和本地索引写入前缀表中，如果重复为这个公共前缀数据获取本地索引的话，就会导致后续解封装后的数据不准确，实际上在检测到公共前缀数据被删除时，可以删除前缀表中与被删除的公共前缀数据对应的本地索引，将本地索引释放到索引资源池中，以供再次分配。
步骤306，将后缀数据对应的前缀数据替换为本地索引，获取新的后缀数据。
具体地说，数据是由前缀数据和后缀数据组成的，而我们又为前缀数据申请了一个本 地索引，也将前缀数据单独存放了一个表，因此也需要将后缀数据单独存放，在单独存放后缀数据时，需要将与后缀数据对应的前缀数据替换为与前缀数据对应的本地索引，使得后缀表与前缀表之间有一种关联，保证解封装后的数据的准确性。
步骤307，将新的后缀数据写入预设的后缀表。
具体地说，写入预设的后缀表的数据是由后缀数据和本地索引组成的，这个本地索引是与后缀数据对应的前缀数据替换为与前缀数据对应的本地索引。
步骤308，将前缀表中的数据和后缀表中的数据写入预设的数据封装表，并发送数据封装表。
具体地说，本步骤与第一实施例中的步骤104大致相同，此处不一一赘述。
本实施例相对于现有技术而言，在第一实施例地基础上，还可以在获取本地索引时，避免为同一公共前缀数据重复申请本地索引，即为同一个公共前缀数据只申请一个公共索引，避免同一个公共前缀数据使用多个本地索引，还可以在检测到公共前缀数据被删除时，释放与之相对应的本地索引，进而可以提高索引资源的利用率。
本公开第三实施例涉及一种数据处理方法，如图4所示，具体包括以下步骤401至404。
步骤401，接收数据封装表，该数据封装表中包含公共前缀数据和后缀数据。
具体地说，本实施例是在解封装节点接收数据封装表，所接收到的数据封装表中，实际上是分为两部分的，第一部分存储公共前缀数据以及与之对应的本地索引，第二部分所存储的是后缀数据以及与之对应的本地索引，这两部分的内容可以通过本地索引相互对应起来。
步骤402，从本地数据表中获取前缀数据。
具体地说，数据是封装在数据封装表中的，需要从本地数据表中获取本地数据的前缀数据，本地是指这个接收数据封装表的解封装节点，此节点的数据是与封装节点的数据类似的。在数据生成的过程中，会在这个节点存储所有定义的数据。
步骤403，根据前缀数据获取本地索引，并将本地索引和前缀数据写入预设公共前缀表。
具体地说，根据本地的前缀数据来获取本地索引，再将本地索引与前缀数据相对应的写入预设的公共前缀表，本公开实施例与第一实施例中步骤103是相同的，本公开第二实施例中提到的步骤303至步骤306中的内容在本步骤中也可实现，预设的公共前缀表的样式跟图2所示的前缀表的样式相似。
步骤404，利用公共前缀表中的数据从数据封装表中获取数据，该数据包含公共前缀数据和后缀数据。
借此，可以实现在解封数据时，利用本地索引从数据封装表中获取被封装的数据，进而可以保证所解封的数据的准确性。
具体地说，在本实施方式中利用公共前缀表中的数据从数据封装表中获取到所被封装的数据，如图5所示，还包括以下步骤501至504。
步骤501，从公共前缀表中获取本地索引。
具体地说，从公共前缀表中获取的实际上是本地索引以及本地索引与前缀数据的对应关系，以图2所示的公共前缀表为例，当所获取到的本地索引为IDX1时，同时还获取了该本地索引与公共前缀1的对应关系，在后续从封装数据表中获取公共前缀数据时，就可以判断对应关系是否正确。
步骤502，利用本地索引从数据封装表中获取的公共前缀数据。
具体地说，所获取到的本地索引与前缀数据之间是有对应的关系的，利用这个本地索引去跟数据封装表中的数据做匹配，获取到与本地索引相对应的公共前缀数据。
步骤503，利用公共前缀数据和本地索引从数据封装表中获取后缀数据。
具体地说，利用本地索引获取到公共前缀数据之后，再根据本地索引与前缀数据的对应关系以及本地索引与后缀数据的对应关系将后缀数据提取出来。
步骤504，根据公共前缀数据和后缀数据获取数据。
具体地说，步骤503最后所获取到的数据实际上包含三部分：公共前缀数据、本地索引和后缀数据，前缀数据和后缀数据实际上是通过本地索引来建立对应的关系，以及这个对应关系我们就可以将公共前缀数据和后缀数据结合起来，构成一个完整的数据，使其恢复到封装时的样子，以图2所示的数据封装表为例，当以本地索引IDX1去解封数据封装表时，所获取到的数据包括：公共前缀1、IDX1、后缀数据1和后缀数据2，根据他们之间的对应关系，最终解封的数据为：数据“公共前缀1+后缀数据1”以及数据：“公共前缀数据1+后缀数据2”。
本实施例相对于现有技术而言，通过根据本地数据所获取的本地索引来完成数据封装表的解封工作，在解封数据时，使用本地索引与公共前缀数据的对应关系和公共前缀数据与后缀数据的对应关系从数据封装表中获取被封装的数据，可以保证所解封的数据的准确性。
本公开第四实施例涉及一种数据处理方法，本实施例与第三实施例大致相同，区别在于，在获取到数据之后，还有实现对数据的转发，具体流程如图6所示。
步骤601，接收数据封装表，该数据封装表中包含公共前缀数据和后缀数据。
具体地说，本步骤与第三实施例中的步骤401大致相同，此处不一一赘述。
步骤602，从本地数据表中获取前缀数据。
具体地说，本步骤与第三实施例中的步骤402大致相同，此处不一一赘述。
步骤603，根据前缀数据获取本地索引，并将本地索引和前缀数据写入预设公共前缀表。
具体地说，本步骤与第三实施例中的步骤403大致相同，此处不一一赘述。
步骤604，利用公共前缀表中的数据从数据封装表中获取数据，数据包含公共前缀数据和后缀数据。
具体地说，本步骤与第三实施例中的步骤404大致相同，此处不一一赘述。
步骤605，利用数据查找本地数据表。
具体地说，在每个节点定义数据的过程中，会在每个节点设置一个本地数据表，用于保存本节点所有定义的数据。
步骤606，获取数据对应的指令类型和转发信息。
具体地说，本地数据表中包含每个数据所对应的指令类型和转发信息，比如说，以SID数据为例：SID数据对应的类型为End SID，End SID表示Endpoint SID，用于标识网络中的某个目的地址前缀(Prefix)，End SID通过IGP协议扩散到其他网元，全局可见有效；SID数据对应的类型为End.X SID，End.X SID类型的指令表示三层交叉连接的Endpoint SID，用于标识网络中的某条链路，End.X SID通过IGP协议扩散到其他网元，全局可见有效；SID数据对应的类型为End.DT4 SID，End.DT4 SID表示PE类型的Endpoint SID，用于标识网络中的某个IPv4 VPN实例，End.DT4 SID对应的转发动作是解封装报文，并且查找IPv4 VPN实例路由表转发，End.DT4 SID在虚拟专用网络(Virtual Private Network，VPN)场景使用，等价于IPv4 VPN的标签；SID数据对应的类型为End.OTP SID，End.OTP SID(OAM Endpoint with Timestamp and Punt)是一个OAM类型的SID，用于对一个OAM报文实行时间戳和平移行为，End.OTP SID主要用于网络诊断Ping/跟踪路由Tracert场景。
步骤607，根据指令类型和转发信息转发数据。
本实施例相对于现有技术而言，在将数据解封后，可以根据数据的指令类型和转发信 息完成数据的转发工作，使得本公开技术方案的适用性更强。
此外，应当理解的是，上面各种方法的步骤划分，只是为了描述清楚，实现时可以合并为一个步骤或者对某些步骤进行拆分，分解为多个步骤，只要包括相同的逻辑关系，都在本专利的保护范围内；对算法中或者流程中添加无关紧要的修改或者引入无关紧要的设计，但不改变其算法和流程的核心设计都在该专利的保护范围内。
本公开第五实施例涉及一种封装节点，如图7所示，包括：至少一个处理器701；以及与至少一个处理器701通信连接的存储器702。存储器702存储有可被至少一个处理器701执行的指令，指令被至少一个处理器701执行时使至少一个处理器701能够执行上述任一方法实施例所描述的数据处理方法。
本公开第六实施例涉及一种解封装节点，如图8所示，包括：至少一个处理器801；以及与至少一个处理器801通信连接的存储器802。存储器802存储有可被至少一个处理器801执行的指令，指令被至少一个处理器801执行时使至少一个处理器801能够执行上述任一方法实施例所描述的数据处理方法。
在本公开第五实施例和第六实施例中，存储器和处理器采用总线方式连接，总线可以包括任意数量的互联的总线和桥，总线将一个或多个处理器和存储器的各种电路连接在一起。总线还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路连接在一起，这些都是本领域所公知的，因此，本文不再对其进行进一步描述。总线接口在总线和收发机之间提供接口。收发机可以是一个元件，也可以是多个元件，比如多个接收器和发送器，提供用于在传输介质上与各种其他装置通信的单元。经处理器处理的数据通过天线在无线介质上进行传输，进一步，天线还接收数据并将数据传输给处理器。
处理器负责管理总线和通常的处理，还可以提供各种功能，包括定时，外围接口，电压调节、电源管理以及其他控制功能。而存储器可以被用于存储处理器在执行操作时所使用的数据。
本公开第七实施例涉及一种数据处理系统，如图9所示，包括：封装节点901和解封装节点902。
封装节点901配置为接收待发送的数据，将待发送的数据封装在数据封装表中并发送数据封装表。解封装节点902配置为接收数据封装表，并解封所获取到的数据封装表，获取数据，根据数据的类型和指令完成对数据的转发。
值得一提的是，第七实施例中所涉及到的各节点均为逻辑模块。在实际应用中，一个逻辑单元可以是一个物理单元，也可以是一个物理单元的一部分，还可以以多个物理单元 的组合实现。此外，为了突出本公开的创新部分，第七实施例中并没有将与解决本公开所提出的技术问题关系不太密切的单元引入，但这并不表明本实施例中不存在其它的单元。
本领域的普通技术人员可以理解，上述各实施例是实现本公开的具体实施例，而在实际应用中，可以在形式上和细节上对其作各种改变，而不偏离本公开的精神和范围。

Claims (12)

  1. 一种数据处理方法，包括：
    获取至少两组待发送的数据，其中，所述数据包括前缀数据和后缀数据；
    获取所述前缀数据的公共前缀数据；
    根据所述公共前缀数据获取本地索引，并将所述本地索引与所述公共前缀数据写入预设的前缀表；
    将所述后缀数据和所述本地索引写入预设的后缀表；
    将所述前缀表中的数据和所述后缀表中的数据写入预设的数据封装表，并发送所述数据封装表。
  2. 根据权利要求1所述的数据处理方法，其中，所述根据所述公共前缀数据获取本地索引，并将所述本地索引与所述公共前缀数据写入预设的前缀表，包括：
    判断所述公共前缀数据是否首次出现；
    若所述公共前缀数据首次出现，则根据所述公共前缀数据获取所述本地索引，并将所述本地索引与所述公共前缀写入所述前缀表；
    若所述公共前缀数据不是首次出现，则增加所述前缀表中所述公共前缀数据对应的所述本地索引的引用次数。
  3. 根据权利要求1所述的数据处理方法，其中，所述根据所述公共前缀数据获取本地索引，并将所述本地索引与所述公共前缀数据写入预设的前缀表还包括：
    当所述公共前缀数据删除时，则减少所述前缀表中所述公共前缀数据对应的所述本地索引的引用次数，其中，当所述本地索引的引用次数为0时，删除所述前缀表中与所述公共前缀数据对应的所述本地索引。
  4. 根据权利要求1所述的数据处理方法，其中，所述将所述后缀数据和所述本地索引写入预设的后缀表，包括：
    将所述后缀数据对应的所述前缀数据替换为所述本地索引，获取新的后缀数据，其中，所述新的后缀数据包括所述本地索引和所述后缀数据；
    将所述新的后缀数据写入所述预设的后缀表。
  5. 一种数据处理方法，包括：
    接收数据封装表，其中，所述数据封装表中包含公共前缀数据和后缀数据；
    从本地数据表中获取前缀数据；
    根据所述前缀数据获取本地索引，并将所述本地索引写入预设公共前缀表；
    利用所述公共前缀表中的数据从所述数据封装表中获取数据，其中，所述数据包 含所述公共前缀数据和所述后缀数据。
  6. 根据权利要求5所述的数据处理方法，其中，所述利用所述公共前缀表中的数据从所述数据封装表中获取数据，包括：
    从所述公共前缀表获取所述本地索引；
    利用所述本地索引从所述数据封装表中获取的所述公共前缀数据；
    利用所述公共前缀和所述本地索引从所述数据封装表中获取所述后缀数据；
    根据所述公共前缀数据和所述后缀数据获取所述数据。
  7. 根据权利要求5所述的数据处理方法，其中，所述利用所述前缀表中的数据从所述数据封装表中获取数据之后还包括：
    利用所述数据查找本地数据表；
    获取所述数据对应的指令类型和转发信息；
    根据所述指令类型和所述转发信息转发所述数据。
  8. 一种封装节点，包括：
    至少一个处理器；以及，
    与所述至少一个处理器通信连接的存储器；其中，
    所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行时使所述至少一个处理器能够执行如权利要求1至4中任意一项所述数据处理方法。
  9. 一种解封装节点，包括：
    至少一个处理器；以及，
    与所述至少一个处理器通信连接的存储器；其中，
    所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行时使所述至少一个处理器能够执行如权利要求5至7中任意一项所述数据处理方法。
  10. 一种数据处理系统，包括：权利要求8所述的封装节点和权利要求9所述的解封装节点。
  11. 根据权利要求10所述的数据处理系统，其中，所述封装节点配置为接收待发送的数据，将待发送的数据封装在数据封装表中并发送所述数据封装表。
  12. 根据权利要求11所述的数据处理系统，其中，所述解封装节点配置为接收所述数据封装表，并解封所获取到的数据封装表，获取数据，根据所述数据的类型和指令完成对所述数据的转发。
PCT/CN2021/110348 2020-09-24 2021-08-03 数据处理方法、系统、封装节点和解封装节点 WO2022062679A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US18/027,936 US20230370375A1 (en) 2020-09-24 2021-08-03 Data processing method and system, encapsulation node, and de-encapsulation node
EP21871056.4A EP4220427A4 (en) 2020-09-24 2021-08-03 DATA PROCESSING METHOD AND SYSTEM, ENCAPSULATION NODE AND DE-CAPSULATION NODE

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202011014205.7A CN111930757B (zh) 2020-09-24 2020-09-24 数据处理方法、系统、封装节点和解封装节点
CN202011014205.7 2020-09-24

Publications (1)

Publication Number Publication Date
WO2022062679A1 true WO2022062679A1 (zh) 2022-03-31

Family

ID=73334100

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/110348 WO2022062679A1 (zh) 2020-09-24 2021-08-03 数据处理方法、系统、封装节点和解封装节点

Country Status (4)

Country Link
US (1) US20230370375A1 (zh)
EP (1) EP4220427A4 (zh)
CN (1) CN111930757B (zh)
WO (1) WO2022062679A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116506341A (zh) * 2020-03-09 2023-07-28 华为技术有限公司 一种生成段标识sid的方法和网络设备
CN111930757B (zh) * 2020-09-24 2021-01-12 南京中兴软件有限责任公司 数据处理方法、系统、封装节点和解封装节点
CN112948646B (zh) * 2021-04-01 2022-12-13 支付宝(杭州)信息技术有限公司 数据识别方法和装置

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1483286A (zh) * 2000-11-01 2004-03-17 松下电器产业株式会社 数据发送装置和数据接收装置
US20100082545A1 (en) * 2008-09-30 2010-04-01 International Business Machines Corporation Compression of sorted value indexes using common prefixes
CN103870492A (zh) * 2012-12-14 2014-06-18 腾讯科技（深圳）有限公司 一种基于键排序的数据存储方法和装置
CN105075194A (zh) * 2013-03-11 2015-11-18 思科技术公司 有索引的段id
CN107968752A (zh) * 2016-10-20 2018-04-27 新华三技术有限公司 一种sid获取方法和装置
CN109067652A (zh) * 2018-09-25 2018-12-21 盛科网络（苏州）有限公司 一种IPv6分段路由中节约段标识开销的方法及装置
CN111930757A (zh) * 2020-09-24 2020-11-13 南京中兴软件有限责任公司 数据处理方法、系统、封装节点和解封装节点

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
NL2002799C2 (en) * 2009-04-24 2010-10-26 Univ Delft Tech Data structure, method and system for address lookup.
CN101539950A (zh) * 2009-05-08 2009-09-23 成都市华为赛门铁克科技有限公司 数据存取方法和装置
CN111611214B (zh) * 2020-05-25 2023-08-18 广州翔声智能科技有限公司 一种大数据存储方法

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1483286A (zh) * 2000-11-01 2004-03-17 松下电器产业株式会社 数据发送装置和数据接收装置
US20100082545A1 (en) * 2008-09-30 2010-04-01 International Business Machines Corporation Compression of sorted value indexes using common prefixes
CN103870492A (zh) * 2012-12-14 2014-06-18 腾讯科技（深圳）有限公司 一种基于键排序的数据存储方法和装置
CN105075194A (zh) * 2013-03-11 2015-11-18 思科技术公司 有索引的段id
CN107968752A (zh) * 2016-10-20 2018-04-27 新华三技术有限公司 一种sid获取方法和装置
CN109067652A (zh) * 2018-09-25 2018-12-21 盛科网络（苏州）有限公司 一种IPv6分段路由中节约段标识开销的方法及装置
CN111930757A (zh) * 2020-09-24 2020-11-13 南京中兴软件有限责任公司 数据处理方法、系统、封装节点和解封装节点

Also Published As

Publication number Publication date
EP4220427A4 (en) 2024-06-05
US20230370375A1 (en) 2023-11-16
EP4220427A1 (en) 2023-08-02
CN111930757A (zh) 2020-11-13
CN111930757B (zh) 2021-01-12

Similar Documents

Publication Publication Date Title
WO2022062679A1 (zh) 数据处理方法、系统、封装节点和解封装节点
EP3747167B1 (en) Multi-cloud vpc routing and registration
TWI744359B (zh) 一種資料傳輸的方法及網路設備
US10320664B2 (en) Cloud overlay for operations administration and management
EP4113919A1 (en) Method for forwarding message in srv6 service function chain, sff and sf device
US20160261496A1 (en) Packet forwarding in data center network
WO2020156166A1 (zh) 用于处理报文的方法和装置
CN110505244B (zh) 远程隧道访问技术网关以及服务器
JP2019033534A (ja) データパケット転送
US10574570B2 (en) Communication processing method and apparatus
CN103888386A (zh) 可扩展虚拟局域网报文的传输方法及装置、系统
EP2680507B1 (en) Packet forwarding method and system, and relay agent device
US11956148B2 (en) Packet transmission method and device
WO2021196717A1 (zh) 组播流量传输方法、装置、通信节点及存储介质
US11818096B2 (en) Enforcement of inter-segment traffic policies by network fabric control plane
WO2021197141A1 (zh) 业务处理方法、装置、设备及存储介质
CN104486227A (zh) 通过VxLAN技术实现IPv6灵活部署的系统及方法
US20240039846A1 (en) Asymmetric Addressing For Limited Domains and Internet
WO2021147357A1 (zh) 路由信息的发布方法、装置及系统
CN108512737B (zh) 一种数据中心ip层互联的方法和sdn控制器
WO2017036384A1 (zh) 运营商边缘设备及数据转发方法
WO2024032636A1 (zh) 实现SRV6 policy网络H-VPN分层管理的方法、装置及相关设备
US20230006921A1 (en) Data stream processing method and apparatus
US20230318966A1 (en) Packet Transmission Method, Correspondence Obtaining Method, Apparatus, and System
CN116743681A (zh) Vxlan网络中报文转发方法、装置、计算机设备和存储介质

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: 21871056

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2021871056

Country of ref document: EP

Effective date: 20230424