CN114268668A - Data processing method, system, device, electronic equipment and storage medium - Google Patents

Data processing method, system, device, electronic equipment and storage medium Download PDF

Info

Publication number
CN114268668A
CN114268668A CN202111564692.9A CN202111564692A CN114268668A CN 114268668 A CN114268668 A CN 114268668A CN 202111564692 A CN202111564692 A CN 202111564692A CN 114268668 A CN114268668 A CN 114268668A
Authority
CN
China
Prior art keywords
packet
message
proxy node
forwarding
proxy
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
CN202111564692.9A
Other languages
Chinese (zh)
Inventor
扶奉超
曹维华
王鹏
谢元宝
李文云
朱华虹
刘浩
李建钊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Telecom Corp Ltd
Original Assignee
China Telecom Corp Ltd
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 China Telecom Corp Ltd filed Critical China Telecom Corp Ltd
Priority to CN202111564692.9A priority Critical patent/CN114268668A/en
Publication of CN114268668A publication Critical patent/CN114268668A/en
Pending legal-status Critical Current

Links

Images

Abstract

The present disclosure provides a data processing method, system, apparatus, electronic device, and storage medium. The method comprises the following steps: receiving a first message sent by a Service Function Forwarder (SFF); acquiring a first Service Index (SI) and a second SI, wherein the second SI is a next SI of the first SI, the first SI represents a first Service Function (SF), the second SI represents a second SF, and the first SI is connected to the first proxy node; forwarding the first packet to the first SF, so that the first SF processes the first packet to obtain a second packet; receiving the second message forwarded by the first SF; and if the second SF is connected to the first proxy node, forwarding the second packet to the second SF, so that the second SF processes the second packet. The method can save computer resources, reduce computer processing time delay and improve computer processing efficiency.

Description

