CN116760781A - Message transmission method, device, SFF equipment and storage medium - Google Patents

Message transmission method, device, SFF equipment and storage medium Download PDF

Info

Publication number
CN116760781A
CN116760781A CN202310833171.1A CN202310833171A CN116760781A CN 116760781 A CN116760781 A CN 116760781A CN 202310833171 A CN202310833171 A CN 202310833171A CN 116760781 A CN116760781 A CN 116760781A
Authority
CN
China
Prior art keywords
message
sff
srh
equipment
target
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
CN202310833171.1A
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 Technology Innovation Center
China Telecom Corp Ltd
Original Assignee
China Telecom Technology Innovation Center
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 Technology Innovation Center, China Telecom Corp Ltd filed Critical China Telecom Technology Innovation Center
Priority to CN202310833171.1A priority Critical patent/CN116760781A/en
Publication of CN116760781A publication Critical patent/CN116760781A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/43Assembling or disassembling of packets, e.g. segmentation and reassembly [SAR]
    • H04L47/431Assembling or disassembling of packets, e.g. segmentation and reassembly [SAR] using padding or de-padding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/22Parsing or analysis of headers

Landscapes

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

Abstract

The application relates to a message transmission method, a message transmission device, SFF equipment and a storage medium. The method comprises the following steps: the service function forwarding SFF device receives the target SRv message, performs stripping treatment on the segment route header SRH in the target SRv message, and executes a plurality of message transceiving flows according to the message processing sequence corresponding to the target SRv message after the stripping treatment, so that a plurality of SF devices in communication connection with the SFF device sequentially perform message processing according to the message processing sequence, and performs SRH recovery treatment on a first message received by executing the last message transceiving flow to obtain a second message, and forwards the second message. The messages received and transmitted by the SFF equipment in each message receiving and transmitting flow are messages which do not contain SRH. By adopting the method, message transmission can be performed based on the SFC scene of SRv.

Description

Message transmission method, device, SFF equipment and storage medium
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and apparatus for transmitting a message, an SFF device, and a storage medium.
Background
The Service chain (Service Function Chaining, SFC) can make the traffic flow through a plurality of Service Function (SF) devices according to a specified sequence, so that the message is sequentially processed by the plurality of SF devices to complete the Service processing flow.
Currently, as technology advances, SFC based on SRv has emerged. SRv6 is a technique that combines Segment Routing (SR) with internet protocol version 6 (Internet Protocol Version, ipv 6). Therefore, how to propose a message transmission method based on the SFC scene of SRv is an important research content of the person skilled in the art.
Disclosure of Invention
Based on this, it is necessary to provide a method, a device, an SFF apparatus and a storage medium for transmitting a message based on the SFC scene of SRv in order to solve the above-mentioned technical problems.
In a first aspect, the present application provides a method for transmitting a message. The method comprises the following steps:
the service function forwarding SFF equipment receives a target SRv message, performs stripping treatment on a segment route header SRH in the target SRv message, and executes a plurality of message transceiving flows according to a message processing sequence corresponding to the target SRv message after the stripping treatment, so that a plurality of SF equipment in communication connection with the SFF equipment sequentially perform message processing according to the message processing sequence, wherein the messages received and transmitted by the SFF equipment in each message transceiving flow are messages which do not contain SRH;
and carrying out SRH recovery processing on the first message received by executing the last message receiving and sending process so as to obtain a second message, and forwarding the second message.
In one embodiment, the ith message transceiving flow in the multiple message transceiving flows comprises:
according to the message processing sequence, determining target SF equipment corresponding to an ith message receiving and transmitting flow from a plurality of SF equipment in communication connection with the SFF equipment;
sending the candidate message to target SF equipment;
and receiving a processing message sent by the target SF equipment.
In one embodiment, in the case where i is 1, determining the stripped message as a candidate message;
and under the condition that i is not 1, determining the processing message received by the ith-1 th message transceiving flow as a candidate message.
In one embodiment, performing SRH recovery processing on a first message received by executing a last message transceiving flow to obtain a second message, including:
determining the number of remaining segments corresponding to SRH in the target SRv message;
and performing SRH recovery processing on the first message received by executing the last message transceiving flow according to the number of the residual segments corresponding to the SRH in the target SRv message to obtain a second message.
In one embodiment, forwarding the second message includes:
determining whether the next node of the SFF equipment is a tail node according to the number of the residual segments corresponding to the SRH in the second message;
And if the next node of the SFF equipment is not the tail node, forwarding the second message.
In one embodiment, the method further comprises:
if the next node of the SFF equipment is the tail node, stripping the SRH in the second message to obtain a third message, and forwarding the third message.
In a second aspect, the present application further provides a message transmission device. The device comprises:
the receiving and transmitting module is used for forwarding the SFF equipment to receive the target SRv message, carrying out stripping treatment on the segment route head SRH in the target SRv message, and executing a plurality of message receiving and transmitting processes according to the message processing sequence corresponding to the target SRv6 message after the stripping treatment, so that a plurality of SF equipment in communication connection with the SFF equipment sequentially carry out message processing according to the message processing sequence, wherein the messages received and transmitted by the SFF equipment in each message receiving and transmitting process are messages which do not contain SRH;
and the forwarding module is used for carrying out SRH recovery processing on the first message received by the last message receiving and sending flow so as to obtain a second message and forwarding the second message.
In a third aspect, the present application further provides an SFF device, where the SFF device corresponds to a plurality of service functions SF devices through which a packet needs to pass, and the SFF device includes a transceiver, a processor, and a memory, where the memory stores a computer program;
A transceiver, configured to forward, by the service function, a target SRv message received by the SFF device;
the processor is used for carrying out stripping treatment on the segment routing head SRH in the target SRv message, and after the stripping treatment, carrying out a plurality of message transceiving flows according to the message processing sequence corresponding to the target SRv message, so that a plurality of SF devices in communication connection with the SFF device sequentially carry out message processing according to the message processing sequence, wherein the messages received and transmitted by the SFF device in each message transceiving flow are messages which do not contain SRH; performing SRH recovery processing on the first message received by executing the last message receiving and sending process to obtain a second message;
and the transceiver is also used for forwarding the second message.
In a fourth aspect, the present application also provides a computer-readable storage medium. A computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of any of the methods described above.
In a fifth aspect, the present application also provides a computer program product. Computer program product comprising a computer program which, when executed by a processor, implements the steps of any of the methods described above.
According to the message transmission method, the device, the SFF equipment and the storage medium, the SFF equipment receives the target SRv message, performs stripping treatment on the SRH in the target SRv message, and executes a plurality of message transceiving processes according to the message processing sequence corresponding to the target SRv message after the stripping treatment, so that a plurality of SF equipment in communication connection with the SFF equipment sequentially perform message processing according to the message processing sequence, and performs SRH recovery treatment on the first message received by executing the last message transceiving process to obtain a second message, and forwards the second message. Because the message receiving and transmitting flow is executed after the message stripping process of the target SRv6 carrying the SRH, the SF equipment in communication connection with the SFF equipment can process the message received and transmitted by the SF equipment, thereby realizing the SFC based on SRv. Further, since the messages received by the SFF device in each messaging flow are messages that do not include SRH, and the SRH recovery processing is performed only on the first message received by the SFF device in the last messaging flow, the SFF device only needs to perform one-time encapsulation and one-time decapsulation in the entire messaging flow. In other words, in the case that the SFF device is communicatively connected to a plurality of SF devices, multiple packaging and decapsulation are not required, so that resource consumption and processing delay of the SFF device can be reduced, and processing efficiency of the SFF device is improved.
Drawings
FIG. 1 is an application environment diagram of a message transmission method in an embodiment of the present application;
FIG. 2 is a schematic diagram of a current SFC service chain model;
FIG. 3 is a flow chart of a message transmission method according to an embodiment of the present application;
fig. 4 is a flow chart of a message transceiving flow in an embodiment of the present application;
FIG. 5 is a flow chart of a second message according to an embodiment of the present application;
fig. 6 is a schematic flow chart of forwarding a second message according to an embodiment of the present application;
FIG. 7 is a schematic diagram of an SFC service chain model in an embodiment of the present application;
fig. 8 is a block diagram of a message transmission device according to an embodiment of the present application;
fig. 9 is a schematic structural diagram of an SFF apparatus according to an embodiment of the present application.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
Fig. 1 is an application environment diagram of a message transmission method in an embodiment of the present application. Fig. 1 shows a topology diagram of an SFC comprising a flow classifier (Service Classifier, SC) 101, a traffic function forwarding device (Service function Forwarder, SFF) device 102, an SFF device 103 and a tail node 104.
The SFF device is in communication connection with a corresponding SF device. For example, SFF device 102 is communicatively coupled to SF device 1201, SF device 1202, and SF device 1023, respectively, and SFF device 103 is communicatively coupled to SF device 1301 and SF device 1302, respectively.
Referring to the service chain of fig. 1, a packet corresponding to a service flow may be sent from SC 101 to SFF device 102, and sequentially sent through SF device 1201, SF device 1202 and SF device 1023, and then returned to SFF device 102, and then sent by SFF device 102 to SFF device 103, and sequentially sent through SF device 1301 and SF device 1302, and then returned to SFF device 103, and then sent by SFF device to tail node 104, and sent into the network through the tail node.
It will be appreciated that the SFC includes 2 SFF devices and 5 SF devices, and the traffic flow needs to be illustrated by each SF device, and the embodiment does not limit the number of SFF devices in the SFC, the number of SF devices communicatively connected to the SFF devices, and the specific flow direction of the traffic flow.
The SC 101, the SFF device 102, the SFF device 103, and the tail node 104 may be implemented by separate servers or a server cluster formed by a plurality of servers. The SFF device 102 and the SFF device 103 may also be implemented by proxy.
In SRv technology, SRv6 message carries a segment routing header (Segment Routing Header, SRH). However, most SF devices do not support the SRv6 protocol, that is, SF devices cannot recognize SRH in SRv. Therefore, in the SFC based on SRv6, the SFF device needs to forward SRv the message to the SF device in a manner of stripping SRH by implementing the function of SR proxy (SR proxy), so as to ensure that the SRv message can be normally processed by the SF device service.
FIG. 2 is a schematic diagram of a conventional SFC service chain model. On the basis of fig. 1, please refer to fig. 2, taking a service chain of "SF1 equipment-SF 2 equipment-SF 4 equipment-tail node" as an example, in the prior art, after a message a corresponding to a service flow reaches an SC, the SC adds SRH to the message a to obtain a message B. The SRH includes a route list and a number of Segments Left (SL), among others. In the packet B, the routing list is { B1, SF4, SF2, SF1}, sl=3.
It should be noted that SL is used to indicate the node currently needing to be accessed in the routing list. Taking the above example as an example, when sl=3, it indicates that the address corresponding to SF1 needs to be accessed; when sl=2, it indicates that the address corresponding to SF2 needs to be accessed; when sl=1, it means that the address corresponding to SF4 needs to be accessed, and when sl=0, the address corresponding to B1 needs to be accessed.
Further, the SC may send a message B to the SFF1 device. After the SFF1 device receives the packet B, it can determine that the next node is the SF1 device according to the routing list of the SRH and the SL in the packet B. Because the SF1 device cannot identify the SRH in the message B, the SFF1 device performs the end.ad.sid operation corresponding to the SF1 to strip the SRH in the message B, that is, unpack the SRH, to obtain the message C that does not include the SRH. Then, the SFF1 device sends the message C to the SF1 device, and the SF1 device processes the message C to obtain a message D and returns the message D to the SFF1 device.
Then, after receiving the message D, the SFF1 device recovers the SRH for the message D, i.e. encapsulates the message D with the SRH, modifies the SL in the SRH, and decreases the SL by 1 to obtain the message E. That is, the routing list in the message E is still { B1, SF4, SF2, SF1}, sl=2. In this way, the SFF1 device can determine that the next node is the SF2 device according to the message E.
Further, the SFF1 device performs an end.ad.sid operation corresponding to SF2 to strip SRH in the message E, to obtain a message F that does not include SRH. Then, the SFF1 device sends the message F to the SF2 device, and the SF2 device processes the message F to obtain a message G and returns the message G to the SFF1 device.
Further, after receiving the message G, the SFF1 device recovers the SRH for the message G, modifies the SL in the SRH, and decreases the SL by 1 to obtain the message H. The routing list of the message H is still { B1, SF4, SF2, SF1}, sl=1. Thus, the SFF1 device can determine that the next node is the SF4 device according to the message H. Thus, the SFF1 device sends a message H to the SFF2 device.
After receiving the message H, the SFF2 device determines that the next node is SF4 device according to the message H, and further, the SFF2 device executes the end.ad.sid operation corresponding to SF4 to strip the SRH in the message H, so as to obtain a message I that does not include the SRH. Then, the SFF2 device sends the message I to the SF4 device, and the SF4 device processes the message I to obtain a message J and returns the message J to the SFF2 device.
Then, after receiving the message J, the SFF2 device recovers the SRH for the message J, i.e. encapsulates the message J with the SRH, modifies the SL in the SRH, and subtracts 1 from the SL to obtain the message K. That is, the routing list in the message K is still { B1, SF4, SF2, SF1}, sl=0. In this way, the SFF1 device may determine, according to the message E, that the next node is the tail node corresponding to B1.
Finally, the SFF2 device sends the message K to the tail node, so that the tail node performs corresponding processing after receiving the message K, leaves the SRv network, and reaches the subsequent network.
It can be seen that in the above process, the SFF1 apparatus performs 2 times of decapsulation and 2 times of encapsulation, and the SFF2 apparatus performs 1 time of decapsulation and 1 time of encapsulation in total. That is, if a plurality of SF apparatuses corresponding to one SFF apparatus are to be passed, the SFF apparatus repeatedly performs encapsulation and decapsulation. Therefore, in the current transmission method based on the SFC scene of SRv, the resources of the SFF device are consumed, the processing delay of the SFF device is increased, and the processing efficiency of the SFF device is reduced.
Based on this, it is necessary to provide a message transmission method based on the SFC scene of SRv to reduce the processing delay and processing efficiency in the SFF device. The message transmission method will be described below.
Fig. 3 is a flow chart of a message transmission method according to an embodiment of the present application, which can be applied to the SFF device shown in fig. 1, and in one embodiment, as shown in fig. 3, the method includes the following steps:
s301, service function forwarding SFF equipment receives a target SRv message, performs stripping treatment on a segment route header SRH in the target SRv message, and executes a plurality of message transceiving flows according to a message processing sequence corresponding to the target SRv message after the stripping treatment, so that a plurality of SF equipment in communication connection with the SFF equipment sequentially perform message processing according to the message processing sequence, wherein the messages received and transmitted by the SFF equipment in each message transceiving flow are messages which do not contain SRH.
In this embodiment, the SFF device receives the target SRv message, and the target SRv message may be a message sent by the SC to the SFF device or a message sent by the last SFF device. Taking fig. 1 as an example, the SFF device 102 may receive the target SRv message sent by the SC 101, and the SFF device 103 may receive the target SRv message sent by the SFF device 102.
The target SRv message carries SRH. After receiving the target SRv message, the SFF device strips the SRH in the target SRv message. That is, the SFF device still needs to decapsulate the target SRv message once to obtain a message that does not include SRH.
Further, after the stripping process, the SFF device may execute the multiple message transceiving flows according to the message processing sequence corresponding to the target SRv message.
The message processing sequence corresponding to the target SRv message is the processing sequence of the SF device cached in the SFF device in advance. Optionally, the message processing sequence may include a processing sequence of an SF device connected to the SFF device, and may also include a port processing sequence of the SFF device, where a port of the SFF device is used to locate a different SF device.
The message processing order is illustratively defined by end. The end.mad.sid is determined according to actual requirements, e.g. end.mad.sid in SFF1 equipment is used to indicate the processing order of SF1 equipment followed by SF2 equipment.
In each message transceiving flow, the messages received and transmitted by the SFF equipment are messages which do not contain SRH. That is, when the SFF device obtains the SRH in the target SRv message and performs the stripping process, after obtaining the message that does not include the SRH, the SFF device receives and sends the message that does not include the SRH with the SF device that communicates with the SFF device.
For example, referring to fig. 2, after the SFF1 device receives the target SRv message from the SC, the SRH in the target SRv6 message is stripped to obtain a message a without the SRH, and then the message a may be sent to the SF1 device according to the message processing sequence corresponding to the target SRv6 message, so that the SF1 device processes the message a to obtain a message B, and returns the message B to the SFF1 device. And the SFF1 equipment continues to send the message B to the SF2 equipment according to the message processing sequence corresponding to the target SRv message so as to process the message B by the SF2 equipment to obtain a message C.
S302, performing SRH recovery processing on the first message received by the last message transceiving flow to obtain a second message, and forwarding the second message.
In this embodiment, assuming that the last SF device corresponding to the SFF1 device is determined to be SF2 according to the message processing sequence, continuing the example of S301, the message C may be understood as the first message received by executing the last messaging flow.
Under the condition that the last message transceiving flow is executed, the SFF equipment carries out SRH recovery processing on the first message so as to obtain a second message. That is, the SFF device encapsulates the first message to obtain the second message including the SRH under the condition that the last messaging flow is executed. The SFF device then forwards the second message.
Illustratively, after obtaining the message C, the SFF1 device recovers the SRH for the message C to obtain the message D, and forwards the message D to the SFF2 device.
According to the message transmission method provided by the embodiment, the SFF equipment receives the target SRv message, performs stripping treatment on the SRH in the target SRv message, and executes a plurality of message transceiving flows according to the message processing sequence corresponding to the target SRv message after the stripping treatment, so that a plurality of SF equipment in communication connection with the SFF equipment sequentially perform message processing according to the message processing sequence, and performs SRH recovery treatment on the first message received by executing the last message transceiving flow to obtain a second message, and forwards the second message. Because the message receiving and transmitting flow is executed after the message stripping process of the target SRv6 carrying the SRH, the SF equipment in communication connection with the SFF equipment can process the message received and transmitted by the SF equipment, thereby realizing the SFC based on SRv 6. Further, since the messages received by the SFF device in each messaging flow are messages that do not include SRH, and the SRH recovery processing is performed only on the first message received by the SFF device in the last messaging flow, the SFF device only needs to perform one-time encapsulation and one-time decapsulation in the entire messaging flow. In other words, in the case that the SFF device is communicatively connected to a plurality of SF devices, multiple packaging and decapsulation are not required, so that resource consumption and processing delay of the SFF device can be reduced, and processing efficiency of the SFF device is improved.
Fig. 4 is a flow chart of a messaging flow in an embodiment of the present application, and referring to fig. 4, this embodiment relates to an alternative implementation of the messaging flow. On the basis of the above embodiment, the ith message transceiving flow in the multiple message transceiving flows includes the following steps:
s401, determining target SF equipment corresponding to the ith message transceiving flow from a plurality of SF equipment in communication connection with the SFF equipment according to the message processing sequence.
And S402, sending the candidate message to the target SF equipment.
S403, receiving a processing message sent by the target SF equipment
In this embodiment, the message transceiving flow is performed a plurality of times. That is, if the service flow needs to pass through i SF devices communicatively connected to the SFF device, a total of i message transceiving flows are used, where i is an integer greater than or equal to 2.
Therefore, in the ith message transceiving flow, that is, in each message transceiving flow, the SFF device determines, according to the message processing sequence, a target SF device corresponding to the ith message transceiving flow from a plurality of SF devices communicatively connected to the SFF device.
Continuing with the example of S301, if the message processing sequence indicates that the SFF1 device is in the processing sequence of "SF1-SF2", the SFF1 device will perform the 2-time message transceiving flow, in the 1 st message transceiving flow, the SFF1 device will determine that the target SF device is the SF1 device, and in the 2 nd message transceiving flow, the SFF1 device will determine that the target SF device is the SF2 device.
Further, after the SFF device determines the target SF device corresponding to the ith message transceiving flow, the candidate message is sent to the target SF device.
For example, continuing with the example of S401, in the case where i=1, the target SF device is an SF1 device, the SFF1 device may use, as a candidate message, a message obtained after performing encryption processing on a message a obtained after performing peeling processing on the target SRv message and containing no SRH, to send the candidate message to the SF1 device.
After receiving the message A, the SF1 equipment can decrypt the candidate message to obtain a message 1, process the message 1 according to own service requirements to obtain a message 2, encrypt the message 2 to obtain a message 3, and return the message 3 to the SFF1 equipment. Therefore, the SFF1 device also receives the processing packet sent by the target SF device, that is, the packet 3 sent by the SF1 device, under the condition that i=1.
Similarly, if i is not 1, the target SF device is SF2 device, and the SFF1 device may take the above packet 3 as a candidate packet and send the packet 3 to the SF2 device. Then, the SF2 device may sequentially decrypt, process, encrypt the packet 3 to obtain a packet 4, and return the packet 4 to the SFF1 device. Therefore, in the case where i is not 1, the processing packet is packet 4.
Thus, the SFF1 equipment completes each message transceiving flow. In the ith message transceiving flow, a target SF device corresponding to the ith message transceiving flow is determined from a plurality of SF devices in communication connection with the SFF device according to the message processing sequence, and the candidate message is sent to the target SF device so as to receive the processing message sent by the target SF device. Therefore, after the stripping process, the SFF device may execute the multiple message transceiving flows according to the message processing sequence corresponding to the target SRv message.
In one embodiment, optionally, in the case that i is 1, determining the stripped message as a candidate message; and under the condition that i is not 1, determining the processing message received by the ith-1 th message transceiving flow as a candidate message.
In this embodiment, in the case where i=1, continuing with the example of S401, the SFF1 device may determine the packet a after the stripping process as a candidate packet, and send the packet a to the SF1 device.
After receiving the message a, the SF1 can process the message a to obtain a message B, and return the message B to the SFF1 device. Thus, the SFF1 device completes the 1 st message transceiving flow, and in the 1 st message transceiving flow, the message a is a candidate message, and the message B is a processing message.
In the case where i is not 1, for example, i=2, after receiving the packet B, the SFF1 device determines the packet B as a candidate packet, that is, determines the processing packet received in the 1 st packet transceiving flow as a candidate packet, and sends the packet B to the SF2S device.
After receiving the message B, the SF2 can process the message B to obtain a message C, and return the message C to the SFF1 device. Thus, the SFF1 equipment completes the 2 nd message transceiving flow. In the 2 nd message transceiving flow, the message B is a candidate message, and the message C is a processing message.
In this embodiment, in the case where i is 1, the stripped message is determined as a candidate message; and under the condition that i is not 1, determining the processing message received by the i-1 th message transceiving flow as a candidate message, so that the message which is received and transmitted by the SFF equipment in each message transceiving flow can be a message which does not contain SRH.
Fig. 5 is a schematic flow chart of obtaining the second message in the embodiment of the present application, and referring to fig. 5, this embodiment relates to an alternative implementation manner of obtaining the second message. On the basis of the above embodiment, the step of performing SRH recovery processing on the first packet received by the last packet receiving and sending flow to obtain the second packet in S302 includes the following steps:
S501, determining the number of remaining segments corresponding to SRH in the target SRv message.
In this embodiment, the SRH in the target SRv message includes a routing list and a remaining number of segments SL. Please refer to fig. 1 and fig. 2, continuing to take the service chain of "SF1 device-SF 2 device-SF 4 device-tail node" as an example. The target SRv6 message received by the SFF device 1 carries the routing list { B1, SF4, SF12}, sl=2, in SRH.
Thus, after receiving the target SRv message, the SFF1 device can determine the remaining number of segments sl=2 corresponding to the SRH in the target SRv message.
S502, performing SRH recovery processing on the first message received by executing the last message transceiving flow according to the number of the residual segments corresponding to the SRH in the target SRv message, so as to obtain a second message.
In this embodiment, the SFF device may perform SRH recovery processing on the first message received by the last message transceiving flow according to the number of remaining segments corresponding to SRH in the target SRv message, so as to obtain the second message.
Continuing with the example of S501 above, the "SF12" in the routing list { B1, SF4, SF12} corresponds to the message processing order. For example, the "end.mad.sid=sf12" is cached in the SFF1 device, so after the SFF1 device receives the target SRv packet, the SFF1 device may execute the end.mad.sid operation corresponding to the SF12 according to the routing list and the SL of the SRH in the target SRv packet, so as to perform the stripping process on the SRH in the target SRv6 packet, and execute the multiple messaging flows according to the message processing sequence corresponding to the target SRv packet after the stripping process.
That is, after the SFF1 device performs the stripping process on the target SRv message to obtain the message a, the SFF1 device sends the message a to the SF1 according to the message processing sequence, and after the SF1 device processes the return message B on the message a, sends the message B to the SF2 device according to the message processing sequence, so as to obtain the message C returned to the SFF1 device after the SF2 device processes the message B.
In the above process, the message C is the first message received by the SFF1 device in the last message transceiving process, and further, the SFF1 device performs SRH recovery processing on the message C according to the number of remaining segments 2 corresponding to the SRH in the target SRv message, so as to obtain the message D, which is the second message. It can be understood that the SRH recovery process is performed on the packet C, that is, the SRH is encapsulated in the packet C.
For example, after performing the stripping process on the SRH in the target SRv message, the SFF1 device may buffer the SRH in the target SRv6 message, and encapsulate the first message and the SRH in the buffered target SRv6 message after receiving the message C received by performing the last messaging procedure, that is, perform the SRH recovery process on the message C to obtain the second message. Meanwhile, the SFF device updates the number of remaining segments in the SRH in the second message after recovery according to the number of remaining segments corresponding to the SRH in the target SRv message.
Optionally, the SFF1 device may subtract 1 from the number of remaining segments corresponding to the SRH in the target SRv message to obtain the number of remaining segments in the SRH in the second message.
In this embodiment, the number of remaining segments corresponding to SRH in the target SRv message is first determined, and then SRH recovery processing is performed on the first message received by the last message transceiving flow according to the number of remaining segments corresponding to SRH in the target SRv message, so as to obtain a second message, so that forwarding can be performed according to the second message, that is, the message transmission method based on the SFC scene of SRv6 is implemented.
Fig. 6 is a schematic flow chart of forwarding a second message in an embodiment of the present application, and referring to fig. 6, this embodiment relates to an alternative implementation manner of forwarding the second message. Based on the above embodiment, the "forward second message" in S302 includes the following steps:
s601, determining whether the next node of the SFF equipment is a tail node according to the number of the residual segments corresponding to the SRH in the second message.
In this embodiment, optionally, the SFF device may determine whether the next node of the SFF device is a tail node according to whether the number of remaining segments corresponding to the SRH in the second packet is equal to a preset value.
For example, the preset value may be equal to 0, and if the SFF device determines that the number of remaining segments corresponding to the SRH in the second packet is equal to 0, the SFF device determines that the next node is about to reach the tail node. If the SFF device determines that the number of the remaining segments corresponding to the SRH in the second message is not equal to 0, the SFF device determines that the next node is not the tail node.
S602, if the next node of the SFF equipment is not the tail node, forwarding the second message.
In this embodiment, if the next node of the SFF device is not a tail node, the SFF device continues to forward the second message. Optionally, the SFF device determines a next node of the SFF device according to the routing address and the SL in the second message, and forwards the second message to the next node of the SFF device.
Continuing with the example of S502 above, when the SFF1 device encapsulates SRH for message C to obtain message D, SFF1 also modifies the value of SL in message D to be equal to 1. That is, the routing list in the message D is still { B1, SF4, SF12}, sl=1.
Further, after obtaining the message D, the SFF1 device may determine that the next node of the SFF1 device is not a tail node according to SL in the message D, and thus, the SFF1 device may determine that the next node is SF4 according to { B1, SF4, SF12} and sl=1. Therefore, the SFF1 device directly forwards the packet D to the SFF2 device corresponding to SF4 in the packet D.
In an embodiment, optionally, the method for transmitting a message further includes the following steps:
if the next node of the SFF equipment is the tail node, stripping the SRH in the second message to obtain a third message, and forwarding the third message.
In this embodiment, if the SFF1 device obtains the message D, after the sl=0 in the message D, the SFF1 device determines that the next node of the SFF1 device is the tail node, so that the SFF1 device performs the stripping process on the message D to obtain a third message that does not include the SRH, and sends the third message to the next node, that is, the tail node.
Because the next node of the SFF equipment is the tail node, stripping the SRH in the second message to obtain a third message, and forwarding the third message, the processing efficiency of the tail node can be improved.
In order to more clearly describe the message transmission method in the present application, it is described with reference to fig. 7. Fig. 7 is a schematic diagram of an SFC service chain model in an embodiment of the present application.
As shown in fig. 7, the service chain of "SF1 equipment-SF 2 equipment-SF 4 equipment-tail node" is taken as an example. After the message A corresponding to the service flow reaches the SC, the SC adds SRH into the message A to obtain a message B. In the packet B, the routing list is { B1, SF4, SF12}, sl=2.
Wherein SF12 corresponds to a message processing order defined in the SFF1 device. "M", i.e. a large number (Multiple) of "End. MAD. SID". In other words, "end.mad.sid=sf12" is stored in the SFF1 device, and is used to indicate the processing sequence of the SF1 device and then the SF2 device, that is, to process SF1 and SF2 connected to the SFF1 device in a one-time decapsulation manner.
The SC will send a message B to the SFF1 device, that is, a target SRv message received by the SFF1 device. Further, the SFF1 device determines, according to the routing list and SL of the SRH in the target SRv message, that the end.mad.sid operation corresponding to the SF12 needs to be executed currently, so as to perform the stripping process on the SRH in the target SRv6 message, and after the stripping process, execute the multiple message transceiving flows according to the message processing sequence corresponding to the target SRv6 message.
That is, the SFF1 device strips the SRH in the message B to obtain the message C that does not include the SRH. And then, the SFF1 equipment enters a 1 st message transceiving flow, in the 1 st message transceiving flow, the SFF1 equipment determines that the target SF equipment corresponding to the 1 st message transceiving flow is SF1 equipment according to the message processing sequence, then sends a message C to the SF1 equipment, processes the message C to obtain a message D, and returns the message D to the SFF1 equipment.
Then, the SFF1 device enters a 2 nd message transceiving flow, in the 2 nd message transceiving flow, the SFF2 device determines that the target SF device corresponding to the 2 nd message transceiving flow is the SF2 device according to the message processing sequence, then sends the message D to the SF2 device, and the SF2 device processes the message D to obtain a message E and returns the message E to the SFF1 device.
Because the 2 nd message transceiving flow is also the last message transceiving flow, the SFF1 device will perform SRH recovery processing on the received message E, and reduce the SL of the SRH in the message A by 1 to obtain the message F. In SRH of the packet F, the routing list is { B1, SF4, SF12}, sl=1.
And the SFF1 sends the message F to SFF2 equipment according to the routing list and the SL value in the message F, the SFF2 equipment determines that the next node is SF4 equipment, and the SFF2 equipment executes the END.AD.SID operation corresponding to SF4 to strip the SRH in the message F so as to obtain the message G which does not contain the SRH. Then, the SFF1 device sends the message G to the SF4 device, and the SF4 device processes the message G to obtain a message H and returns the message H to the SFF2 device.
Then, after receiving the message H, the SFF2 device recovers the SRH for the message H, modifies the SL in the SRH, and decreases the SL by 1 to obtain the message I. That is, the routing list in the message I is still { B1, SF4, SF2, SF1}, sl=0. Thus, the SFF2 device can determine that the next node is the tail node according to the packet I.
Finally, the SFF2 device sends the packet I to the tail node, so that the tail node performs corresponding processing after receiving the packet I, leaves the network SRv, and reaches the subsequent network.
Therefore, in the transmission method provided in this embodiment, in the case that the service flow needs to pass through N SF devices corresponding to the SFF device (N is an integer greater than or equal to 2), the process that the SFF device needs to be encapsulated N times and decapsulated N times originally is reduced, and only 1 time of encapsulation and 1 time of decapsulation are required, so as to reduce the processing delay and improve the network processing efficiency. In other words, when N is larger, the delay saved by the transmission method provided by the embodiment is larger, and the transmission method is in a linear relationship.
It should be understood that, although the steps in the flowcharts related to the embodiments described above are sequentially shown as indicated by arrows, these steps are not necessarily sequentially performed in the order indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in the flowcharts described in the above embodiments may include a plurality of steps or a plurality of stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the steps or stages is not necessarily performed sequentially, but may be performed alternately or alternately with at least some of the other steps or stages.
Based on the same inventive concept, the embodiment of the application also provides a message transmission device for realizing the above related message transmission method. The implementation of the solution provided by the device is similar to the implementation described in the above method, so the specific limitation of one or more embodiments of the message transmission device provided below may refer to the limitation of the message transmission method hereinabove, and will not be repeated herein.
Fig. 8 is a block diagram of a message transmission device according to an embodiment of the present application, as shown in fig. 8, in an embodiment of the present application, there is provided a message transmission device 8000, including: a transceiver module 801 and a forwarding module 802, wherein:
and the transceiver module 801 is configured to receive a target SRv message by an SFF device for forwarding a service function, perform stripping processing on a segment routing header SRH in the target SRv message, and execute a plurality of message transceiving processes according to a message processing sequence corresponding to the target SRv message after the stripping processing, so that a plurality of SF devices communicatively connected to the SFF device sequentially perform message processing according to the message processing sequence, where the messages received and sent by the SFF device in each message transceiving process are all messages that do not include the SRH.
And the forwarding module 802 is configured to perform SRH recovery processing on the first message received by the last message transceiving flow to obtain a second message, and forward the second message.
According to the message transmission device provided by the embodiment, the SFF equipment receives the target SRv message, performs stripping treatment on the SRH in the target SRv message, and executes a plurality of message transceiving flows according to the message processing sequence corresponding to the target SRv message after the stripping treatment, so that a plurality of SF equipment in communication connection with the SFF equipment sequentially perform message processing according to the message processing sequence, and performs SRH recovery treatment on the first message received by executing the last message transceiving flow to obtain a second message, and forwards the second message. Because the message receiving and transmitting flow is executed after the message stripping process of the target SRv6 carrying the SRH, the SF equipment in communication connection with the SFF equipment can process the message received and transmitted by the SF equipment, thereby realizing the SFC based on SRv 6. Further, since the messages received by the SFF device in each messaging flow are messages that do not include SRH, and the SRH recovery processing is performed only on the first message received by the SFF device in the last messaging flow, the SFF device only needs to perform one-time encapsulation and one-time decapsulation in the entire messaging flow. In other words, in the case that the SFF device is communicatively connected to a plurality of SF devices, multiple packaging and decapsulation are not required, so that resource consumption and processing delay of the SFF device can be reduced, and processing efficiency of the SFF device is improved.
Optionally, the transceiver module 801 includes:
the first determining unit is used for determining a target SF device corresponding to the ith message transceiving flow from a plurality of SF devices in communication connection with the SFF device according to the message processing sequence.
And the first sending unit is used for sending the candidate message to the target SF equipment.
The first receiving unit is used for receiving the processing message sent by the target SF equipment.
Optionally, in the case that i is 1, determining the stripped message as a candidate message; and under the condition that i is not 1, determining the processing message received by the ith-1 th message transceiving flow as a candidate message.
Optionally, the forwarding module 802 includes:
and the second determining unit is used for determining the number of the residual segments corresponding to the SRH in the target SRv message.
And the recovery reaction is used for carrying out SRH recovery processing on the first message received by executing the last message transceiving flow according to the number of the residual segments corresponding to the SRH in the target SRv message so as to obtain a second message.
Optionally, the forwarding module 802 further includes:
and a third determining unit, configured to determine whether the next node of the SFF device is a tail node according to the number of remaining segments corresponding to the SRH in the second packet.
And the first forwarding unit is used for forwarding the second message if the next node of the SFF equipment is not a tail node.
Optionally, the message transmission device 8000 further includes:
and the second forwarding unit is used for stripping the SRH in the second message to obtain a third message if the next node of the SFF equipment is a tail node, and forwarding the third message.
The modules in the message transmission device can be implemented in whole or in part by software, hardware and a combination thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
Fig. 9 is a schematic structural diagram of an SFF device according to an embodiment of the present application, and as shown in fig. 9, the SFF device 900 includes at least one transceiver 901, a processor 902, a memory 903, and at least one bus system 904.
Bus system 904 is used to implement the communication connections between the elements. The memory 903 may comprise high speed RAM memory or may further comprise non-volatile storage NVM, such as at least one magnetic disk memory. The memory stores a computer program. The transceiver 901 may be coupled to a processor 902 that may perform actions of receiving or transmitting under the direction or control of the processor 902.
It is to be appreciated that the memory 903 can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. The non-volatile memory may be a Read-only memory (ROM), a programmable Read-only memory (ProgrammableROM, PROM), an erasable programmable Read-only memory (ErasablePROM, EPROM), an electrically erasable programmable Read-only memory (ElectricallyEPROM, EEPROM), or a flash memory, among others. The volatile memory may be a random access memory (RandomAccessMemory, RAM) that acts as an external cache. By way of example, and not limitation, many forms of RAM are available, such as Static RAM (SRAM), dynamic random access memory (DynamicRAM, DRAM), synchronous dynamic random access memory (SynchronousDRAM, SDRAM), double data rate synchronous dynamic random access memory (ddr SDRAM), enhanced Synchronous Dynamic Random Access Memory (ESDRAM), synchronous link dynamic random access memory (SynchlinkDRAM, SLDRAM), and direct memory bus random access memory (DirectRambusRAM, DRRAM). The memory 903 of the systems and methods described by embodiments of the present invention is intended to comprise, without being limited to, these and any other suitable types of memory.
In the embodiment of the present invention, the transceiver 901 is enabled to be used for receiving the target SRv message by the service function forwarding SFF device by calling a program or an instruction stored in the memory 903.
The processor 902 executes a computer program, and is configured to perform stripping processing on the segment routing header SRH in the target SRv message, and execute a plurality of message transceiving flows according to a message processing sequence corresponding to the target SRv message after the stripping processing, so that a plurality of SF devices communicatively connected to the SFF device sequentially perform message processing according to the message processing sequence, where the messages received and transmitted by the SFF device in each message transceiving flow are messages that do not include SRH; and performing SRH recovery processing on the first message received by executing the last message transceiving flow to obtain a second message.
The transceiver 901 is further configured to forward the second packet.
Likewise, some or all of the methods disclosed above may also be implemented in the processor 902, either by the processor 902 or by the processor 902 in conjunction with other elements (e.g., transceivers). The processor 902 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the methods described above may be performed by integrated logic circuitry in hardware or instructions in software in the processor 902. The processor 902 may be a general purpose processor, a digital signal processor (DigitalSignalProcessor, DSP), an application specific integrated circuit (application specific IntegratedCircuit, ASIC), an off-the-shelf programmable gate array (FieldProgrammableGateArray, FPGA) or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component. The disclosed methods, steps, and logic blocks in the embodiments of the present invention may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present invention may be embodied directly in the execution of a hardware decoding processor, or in the execution of a combination of hardware and software modules in a decoding processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in the memory 903, and the processor 902 reads the information in the memory 903, and in combination with the hardware, performs the steps of the method described above.
It is to be understood that the embodiments of the application described herein may be implemented in hardware, software, firmware, middleware, microcode, or a combination thereof. For a hardware implementation, the processing units may be implemented within one or more application specific integrated circuits (ApplicationSpecificIntegratedCircuits, ASIC), digital signal processors (DigitalSignalProcessing, DSP), digital signal processing devices (dspev), programmable logic devices (ProgrammableLogicDevice, PLD), field programmable gate arrays (Field-ProgrammableGateArray, FPGA), general purpose processors, controllers, microcontrollers, microprocessors, other electronic units for performing the functions of the application, or a combination thereof.
For a software implementation, the techniques described in embodiments of the present application may be implemented by modules (e.g., procedures, functions, and so on) that perform the functions described in embodiments of the present application. The software codes may be stored in memory and executed by the processor 902. The memory may be implemented within the processor 902 or external to the processor 902.
In one embodiment, the ith message transceiving flow in the multiple message transceiving flows comprises:
according to the message processing sequence, determining target SF equipment corresponding to an ith message receiving and transmitting flow from a plurality of SF equipment in communication connection with the SFF equipment; sending the candidate message to target SF equipment; and receiving a processing message sent by the target SF equipment.
In one embodiment, in the case where i is 1, determining the stripped message as a candidate message; and under the condition that i is not 1, determining the processing message received by the ith-1 th message transceiving flow as a candidate message.
In one embodiment, the processor 902 is further configured to determine a remaining number of segments corresponding to SRH in the target SRv message; and performing SRH recovery processing on the first message received by executing the last message transceiving flow according to the number of the residual segments corresponding to the SRH in the target SRv message to obtain a second message.
In one embodiment, the processor 902 is further configured to determine whether the next node of the SFF device is a tail node according to the number of remaining segments corresponding to the SRH in the second message.
The transceiver 901 is further configured to forward the second message if the next node of the SFF device is not a tail node.
In an embodiment, the processor 902 is further configured to strip the SRH in the second packet to obtain a third packet if the next node of the SFF device is a tail node; the transceiver 901 is further configured to forward the third message.
It will be appreciated by persons skilled in the art that the architecture shown in fig. 9 is merely a block diagram of some of the architecture relevant to the present inventive arrangements and is not limiting as to the computer device to which the present inventive arrangements are applicable, and that a particular computer device may include more or fewer components than shown, or may combine some of the components, or have a different arrangement of components.
In one embodiment, a computer readable storage medium is provided having a computer program stored thereon, which when executed by a processor, performs the steps of:
the service function forwarding SFF equipment receives a target SRv message, performs stripping treatment on a segment routing header SRH in the target SRv message, and executes a plurality of message transceiving flows according to a message processing sequence corresponding to the target SRv6 message after the stripping treatment, so that a plurality of SF equipment in communication connection with the SFF equipment sequentially perform message processing according to the message processing sequence, wherein the message transmitted and received by the SFF equipment in each message transceiving flow is a message which does not contain the SRH;
and carrying out SRH recovery processing on the first message received by executing the last message receiving and sending process to obtain a second message, and forwarding the second message.
In one embodiment, the computer program when executed by the processor further performs the steps of:
determining target SF equipment corresponding to the ith message transceiving flow from a plurality of SF equipment in communication connection with the SFF equipment according to the message processing sequence; sending the candidate message to the target SF equipment; and receiving a processing message sent by the target SF equipment.
In one embodiment, the computer program when executed by the processor further performs the steps of:
under the condition that i is 1, determining the message after stripping treatment as the candidate message; and under the condition that i is not 1, determining the processing message received by the i-1 th message transceiving flow as the candidate message.
In one embodiment, the computer program when executed by the processor further performs the steps of:
determining the number of remaining segments corresponding to SRH in the target SRv message; and performing SRH recovery processing on the first message received by executing the last message transceiving flow according to the number of the residual segments corresponding to the SRH in the target SRv message, so as to obtain a second message.
In one embodiment, the computer program when executed by the processor further performs the steps of:
determining whether the next node of the SFF equipment is a tail node according to the number of the residual segments corresponding to the SRH in the second message; and if the next node of the SFF equipment is not a tail node, forwarding the second message.
In one embodiment, the computer program when executed by the processor further performs the steps of:
and if the next node of the SFF equipment is a tail node, stripping the SRH in the second message to obtain a third message, and forwarding the third message.
In one embodiment, a computer program product is provided comprising a computer program which, when executed by a processor, performs the steps of:
the service function forwarding SFF equipment receives a target SRv message, performs stripping treatment on a segment routing header SRH in the target SRv message, and executes a plurality of message transceiving flows according to a message processing sequence corresponding to the target SRv6 message after the stripping treatment, so that a plurality of SF equipment in communication connection with the SFF equipment sequentially perform message processing according to the message processing sequence, wherein the message transmitted and received by the SFF equipment in each message transceiving flow is a message which does not contain the SRH;
and carrying out SRH recovery processing on the first message received by executing the last message receiving and sending process to obtain a second message, and forwarding the second message.
In one embodiment, the computer program when executed by the processor further performs the steps of:
determining target SF equipment corresponding to the ith message transceiving flow from a plurality of SF equipment in communication connection with the SFF equipment according to the message processing sequence; sending the candidate message to the target SF equipment; and receiving a processing message sent by the target SF equipment.
In one embodiment, the computer program when executed by the processor further performs the steps of:
under the condition that i is 1, determining the message after stripping treatment as the candidate message; and under the condition that i is not 1, determining the processing message received by the i-1 th message transceiving flow as the candidate message.
In one embodiment, the computer program when executed by the processor further performs the steps of:
determining the number of remaining segments corresponding to SRH in the target SRv message; and performing SRH recovery processing on the first message received by executing the last message transceiving flow according to the number of the residual segments corresponding to the SRH in the target SRv message, so as to obtain a second message.
In one embodiment, the computer program when executed by the processor further performs the steps of:
determining whether the next node of the SFF equipment is a tail node according to the number of the residual segments corresponding to the SRH in the second message; and if the next node of the SFF equipment is not a tail node, forwarding the second message.
In one embodiment, the computer program when executed by the processor further performs the steps of:
and if the next node of the SFF equipment is a tail node, stripping the SRH in the second message to obtain a third message, and forwarding the third message.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, database, or other medium used in embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high density embedded nonvolatile Memory, resistive random access Memory (ReRAM), magnetic random access Memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric Memory (Ferroelectric Random Access Memory, FRAM), phase change Memory (Phase Change Memory, PCM), graphene Memory, and the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, and the like. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like. The databases referred to in the embodiments provided herein may include at least one of a relational database and a non-relational database. The non-relational database may include, but is not limited to, a blockchain-based distributed database, and the like. The processor referred to in the embodiments provided in the present application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic unit, a data processing logic unit based on quantum computing, or the like, but is not limited thereto.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The foregoing examples illustrate only a few embodiments of the application and are described in detail herein without thereby limiting the scope of the application. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the application, which are all within the scope of the application. Accordingly, the scope of the application should be assessed as that of the appended claims.