Data processing method, system, device, electronic equipment and storage medium
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a data processing method, system, apparatus, electronic device, and storage medium.
Background
Service Function Chain (SFC) technology can enable network traffic to pass through various Service functions (also referred to as Service functions) in a predetermined order required by Service logic.
In order to enable a traditional SF (Service Function) which does not support an SFC (Service Function) to participate in Service orchestration, a logical Network element Proxy is started between an SF which does not recognize an NSH (Network Service Header) message and an SFF (Service Function Forwarder) in an SFC Network, and the Proxy is responsible for encapsulating and decapsulating a NSH Header of the message.
In the related technology, the Proxy receives the message sent by the SFF, strips the NSH head, transfers the NSH head to the corresponding SF, sends the NSH head to the Proxy for packaging after the SF is processed, and then forwards the NSH head to the SFF. When multiple SFs are connected to a Proxy, repeated encapsulation and decapsulation performed by the Proxy takes a lot of processing time, which reduces network processing efficiency.
It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
The present disclosure provides a data processing method, system, device, electronic device, and storage medium, which can save computer resources, reduce computer processing time, reduce computer processing delay, and improve computer processing efficiency.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.
The embodiment of the present disclosure provides a data processing method, which is executed by a first proxy node, and the method includes: receiving a first message sent by a Service Function Forwarder (SFF); acquiring a first Service Index (SI) and a second SI, wherein the second SI is a next SI of the first SI, the first SI represents a first Service Function (SF), the second SI represents a second SF, and the first SI is connected to the first proxy node; forwarding the first packet to the first SF, so that the first SF processes the first packet to obtain a second packet; receiving the second message forwarded by the first SF; and if the second SF is connected to the first proxy node, forwarding the second packet to the second SF, so that the second SF processes the second packet.
The embodiment of the present disclosure provides a data processing system, which includes a first proxy node, an SFF, a first SF, and a second SF; the SFF is used for sending a first message to the first proxy node; the first proxy node is configured to receive the first packet, and acquire a first SI and a second SI, where the second SI is a next SI of the first SI, the first SI represents the first SF, the second SI represents the second SF, and the first SI is connected to the first proxy node; the first proxy node is further configured to forward the first packet to the first SF; the first SF is used for receiving the first message, processing the first message to obtain a second message, and forwarding the second message to the first proxy node; the first proxy node is further configured to receive the second packet, and forward the second packet to the second SF if the second SF is connected to the first proxy node; the second SF is configured to receive the second packet and process the second packet.
An embodiment of the present disclosure provides a data processing apparatus, including: the first message receiving module is used for receiving a first message sent by the service function forwarder SFF; an SI obtaining module, configured to obtain a first service index SI and a second SI, where the second SI is a next SI of the first SI, the first SI represents a first service function SF, the second SI represents a second SF, and the first SI is connected to the first proxy node; a first packet forwarding module, configured to forward the first packet to the first SF, so that the first SF processes the first packet to obtain a second packet; a second message receiving module, configured to receive the second message forwarded by the first SF; a second packet forwarding module, configured to forward the second packet to the second SF if the second SF is connected to the first proxy node, so that the second SF processes the second packet.
An embodiment of the present disclosure provides an electronic device, including: at least one processor; a storage terminal device for storing at least one program which, when executed by at least one processor, causes the at least one processor to implement any one of the data processing methods described above.
The disclosed embodiment provides a computer readable storage medium, on which a computer program is stored, wherein the computer program is used for implementing any one of the data processing methods when being executed by a processor.
In the data processing method provided by the embodiment of the present disclosure, the first processing node may obtain the first SI and the second SI, and if the first processing node finds that the first SI and the second SI are both connected to the first processing node, the first processing node forwards the packet to the first SI for processing, and after receiving the packet returned by the first SI, the first processing node may directly forward the packet returned by the first SI to the second SI for processing without encapsulation and decapsulation, thereby saving computer resources, reducing computer processing time, reducing computer processing delay, and improving computer processing efficiency.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.
FIG. 1 is a diagram illustrating an SFC service chain model with Proxy present according to an example.
FIG. 2 is a flow chart illustrating a method of data processing according to an exemplary embodiment.
FIG. 3 is a block diagram illustrating a data processing apparatus according to an example embodiment.
Fig. 4 is a schematic structural diagram of an electronic device according to an exemplary embodiment.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor terminal devices and/or microcontroller terminal devices.
FIG. 1 is a diagram illustrating an SFC service chain model with Proxy present according to an example.
Referring to fig. 1, the SFC Service chain model includes a Classifier (Service Classifier, SC), an SFF1, an SFF2, an SFC Proxy, an SF1, an SF2, an SF3, an SF4, and an SF5, where the SFC Proxy is connected to the SFF1, the SF1, the SF2, and the SF3, respectively, the SFC Proxy may forward a packet forwarded by the SFF1 to the SF1, the SF2, and the SF3, and the SFF2 is connected to the SF4 and the SF5, respectively.
Taking the Service flow SF1 → SF3 → SF4 as an example, table 1 shows a corresponding relationship between SPI (Service Function Path Identifier), SI (Service Index), SF and SFF.
TABLE 1
SPI SI SF SFF
1 255 SF1 SFF1
1 254 SF3 SFF1
1 253 SF4 SFF2
In the related art, taking the service flow model shown in fig. 1 and table 1 as an example, the SFC Proxy processing flow is as follows:
step 1: after the message reaches the classifier, encapsulating the original message into an NSH (Network Service Header) Header with SPI information, inquiring the next SF on the SFF1, and then forwarding the message to the SFF1 by the classifier;
step 2: after the message reaches the SFF1, inquiring the SF1 as the SF which does not support the SFC, and then transferring the message to the SFC Proxy;
step 3: the SFC Proxy removes NSH encapsulation and forwards the message to SF 1;
step 4: after the SF1 is processed, the data is returned and sent to the SFC Proxy, and the SFC Proxy encapsulates the NSH message header and forwards the NSH message header to the SFF 1;
step 5: the SFF1 inquires that the next SF is SF3, is also local, and then forwards the SF to the SFC Proxy, the SFC Proxy carries out decapsulation, and the decapsulated message is sent to SF 3;
and Step6, after the SF3 is processed, the message is sent to the SFC Proxy, the header of the NSH message is packaged on the SFC Proxy and is forwarded to the SFF1, the SFF1 inquires the next SF, namely the SF4 is on the SFF2, and then the message is forwarded to the SFF2 for forwarding and processing.
To date, Proxy consumes a total of 2 decapsulations and encapsulations.
Hereinafter, each step of the data processing method in the exemplary embodiment of the present disclosure will be described in more detail with reference to the drawings and the embodiment.
FIG. 2 is a flow chart illustrating a method of data processing according to an exemplary embodiment. The method provided by the embodiment of the present disclosure may be executed by the first proxy node, but the present disclosure is not limited thereto.
As shown in fig. 2, a data processing method provided by an embodiment of the present disclosure may include the following steps.
In step S202, a first packet sent by an SFF (Service Function Forwarder) is received.
In this embodiment of the present disclosure, the first Proxy node may receive a first packet sent by an SFF, where the first Proxy node may be, for example, an SFC Proxy shown in fig. 1, and the SFC Proxy may receive the first packet sent by the SFF 1.
In an exemplary embodiment, the first packet is encapsulated with a Network Service Header (NSH), and the NSH includes a Service Function Path Identifier (SPI).
In the embodiment of the disclosure, before the SFF1 sends the first message to the SFC Proxy, the classifier receives the original message, encapsulates the original message with an NSH header with SPI information to obtain the first message, queries by the classifier that SF1 is an SF that does not support SFC, and forwards the first message to the SFF 1; after receiving the first message, the SFF1 queries the SF1 as an SF that does not support SFC, and then sends the first message to the SFC Proxy.
In an exemplary embodiment, the above method further comprises: and decapsulating the first message to obtain a first intermediate message, wherein the first intermediate message does not include NSH.
In an exemplary embodiment, decapsulating the first packet to obtain a first intermediate packet includes: removing the NSH in the first message to obtain a first intermediate message.
In this embodiment of the present disclosure, the first proxy node may decapsulate the first packet, for example, remove NSH in the first packet (i.e., remove NSH encapsulation), to obtain a first intermediate packet.
In step S204, a first SI (Service Index) and a second SI (Service Index) are obtained, where the second SI is a next SI of the first SI, the first SI represents a first SF (Service Function), the second SI represents a second SF, and the first SI is connected to the first proxy node.
In the embodiment of the present disclosure, the first proxy node may acquire one or more SIs, and two of the SIs are taken as an example for illustration, but the present disclosure is not limited thereto.
In this embodiment of the present disclosure, the first proxy node may obtain a first SI and a second SI, where the first SI may be a current SI, the second SI is a next SI of the first SI, the first SI corresponds to the first SF, and the second SI indicates the second SF, that is, a service flow sequence of the SFC network is to forward the packet to the SF1 for processing first, and then forward the packet to the SF2 for processing.
In an exemplary embodiment, acquiring the first service index SI and the second SI includes: and identifying the SPI to obtain a first SI and a second SI.
In the embodiment of the present disclosure, the first proxy node may identify the SPI to obtain the first SI and the second SI.
In the embodiment of the disclosure, by improving the SFC Proxy, in addition to identifying a single SI in the SPI, other SI functions subsequent to identifying the single SI are added.
In step S206, the first packet is forwarded to the first SF, so that the first SF processes the first packet to obtain a second packet.
In this embodiment, the first proxy node may forward the first packet to the first SF according to the first SI, and the first SF may process the first packet to obtain the second packet
In the embodiment of the present disclosure, the first SF is SF1 as an example, with reference to fig. 1, but the present disclosure is not limited thereto.
In this embodiment of the present disclosure, for example, the SFC Proxy recognizes that the first SI is 255, the corresponding SF thereof is SF1, and the SFC Proxy forwards the first packet to SF 1.
In an exemplary embodiment, forwarding the first packet to the first SF so that the first SF processes the first packet to obtain a second packet, includes: and forwarding the first intermediate packet to the first SF, so that the first SF processes the first intermediate packet to obtain a second packet.
In this embodiment, the first proxy node may decapsulate the first packet first, and forward the decapsulated first intermediate packet to the first SF.
In step S208, a second message forwarded by the first SF is received.
In this embodiment of the present disclosure, the first SF may forward the second packet to the first proxy node.
For example, SF1 forwards the second packet to SFC Proxy.
In step S210, if the second SF is connected to the first proxy node, the second SF forwards the second packet to the second SF, so that the second SF processes the second packet.
In this embodiment of the present disclosure, the first proxy node may determine the second SF corresponding to the second SI, and if the second SF is also connected to the first proxy node, the second SF may directly forward the second packet to the second SF without performing encapsulation and decapsulation again on the second packet, so that the second SF processes the second packet.
Referring to fig. 1, taking the second SF as SF3 as an example, if the SFC Proxy finds that SF3 is also connected to the SFC Proxy, it is not necessary to encapsulate and decapsulate the second packet again, and the second packet is directly forwarded to SF3, so that the SF3 processes the second packet.
In this embodiment of the disclosure, after the second SF processes the second packet, the processed second packet is forwarded to the first proxy node, and the first proxy node continues to determine whether a third SF corresponding to a next SI (hereinafter, referred to as a third SI) of the second SI is also connected to the first proxy node, and if the third SF corresponding to the third SI is also connected to the first proxy node, the processed second packet does not need to be encapsulated and decapsulated again, and the processed second packet is directly forwarded to the third SF, so that the third SF processes the processed second packet.
In an exemplary embodiment, the above method further comprises: if the second SF is not connected with the first proxy node, using NSH to package a second message; and forwarding the encapsulated second message to the SFF.
In this embodiment, if the second SF is also connected to the first proxy node, the first proxy node encapsulates the second packet using the NSH, the first proxy node forwards the encapsulated second packet to the SFF, and the SFF may continue to forward the encapsulated second packet backwards.
Referring to fig. 1, taking the example that the second SF is SF4, if the SFC Proxy finds that SF4 is not connected to the SFC Proxy, the SFC Proxy encapsulates the second packet using NSH, the SFC Proxy forwards the encapsulated second packet to SFF1, and the SFF1 forwards the encapsulated second packet to SFF2, so that SFF2 forwards the encapsulated second packet to SF 4.
It should be noted that the first SF of SF1, the second SF of SF3 or SF4 are merely examples, and in practical applications, the first SF and the second SF may be any SFs.
The data processing method according to the embodiment of the present disclosure is described below with the traffic flow SF1 → SF3 → SF4 as an example.
Referring to fig. 1 and table 1, for example, SFC Proxy identifies a first SI of 255, which corresponds to an SF of SF 1; the second SI is 254, which corresponds to SF 3; the third SI is 253, which corresponds to SF 4.
After receiving the first message forwarded by the SFF1, the SFC Proxy decapsulates the first message and forwards the first message to the SF1 for processing, so as to obtain a second message; the SF1 forwards the second packet to the SFC Proxy, the SFC Proxy recognizes that the SF3 is also connected to the SFC Proxy, the SFC Proxy does not need to encapsulate and decapsulate the second packet again, and directly forwards the second packet to the SF3 for processing, so as to obtain a third packet, the SF3 forwards the third packet to the SFC Proxy, the SFC Proxy recognizes that the SF4 is not connected to the SFC Proxy, the SFC Proxy encapsulates the third packet, forwards the encapsulated third packet to the SFF1, and the SFF1 forwards the encapsulated third packet to the SFF2, so that the SFF2 forwards the encapsulated third packet to the SF 4.
Therefore, by using the data processing method provided by the embodiment of the disclosure, when the service flow SF1 → SF3 → SF4 is processed, the SFC Proxy consumes 1 decapsulation resource corresponding to 1 encapsulation, and compared with the related art that the resource corresponding to 2 decapsulations and 2 encapsulations needs to be consumed, the method of the disclosure can save computer resources, reduce computer processing time, and reduce computer processing delay.
In addition, the more SF matched on the SFC Proxy, the more processing time delay is saved, and the linear relation is formed.
In the data processing method provided by the embodiment of the present disclosure, the first processing node may obtain the first SI and the second SI, and if the first processing node finds that the first SI and the second SI are both connected to the first processing node, the first processing node forwards the packet to the first SI for processing, and after receiving the packet returned by the first SI, the first processing node may directly forward the packet returned by the first SI to the second SI for processing without encapsulation and decapsulation, thereby saving computer resources, reducing computer processing time, reducing computer processing delay, and improving computer processing efficiency.
Specifically, in some embodiments, the SFC Proxy improved by the embodiments of the present disclosure, in addition to identifying a single SI in the SPI, adds another SI function subsequent to identifying the single SI, and if it is found that the SF represented by the next SI or the following SFs are still connected to the SFC Proxy, the SFC Proxy does not perform the operation of forwarding the encapsulated NSH header to the SFF after processing the current SI, but directly forwards the encapsulated NSH header to the next hop, so that the number of times of encapsulation and decapsulation between the SFC Proxy and the SFF is reduced from N (where N is the number of SFs matched on the SFC Proxy) to 1, thereby achieving the purposes of reducing processing delay and improving network processing efficiency.
It should also be understood that the above description is intended only to assist those skilled in the art in better understanding the embodiments of the present disclosure, and is not intended to limit the scope of the embodiments of the present disclosure. Various equivalent modifications or changes will be apparent to those skilled in the art in light of the above examples given, for example, some steps in the above methods may not be necessary, or some steps may be newly added, etc. Or a combination of any two or more of the above embodiments. Such modifications, variations, or combinations are also within the scope of the embodiments of the present disclosure.
It should also be understood that the foregoing descriptions of the embodiments of the present disclosure have been provided with an emphasis on differences between the various embodiments, and the same or similar components that are not mentioned may be referenced with each other and will not be repeated here for the sake of brevity.
It should also be understood that the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiment of the present disclosure.
It is also to be understood that the terminology and/or the description of the various embodiments are consistent and mutually exclusive, and that the technical features of the various embodiments may be combined to form a new embodiment according to their inherent logical relationships, unless otherwise specified or logically conflicting, in the various embodiments of the present disclosure.
Examples of data processing methods provided by the present disclosure are described above in detail. It will be appreciated that the computer device, in order to implement the above-described functions, comprises corresponding hardware structures and/or software modules for performing the respective functions. Those of skill in the art will readily appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
The disclosed embodiments provide a data processing system that may include a first proxy node, an SFF, a first SF, and a second SF.
The SFF is used for sending a first message to the first proxy node; the first proxy node is used for receiving the first message and acquiring a first SI and a second SI, wherein the second SI is the next SI of the first SI, the first SI represents a first SF, the second SI represents a second SF, and the first SI is connected to the first proxy node; the first proxy node is further configured to forward the first packet to the first SF; the first SF is used for receiving the first message, processing the first message to obtain a second message and forwarding the second message to the first proxy node; the first proxy node is also used for receiving a second message, and forwarding the second message to the second SF if the second SF is connected to the first proxy node; the second SF is configured to receive and process a second packet.
In an exemplary embodiment, the first proxy node is further configured to encapsulate the second packet using NSH if the second SF is not connected to the first proxy node; and forwarding the encapsulated second message to the SFF.
In an exemplary embodiment, the first packet is encapsulated with a network service header NSH, where the NSH includes a service function path identifier SPI; the first proxy node is further configured to decapsulate the first packet to obtain a first intermediate packet, where the first intermediate packet does not include the NSH; the first proxy node is further configured to forward the first intermediate packet to the first SF, so that the first SF processes the first intermediate packet to obtain a second packet.
In an exemplary embodiment, the first proxy node is further configured to identify the SPI, and obtain the first SI and the second SI.
In an exemplary embodiment, the first proxy node is further configured to remove the NSH in the first packet, and obtain the first intermediate packet.
For details that are not disclosed in the embodiments of the system of the present disclosure, reference may be made to the description of the embodiments of the method described above, and the present disclosure is not repeated here.
The following are embodiments of the disclosed apparatus that may be used to perform embodiments of the disclosed methods. For details not disclosed in the embodiments of the apparatus of the present disclosure, refer to the embodiments of the method of the present disclosure.
FIG. 3 is a block diagram illustrating a data processing apparatus according to an example embodiment.
As shown in fig. 3, the data processing apparatus 300 may include: a first message receiving module 302, an SI obtaining module 304, a first message forwarding module 306, a second message receiving module 308, and a second message forwarding module 310.
The first message receiving module 302 is configured to receive a first message sent by a service function forwarder SFF; the SI acquiring module 304 is configured to acquire a first service index SI and a second SI, where the second SI is a next SI of the first SI, the first SI indicates a first service function SF, the second SI indicates a second SF, and the first SI is connected to the first proxy node; the first packet forwarding module 306 is configured to forward the first packet to the first SF, so that the first SF processes the first packet to obtain a second packet; the second message receiving module 308 is configured to receive a second message forwarded by the first SF; the second packet forwarding module 310 is configured to forward the second packet to the second SF if the second SF is connected to the first proxy node, so that the second SF processes the second packet.
In an exemplary embodiment, the data processing apparatus 300 further includes: an encapsulating module, configured to encapsulate the second packet using the NSH if the second SF is not connected to the first proxy node; and forwarding the encapsulated second message to the SFF.
In an exemplary embodiment, the first packet is encapsulated with a network service header NSH, where the NSH includes a service function path identifier SPI; the data processing apparatus 300 further includes: a decapsulation module, configured to decapsulate the first packet to obtain a first intermediate packet, where the first intermediate packet does not include the NSH; the first packet forwarding module 306 is further configured to forward the first intermediate packet to the first SF, so that the first SF processes the first intermediate packet to obtain a second packet.
In an exemplary embodiment, the SI acquiring module 304 is further configured to identify the SPI, and acquire the first SI and the second SI.
In an exemplary embodiment, the decapsulating module is further configured to remove the NSH in the first packet, and obtain the first intermediate packet.
It is noted that the block diagrams shown in the above figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor terminal devices and/or microcontroller terminal devices.
Fig. 4 is a schematic structural diagram of an electronic device according to an exemplary embodiment. It should be noted that the electronic device shown in fig. 4 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 4, the electronic apparatus 400 includes a Central Processing Unit (CPU)401 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM403, various programs and data necessary for the operation of the system 400 are also stored. The CPU 401, ROM402, and RAM403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
The following components are connected to the I/O interface 405: an input section 406 including a keyboard, a mouse, and the like; an output section 407 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 408 including a hard disk and the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. A driver 410 is also connected to the I/O interface 405 as needed. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 410 as necessary, so that a computer program read out therefrom is mounted into the storage section 408 as necessary.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 409, and/or installed from the removable medium 411. The above-described functions defined in the system of the present disclosure are executed when the computer program is executed by a Central Processing Unit (CPU) 401.
It should be noted that the computer readable media shown in the present disclosure may be computer readable signal media or computer readable storage media or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, terminal device, or apparatus, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, terminal device, or apparatus. In contrast, in the present disclosure, a computer-readable signal medium may include a propagated data signal with computer-readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, terminal device, or apparatus. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present disclosure may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes a transmitting unit, an obtaining unit, a determining unit, and a first processing unit. The names of these units do not in some cases constitute a limitation to the unit itself, and for example, the sending unit may also be described as a "unit sending a picture acquisition request to a connected server".
As another aspect, the present disclosure also provides a computer-readable storage medium, which may be contained in the electronic device described in the above embodiments; or may exist separately without being assembled into the electronic device. The computer-readable storage medium carries one or more programs which, when executed by an electronic device, cause the electronic device to implement the method as described in the embodiments below. For example, the electronic device may implement the steps shown in fig. 2.
According to an aspect of the present disclosure, there is provided a computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions to cause the computer device to perform the method provided in the various alternative implementations of the embodiments described above.
It is to be understood that any number of elements in the drawings of the present disclosure are by way of example and not by way of limitation, and any nomenclature is used for differentiation only and not by way of limitation.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims (10)