Claims (10)

1. A method for transmitting a message, the method comprising:
the service function forwarding SFF equipment receives a target SRv message, performs stripping treatment on a segment routing header SRH in the target SRv message, and executes a plurality of message transceiving flows according to a message processing sequence corresponding to the target SRv6 message after the stripping treatment, so that a plurality of SF equipment in communication connection with the SFF equipment sequentially perform message processing according to the message processing sequence, wherein the message transmitted and received by the SFF equipment in each message transceiving flow is a message which does not contain the SRH;
And carrying out SRH recovery processing on the first message received by executing the last message receiving and sending process to obtain a second message, and forwarding the second message.
2. The method of claim 1, wherein an ith messaging flow of the multiple messaging flows comprises:
determining target SF equipment corresponding to the ith message transceiving flow from a plurality of SF equipment in communication connection with the SFF equipment according to the message processing sequence;
sending the candidate message to the target SF equipment;
and receiving a processing message sent by the target SF equipment.
3. The method according to claim 2, wherein in case i is 1, determining the stripped message as the candidate message;
and under the condition that i is not 1, determining the processing message received by the i-1 th message transceiving flow as the candidate message.
4. A method according to any one of claims 1 to 3, wherein performing SRH recovery processing on the first message received by performing the last messaging procedure to obtain the second message includes:
determining the number of remaining segments corresponding to SRH in the target SRv message;
And performing SRH recovery processing on the first message received by executing the last message transceiving flow according to the number of the residual segments corresponding to the SRH in the target SRv message, so as to obtain a second message.
5. The method of claim 4, wherein forwarding the second message comprises:
determining whether a next node of the SFF equipment is a tail node according to the number of the remaining segments corresponding to the SRH in the second message;
and if the next node of the SFF equipment is not a tail node, forwarding the second message.
6. The method of claim 5, wherein the method further comprises:
and if the next node of the SFF equipment is a tail node, stripping the SRH in the second message to obtain a third message, and forwarding the third message.
7. A message transmission apparatus, the apparatus comprising:
the receiving and transmitting module is used for receiving a target SRv message by the service function forwarding SFF equipment, carrying out stripping treatment on a segmented routing header SRH in the target SRv message, and executing a plurality of message receiving and transmitting processes according to a message processing sequence corresponding to the target SRv message after the stripping treatment, so that a plurality of SF equipment in communication connection with the SFF equipment sequentially carry out message processing according to the message processing sequence, wherein the messages received and transmitted by the SFF equipment in each message receiving and transmitting process are messages which do not contain the SRH;
And the forwarding module is used for carrying out SRH recovery processing on the first message received by the last message receiving and sending flow so as to obtain a second message and forwarding the second message.
8. An SFF device, comprising a transceiver, a processor, and a memory, the memory storing a computer program;
the transceiver is used for forwarding the SFF equipment receiving target SRv message by the service function;
the processor is configured to perform stripping processing on the segment routing header SRH in the target SRv packet, and perform multiple packet transceiving flows according to a packet processing sequence corresponding to the target SRv packet after the stripping processing, so that multiple SF devices communicatively connected to the SFF device perform packet processing sequentially according to the packet processing sequence, where the packets received and sent by the SFF device in each packet transceiving flow are packets that do not include the SRH; performing SRH recovery processing on the first message received by executing the last message receiving and sending process to obtain a second message;
the transceiver is further configured to forward the second packet.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 6.
10. A computer program product comprising a computer program, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 6.
CN202310833171.1A 2023-07-07 2023-07-07 Message transmission method, device, SFF equipment and storage medium Pending CN116760781A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310833171.1A CN116760781A (en) 2023-07-07 2023-07-07 Message transmission method, device, SFF equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310833171.1A CN116760781A (en) 2023-07-07 2023-07-07 Message transmission method, device, SFF equipment and storage medium