1. A method of data processing, the method being performed by a first proxy node, the method comprising:
receiving a first message sent by a Service Function Forwarder (SFF);
acquiring a first Service Index (SI) and a second SI, wherein the second SI is a next SI of the first SI, the first SI represents a first Service Function (SF), the second SI represents a second SF, and the first SI is connected to the first proxy node;
forwarding the first packet to the first SF, so that the first SF processes the first packet to obtain a second packet;
receiving the second message forwarded by the first SF;
and if the second SF is connected to the first proxy node, forwarding the second packet to the second SF, so that the second SF processes the second packet.
2. The method of claim 1, further comprising:
if the second SF is not connected to the first proxy node, using the NSH to package the second message;
and forwarding the encapsulated second message to the SFF.
3. The method according to claim 1 or 2, wherein the first packet is encapsulated with a network service header NSH, and the NSH includes a service function path identifier SPI;
the method further comprises the following steps:
decapsulating the first packet to obtain a first intermediate packet, wherein the first intermediate packet does not include the NSH;
forwarding the first packet to the first SF, so that the first SF processes the first packet to obtain a second packet, including:
and forwarding the first intermediate packet to the first SF, so that the first SF processes the first intermediate packet to obtain a second packet.
4. The method of claim 3, wherein obtaining the first Service Index (SI) and the second SI comprises:
and identifying the SPI to obtain a first SI and a second SI.
5. The method of claim 3, wherein decapsulating the first packet to obtain a first intermediate packet comprises:
and removing the NSH in the first message to obtain the first intermediate message.
6. A data processing system, the system comprising a first proxy node, a SFF, a first SF, and a second SF;
the SFF is used for sending a first message to the first proxy node;
the first proxy node is configured to receive the first packet, and acquire a first SI and a second SI, where the second SI is a next SI of the first SI, the first SI represents the first SF, the second SI represents the second SF, and the first SI is connected to the first proxy node;
the first proxy node is further configured to forward the first packet to the first SF;
the first SF is used for receiving the first message, processing the first message to obtain a second message, and forwarding the second message to the first proxy node;
the first proxy node is further configured to receive the second packet, and forward the second packet to the second SF if the second SF is connected to the first proxy node;
the second SF is configured to receive the second packet and process the second packet.
7. The system according to claim 6, wherein said first proxy node is further configured to encapsulate said second packet using said NSH if said second SF is not connected to said first proxy node; and forwarding the encapsulated second message to the SFF.
8. A data processing apparatus, comprising:
the first message receiving module is used for receiving a first message sent by the service function forwarder SFF;
an SI obtaining module, configured to obtain a first service index SI and a second SI, where the second SI is a next SI of the first SI, the first SI represents a first service function SF, the second SI represents a second SF, and the first SI is connected to the first proxy node;
a first packet forwarding module, configured to forward the first packet to the first SF, so that the first SF processes the first packet to obtain a second packet;
a second message receiving module, configured to receive the second message forwarded by the first SF;
a second packet forwarding module, configured to forward the second packet to the second SF if the second SF is connected to the first proxy node, so that the second SF processes the second packet.
9. An electronic device, comprising:
at least one processor;
storage means for storing at least one program which, when executed by the at least one processor, causes the at least one processor to carry out the method of any one of claims 1 to 5.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1 to 5.
CN202111564692.9A 2021-12-20 2021-12-20 Data processing method, system, device, electronic equipment and storage medium Pending CN114268668A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111564692.9A CN114268668A (en) 2021-12-20 2021-12-20 Data processing method, system, device, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111564692.9A CN114268668A (en) 2021-12-20 2021-12-20 Data processing method, system, device, electronic equipment and storage medium