Publications (1)

Publication Number Publication Date
CN116760781A true CN116760781A (en) 2023-09-15

Family

ID=87960925

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310833171.1A Pending CN116760781A (en) 2023-07-07 2023-07-07 Message transmission method, device, SFF equipment and storage medium

Country Status (1)

Country Link
CN (1) CN116760781A (en)

Similar Documents

Publication Publication Date Title
US9998406B2 (en) Method and apparatus for performing finite memory network coding in an arbitrary network
US20150088995A1 (en) Method and apparatus for sharing contents using information of group change in content oriented network environment
EP2880550B1 (en) Connection mesh in mirroring asymmetric clustered multiprocessor systems
EP1471699B1 (en) Frame processing
EP4131870A1 (en) Service processing method and apparatus, and device and storage medium
CN113891396B (en) Data packet processing method and device, computer equipment and storage medium
CN111026324A (en) Updating method and device of forwarding table entry
CN113301007A (en) Data transmission method, computing device and storage medium
CN113783789B (en) Message speed limiting method and device
EP3598720A1 (en) Method and device for generating forwarding information
US20230367735A1 (en) Data transmission method, module and apparatus, device, and storage medium
CN107483369B (en) Message processing method and virtual switch
EP2201740B1 (en) High speed packet processing in a wireless network
CN107086960B (en) Message transmission method and device
CN116760781A (en) Message transmission method, device, SFF equipment and storage medium
US9471402B1 (en) Systems and methods for facilitating dependency-ordered delivery of data sets to applications within distributed systems
CN111147385A (en) Method and system for forwarding data plane of software defined data center network
CN114374641B (en) Three-layer message forwarding method and device
WO2015154393A1 (en) Method and apparatus for processing service node ability, service classifier and service controller
WO2022134674A1 (en) Message transmission method and apparatus, and device, storage medium and system
CN111061682B (en) Data caching method, reading method, electronic equipment and storage medium
CN114897532A (en) Operation log processing method, system, device, equipment and storage medium
JP7294577B2 (en) Methods, devices and computer programs for managing remote devices by managed devices
CN114584575A (en) Ship-shore communication method and system in ship management system
CN110808909B (en) Message processing method and device across virtual systems

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