Publications (1)

Publication Number Publication Date
CN114268668A true CN114268668A (en) 2022-04-01

Family

ID=80828264

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111564692.9A Pending CN114268668A (en) 2021-12-20 2021-12-20 Data processing method, system, device, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN114268668A (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107465634A (en) * 2016-06-06 2017-12-12 中兴通讯股份有限公司 Method for releasing resource, system and device in business function chain
WO2018166325A1 (en) * 2017-03-14 2018-09-20 华为技术有限公司 Method and device for forwarding data packet
US20190173778A1 (en) * 2016-08-26 2019-06-06 Telefonaktiebolaget Lm Ericsson (Publ) Improving sf proxy performance in sdn networks

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107465634A (en) * 2016-06-06 2017-12-12 中兴通讯股份有限公司 Method for releasing resource, system and device in business function chain
WO2017211141A1 (en) * 2016-06-06 2017-12-14 中兴通讯股份有限公司 Resource release method, system, and device, and computer storage medium
US20190173778A1 (en) * 2016-08-26 2019-06-06 Telefonaktiebolaget Lm Ericsson (Publ) Improving sf proxy performance in sdn networks
WO2018166325A1 (en) * 2017-03-14 2018-09-20 华为技术有限公司 Method and device for forwarding data packet

Similar Documents

Publication Publication Date Title
CN111818136B (en) Data processing method, device, electronic equipment and computer readable medium
CN112039796B (en) Data packet transmission method and device, storage medium and electronic equipment
CN110995595B (en) Message sending method, device, storage medium and node equipment
CN111935034B (en) Stream reservation method, system and computer device for time sensitive network
CN110489474B (en) Data processing method, device, medium and electronic equipment
CN114268668A (en) Data processing method, system, device, electronic equipment and storage medium
CN115442177B (en) Data communication method and device of CAN (controller area network)
CN113381938B (en) Data packet sending method and device, storage medium and electronic equipment
CN114518917A (en) Algorithm module scheduling method, algorithm module scheduling device and readable storage medium
CN109587087B (en) Message processing method and system
CN110990490B (en) Method, device, equipment and medium for checking in blockchain network
CN114244765A (en) Storage method and device for service chain, electronic equipment and storage medium
CN114979128A (en) Cross-region communication method and device and electronic equipment
CN114079634A (en) Message forwarding method and device and computer readable storage medium
CN111555983A (en) Heaven and earth-oriented multicast data transmission method and device
CN112653716A (en) Service binding method and device
CN110572423A (en) Data processing method and device
CN113395309B (en) Communication method and computer network
CN110972089A (en) Method, equipment and computer storage medium for signaling transmission
CN115250254B (en) Netflow message distribution processing method and device
CN113890790B (en) Method and device for transmitting service data in industrial network, equipment and storage medium
WO2021174986A1 (en) Data stream processing method and device
CN117811867A (en) Automobile bus message management method, device and equipment and readable storage medium
WO2024082238A1 (en) Communication method and apparatus, and device and storage medium
CN114928581A (en) CAN message forwarding method, device, equipment and storage medium based on AUTOSAR framework

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination