CN114205267A - Method, system and service function for tracking link information - Google Patents

Method, system and service function for tracking link information Download PDF

Info

Publication number
CN114205267A
CN114205267A CN202111532677.6A CN202111532677A CN114205267A CN 114205267 A CN114205267 A CN 114205267A CN 202111532677 A CN202111532677 A CN 202111532677A CN 114205267 A CN114205267 A CN 114205267A
Authority
CN
China
Prior art keywords
service
service message
processing time
time information
timestamp
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
CN202111532677.6A
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 CN202111532677.6A priority Critical patent/CN114205267A/en
Publication of CN114205267A publication Critical patent/CN114205267A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
    • H04L43/106—Active monitoring, e.g. heartbeat, ping or trace-route using time related information in packets, e.g. by adding timestamps
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0852—Delays
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/22—Parsing or analysis of headers

Abstract

The disclosure relates to a method, a system and a service function for tracking link information, and relates to the technical field of communication. The method of the present disclosure comprises: a Service Function (SF) in a service chain determines the processing time information of a service message in the SF; the SF adds the processing time information of the service message in the SF to a network service head NSH of the service message; and under the condition that the SF does not belong to the last SF in the service chain, the SF sends the service message to the next SF in the service chain so as to send the service message to the tracking server.

Description

Method, system and service function for tracking link information
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a method, a system, and a service function for tracking link information.
Background
The Service Function Chain (SFC) includes a plurality of nodes, that is, SFs (Service Function), and the Service Chain technology can implement network traffic in a predetermined sequence required by Service logic.
Disclosure of Invention
The inventor finds that: because there are many SFs, when an SF processing capability is reduced or a fault occurs, it is difficult to quickly locate and maintain the SF.
One technical problem to be solved by the present disclosure is: how to more efficiently maintain the SF.
According to some embodiments of the present disclosure, a method for tracking link information is provided, including: a Service Function (SF) in a service chain determines the processing time information of a service message in the SF; the SF adds the processing time information of the service message in the SF to a network service head NSH of the service message; and under the condition that the SF does not belong to the last SF in the service chain, the SF sends the service message to the next SF in the service chain so as to send the service message to the tracking server.
In some embodiments, the adding, by the SF, the processing time information of the service packet at the SF to the network service header NSH of the service packet includes: the SF adds the data length of the service message in the processing time information of the SF to the reserved bit of the metadata type field in the NSH, and adds the processing time information of the service message in the SF to the metadata field in the NSH.
In some embodiments, the method further comprises: and under the condition that the SF belongs to the last SF in the service chain, the SF extracts the processing time information of the service message in each SF from the NSH and sends the processing time information of the service message in each SF to the tracking server.
In some embodiments, the method further comprises: under the condition that the SF belongs to the last SF in the service chain, the SF sends the service message to the tracking server; and the tracking server analyzes the NSH of the service message and extracts the processing time information of the service message in each SF from the NSH.
In some embodiments, processing the time information comprises: at least one of a transceiving time stamp group and a processing time stamp group, the transceiving time stamp group including: the SF receives the time stamp of the service message, the SF sends the time stamp of the service message, and the processing time stamp group comprises: the SF starts to process the timestamp of the service message, and the SF finishes processing the timestamp of the service message; alternatively, the processing time information includes: at least one of the network delay information from the last SF to the SF and the processing delay information of the SF, and the time stamp of the service message sent by the SF.
In some embodiments, when the NSH carries a timestamp of a service packet sent by a previous SF, the network delay information of the previous SF reaching the current SF is determined by the following method: the SF determines a timestamp of the received service message; the SF analyzes the NSH to obtain the timestamp of the last SF-sent service message; and the SF determines the network delay information from the last SF to the SF according to the time stamp of the service message sent by the last SF and the time stamp of the received service message.
In some embodiments, the unit of the data length of the processing time information of the service packet in this SF is set to be 32 bits.
According to further embodiments of the present disclosure, there is provided a service function SF including: the determining module is used for determining the processing time information of the service message in the SF; the adding module is used for adding the processing time information of the service message in the SF into a network service head NSH of the service message; and the sending module is used for sending the service message to the next SF in the service chain so as to send the service message to the tracking server under the condition that the SF does not belong to the last SF in the service chain.
In some embodiments, the adding module is configured to add the data length of the processing time information of the service packet in the SF to a reserved bit of a metadata type field in the NSH, and add the processing time information of the service packet in the SF to the metadata field in the NSH.
In some embodiments, the sending module is further configured to, when an SF belongs to a last SF in a service chain, extract, from the NSH, processing time information of the service packet at each SF, and send the processing time information of the service packet at each SF to the tracking server; or, in the case that the SF belongs to the last SF in the service chain, the service packet is sent to the tracking server.
In some embodiments, processing the time information comprises: at least one of a transceiving time stamp group and a processing time stamp group, the transceiving time stamp group including: the SF receives the time stamp of the service message, the SF sends the time stamp of the service message, and the processing time stamp group comprises: the SF starts to process the timestamp of the service message, and the SF finishes processing the timestamp of the service message; alternatively, the processing time information includes: at least one of the network delay information from the last SF to the SF and the processing delay information of the SF, and the time stamp of the service message sent by the SF.
In some embodiments, in a case that the NSH carries a timestamp of a last SF-sent service packet, the adding module is further configured to determine the timestamp of the received service packet, analyze the NSH to obtain the timestamp of the last SF-sent service packet, and determine network delay information from the last SF to the SF according to the timestamp of the last SF-sent service packet and the timestamp of the received service packet.
According to still further embodiments of the present disclosure, a service function SF is provided, including: a processor; and a memory coupled to the processor for storing instructions that, when executed by the processor, cause the processor to perform the method for tracking link information of any of the foregoing embodiments.
According to still other embodiments of the present disclosure, there is provided a system for tracking link information, including: a plurality of SFs of any of the preceding embodiments.
In some embodiments, the tracking system further comprises: the tracking server is used for receiving the service message sent by the last SF in the service chain, analyzing the network service header NSH of the service message, and extracting the processing time information of the service message in each SF from the NSH, or receiving the processing time information of the service message sent by the last SF in the service chain in each SF.
In the present disclosure, the SF in the service chain adds the processing time information of the service packet at the SF to the NSH header, and sends the processing time information to the next SF. Therefore, the SF along the service message transmission transmits the respective processing time information to the tracking server through the service message by modifying the NSH header. Therefore, the tracking server can acquire the processing conditions of all the SFs, the SFs can be efficiently positioned and unpaid, and the operation efficiency is improved.
In addition, compared with the method that each SF independently and the tracking server interactively report the processing time information, the method reduces the interaction times and reduces the consumption of network resources.
Other features of the present disclosure and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present disclosure, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 illustrates a flow diagram of a method of tracking link information of some embodiments of the present disclosure.
Fig. 2 shows a schematic structural diagram of NSH of some embodiments of the present disclosure.
Fig. 3 illustrates a schematic structural diagram of a network of some embodiments of the present disclosure.
Figure 4 shows a structural schematic of the service functionality of some embodiments of the present disclosure.
FIG. 5 shows a schematic structural diagram of a service function of further embodiments of the disclosure.
Fig. 6 shows a schematic structural diagram of a service function of further embodiments of the present disclosure.
Fig. 7 illustrates a schematic structural diagram of a tracking system for link information according to some embodiments of the present disclosure.
Detailed Description
The technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are only a part of the embodiments of the present disclosure, and not all of the embodiments. The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses. All other embodiments, which can be derived by a person skilled in the art from the embodiments disclosed herein without making any creative effort, shall fall within the protection scope of the present disclosure.
The present disclosure provides a method for tracking link information, which is described below with reference to fig. 1 to 3.
Fig. 1 is a flow chart of some embodiments of the disclosed link information tracking method. As shown in fig. 1, the method of this embodiment includes: steps S102 to S106.
In step S102, the SF in the service chain determines the processing time information of the service packet in the SF.
In some embodiments, processing the time information comprises: at least one of a transceiving time stamp group and a processing time stamp group, the transceiving time stamp group including: the SF receives the time stamp of the service message, the SF sends the time stamp of the service message, and the processing time stamp group comprises: the SF starts to process the timestamp of the service message, and the SF finishes processing the timestamp of the service message; alternatively, the processing time information includes: at least one of the network delay information from the last SF to the SF and the processing delay information of the SF, and the time stamp of the service message sent by the SF.
The processing time information may also include: at least one of the transceiving timestamp group, the processing timestamp group, the network delay information from the previous SF to the SF, and the processing delay information in the SF may be included, and the timestamp for the SF to send out the service packet may be included in the case that the transceiving timestamp group is not included.
In some embodiments, when the NSH carries a timestamp of a service packet sent by a previous SF, the network delay information of the previous SF reaching the current SF is determined by the following method: the SF determines a timestamp of the received service message; the SF analyzes the NSH to obtain the timestamp of the last SF-sent service message; and the SF determines the network delay information from the last SF to the SF according to the time stamp of the service message sent by the last SF and the time stamp of the received service message.
Service messages are transmitted among all SF in a service chain, network delay information or a receiving and sending timestamp group reflects the network quality condition, processing delay information or a processing timestamp group reflects the processing capacity of the SF, the two items of information are reported, a tracking server can obtain the capacity information of the network and the SF, and the efficiency of the maintenance process is improved.
In step S104, the SF adds the processing time information of the Service packet at the SF to the NSH (Network Service Header) of the Service packet.
In some embodiments, the SF adds the data length of the service packet in the processing time information of the SF to the reserved bits of the metadata type field in the NSH, and adds the processing time information of the service packet in the SF to the metadata field in the NSH. The unit of the data length of the processing time information of the service packet in this SF is set to 32 bits, for example.
As shown in fig. 2, 4 bits reserved for an MD Type (Metadata Type) in NSH are added as data length bits T-Len of processing time information to indicate a data length of processing time information in Metadata. Since the length of Metadata is required to be an integral multiple of 32 bits, the T-Len unit is set to 32 bits. For example, T-Len of 0001 indicates that the data length of the processing time information is 32 bits.
Because there are multiple SFs in the service chain, after receiving the service message, the SF analyzes the NSH, if the information is found to be added to the MD Type and Metadata fields, the processing time information of the SF is added to the added information, and the length value in the reserved 4 bits of the MD Type is modified to the total length of the added information and the processing time information of the SF. The T-Length is added into the reserved 4 bits of the MD Type to distinguish from the Length field, and the Length field is filled with the Length of the information originally carried by the Metadata field.
In step S106, if the SF does not belong to the last SF in the service chain, the SF sends the service packet to the next SF in the service chain so as to send the service packet to the tracking server.
As shown in fig. 3, an SF sends a Service packet to a corresponding SFF (Service Function Forwarder), and the corresponding SFF sends the Service packet to a next SFF, and then the next SFF sends the Service packet to the next SF.
In the method of the above embodiment, the SF in the service chain adds the processing time information of the service packet in the SF to the NSH header, and sends the processing time information to the next SF. Therefore, the SF along the service message transmission transmits the respective processing time information to the tracking server through the service message by modifying the NSH header. Therefore, the tracking server can acquire the processing conditions of all the SFs, the SFs can be efficiently positioned and unpaid, and the operation efficiency is improved.
In some embodiments, in a case that an SF belongs to a last SF in a service chain, the SF extracts, from the NSH, processing time information of the service packet at each SF, and sends the processing time information of the service packet at each SF to the tracking server.
In other embodiments, when the SF belongs to the last SF in the service chain, the SF sends the service packet to the tracking server; and the tracking server analyzes the NSH of the service message and extracts the processing time information of the service message in each SF from the NSH.
In still other embodiments, in the case where the SF belongs to the last SF in the service chain, the SF extracts NSH from the service message and sends it to the tracking server; and the tracking server analyzes the NSH and extracts the processing time information of the service message in each SF from the NSH.
The SF may send all or part of the service packet to the tracking server according to the actual computing power or requirement, and complete the processing time information collection of the service flow. And finally, the tracking server completes link quality analysis according to the processing time information of the service flow. The tracking server is for example an SDN controller.
The method disclosed by the invention has the advantages that the NSH head is expanded, the network time delay and the processing time delay among the SFs are recorded in the NSH head, all the time delay information on the way is reported to the tracking server only by the last SF, and each SF is not required to report the time delay information, so that the order of magnitude of the time delay information interaction frequency between the SFs and the tracking server is reduced from N to 1, and the purposes of reducing message interaction and reducing network resource consumption are achieved.
The present disclosure also provides an SF, described below in conjunction with fig. 4.
Fig. 4 is a block diagram of some embodiments of a SF of the present disclosure. As shown in fig. 4, SF40 of this embodiment includes: a determination module 410, an addition module 420, and a sending module 430.
The determining module 410 is configured to determine processing time information of the service packet in the SF.
The adding module 420 is configured to add the processing time information of the service packet at the SF to the network service header NSH of the service packet.
In some embodiments, the adding module 420 is configured to add the data length of the processing time information of the service packet in the SF to a reserved bit of a metadata type field in the NSH, and add the processing time information of the service packet in the SF to the metadata field in the NSH. In some embodiments, the unit of the data length of the processing time information of the service packet in this SF is set to be 32 bits.
In some embodiments, processing the time information comprises: at least one of a transceiving time stamp group and a processing time stamp group, the transceiving time stamp group including: the SF receives the time stamp of the service message, the SF sends the time stamp of the service message, and the processing time stamp group comprises: the SF starts to process the timestamp of the service message, and the SF finishes processing the timestamp of the service message; alternatively, the processing time information includes: at least one of the network delay information from the last SF to the SF and the processing delay information of the SF, and the time stamp of the service message sent by the SF.
In some embodiments, in a case that the NSH carries a timestamp of a last SF-sent service packet, the adding module 420 is further configured to determine the timestamp of the received service packet, analyze the NSH to obtain the timestamp of the last SF-sent service packet, and determine network delay information from the last SF to the SF according to the timestamp of the last SF-sent service packet and the timestamp of the received service packet.
The sending module 430 is configured to send the service packet to a next SF in the service chain so as to send the service packet to the tracking server, when the SF does not belong to the last SF in the service chain.
In some embodiments, the sending module 430 is further configured to, when an SF belongs to the last SF in the service chain, extract, from the NSH, processing time information of the service packet at each SF, and send the processing time information of the service packet at each SF to the tracking server; or, in the case that the SF belongs to the last SF in the service chain, the service packet is sent to the tracking server.
The SFs in embodiments of the present disclosure may each be implemented by various computing devices or computer systems, described below in conjunction with fig. 5 and 6.
Fig. 5 is a block diagram of some embodiments of SFs of the present disclosure. As shown in fig. 5, SF50 of this embodiment includes: a memory 510 and a processor 520 coupled to the memory 510, the processor 520 configured to perform a method of tracking link information in any of the embodiments of the present disclosure based on instructions stored in the memory 510.
Memory 510 may include, for example, system memory, fixed non-volatile storage media, and the like. The system memory stores, for example, an operating system, an application program, a Boot Loader (Boot Loader), a database, and other programs.
Fig. 6 is a block diagram of further embodiments of SFs of the present disclosure. As shown in fig. 6, SF60 of this embodiment includes: memory 610 and processor 620 are similar to memory 510 and processor 520, respectively. An input output interface 630, a network interface 640, a storage interface 650, and the like may also be included. These interfaces 630, 640, 650 and the connections between the memory 610 and the processor 620 may be, for example, via a bus 660. The input/output interface 630 provides a connection interface for input/output devices such as a display, a mouse, a keyboard, and a touch screen. The network interface 640 provides a connection interface for various networking devices, such as a database server or a cloud storage server. The storage interface 650 provides a connection interface for external storage devices such as an SD card and a usb disk.
The present disclosure also provides a system for tracking link information, which is described below with reference to fig. 7.
Fig. 7 is a block diagram of some embodiments of the link information tracking system of the present disclosure. As shown in fig. 7, the system 7 of this embodiment includes: a plurality of SF40/50/60 of any of the embodiments described above.
In some embodiments, the system 7 further comprises: the tracking server 72 is configured to receive a service packet sent by the last SF40/50/60 in the service chain, parse a network service header NSH of the service packet, and extract processing time information of the service packet at each SF40/50/60 from the NSH, or receive processing time information of the service packet sent by the last SF40/50/60 in the service chain at each SF 40/50/60.
As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above description is only exemplary of the present disclosure and is not intended to limit the present disclosure, so that any modification, equivalent replacement, or improvement made within the spirit and principle of the present disclosure should be included in the scope of the present disclosure.

Claims (15)

1. A method for tracking link information, comprising:
a Service Function (SF) in a service chain determines the processing time information of a service message in the SF;
the SF adds the processing time information of the service message in the SF to a network service head NSH of the service message;
and under the condition that the SF does not belong to the last SF in the service chain, the SF sends the service message to the next SF in the service chain so as to send the service message to a tracking server.
2. The tracing method according to claim 1, wherein the SF adding the processing time information of the service packet at the SF to a network service header NSH of the service packet includes:
and the SF adds the data length of the service message in the processing time information of the SF to a reserved bit of a metadata type field in the NSH, and adds the processing time information of the service message in the SF to the metadata field in the NSH.
3. The tracking method according to claim 1, further comprising:
and under the condition that the SF belongs to the last SF in the service chain, the SF extracts the processing time information of the service message in each SF from the NSH and sends the processing time information of the service message in each SF to a tracking server.
4. The tracking method according to claim 1, further comprising:
under the condition that the SF belongs to the last SF in the service chain, the SF sends the service message to a tracking server;
and the tracking server analyzes the NSH of the service message and extracts the processing time information of the service message in each SF from the NSH.
5. The tracking method of claim 1, wherein the processing time information comprises: at least one of a set of transceiving timestamps and a set of processing timestamps, the set of transceiving timestamps comprising: the SF receives the timestamp of the service message, the SF sends the timestamp of the service message, and the processing timestamp group includes: the SF starts to process the timestamp of the service message, and the SF finishes processing the timestamp of the service message;
or, the processing time information includes: at least one of the network delay information from the last SF to the SF and the processing delay information in the SF, and the time stamp of the service message sent by the SF.
6. The tracking method according to claim 5, wherein, when the NSH carries a timestamp for sending the service packet by a previous SF, the network delay information from the previous SF to the current SF is determined by using the following method:
the SF determines a timestamp of receiving the service message;
the SF analyzes the NSH to obtain a timestamp of the last SF sending the service message;
and the SF determines the network delay information from the last SF to the SF according to the timestamp of the last SF for sending the service message and the timestamp of the received service message.
7. The tracking method according to claim 2,
the unit of the data length of the service message in the processing time information of the SF is set to be 32 bits.
8. A service function, SF, comprising:
the determining module is used for determining the processing time information of the service message in the SF;
an adding module, configured to add the processing time information of the service packet at the SF to a network service header NSH of the service packet;
and a sending module, configured to send the service packet to a next SF in the service chain so as to send the service packet to a tracking server, when the SF does not belong to a last SF in the service chain.
9. The SF according to claim 8, wherein,
the adding module is configured to add the data length of the processing time information of the service packet in the SF to a reserved bit of the metadata type field in the NSH, and add the processing time information of the service packet in the SF to the metadata field in the NSH.
10. The SF according to claim 8, wherein,
the sending module is further configured to, when the SF belongs to the last SF in the service chain, extract, from the NSH, processing time information of the service packet at each SF, and send the processing time information of the service packet at each SF to a tracking server;
or, when the SF belongs to the last SF in the service chain, the service packet is sent to a tracking server.
11. The SF according to claim 8, wherein,
the processing time information includes: at least one of a set of transceiving timestamps and a set of processing timestamps, the set of transceiving timestamps comprising: the SF receives the timestamp of the service message, the SF sends the timestamp of the service message, and the processing timestamp group includes: the SF starts to process the timestamp of the service message, and the SF finishes processing the timestamp of the service message;
or, the processing time information includes: at least one of the network delay information from the last SF to the SF and the processing delay information in the SF, and the time stamp of the service message sent by the SF.
12. The SF according to claim 11, wherein,
and under the condition that the NSH carries the timestamp of the service message sent by the last SF, the adding module is further used for determining the timestamp of the received service message, analyzing the NSH to obtain the timestamp of the service message sent by the last SF, and determining the network delay information from the last SF to the SF according to the timestamp of the service message sent by the last SF and the timestamp of the received service message.
13. A service function, SF, comprising:
a processor; and
a memory coupled to the processor for storing instructions that, when executed by the processor, cause the processor to perform the method of tracking link information of any of claims 1-7.
14. A system for tracking link information, comprising: a plurality of SFs as claimed in any one of claims 8-13.
15. The tracking system of claim 14, further comprising:
the tracking server is configured to receive a service packet sent by the last SF in the service chain, parse a network service header NSH of the service packet, and extract processing time information of the service packet at each SF from the NSH, or receive processing time information of the service packet sent by the last SF in the service chain at each SF.
CN202111532677.6A 2021-12-15 2021-12-15 Method, system and service function for tracking link information Pending CN114205267A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111532677.6A CN114205267A (en) 2021-12-15 2021-12-15 Method, system and service function for tracking link information

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111532677.6A CN114205267A (en) 2021-12-15 2021-12-15 Method, system and service function for tracking link information

Publications (1)

Publication Number Publication Date
CN114205267A true CN114205267A (en) 2022-03-18

Family

ID=80653887

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111532677.6A Pending CN114205267A (en) 2021-12-15 2021-12-15 Method, system and service function for tracking link information

Country Status (1)

Country Link
CN (1) CN114205267A (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109218058A (en) * 2017-07-06 2019-01-15 中国电信股份有限公司 Acquisition methods, system and the computer readable storage medium of OAM Information
US20190068470A1 (en) * 2017-08-31 2019-02-28 Zte Corporation Residence time measurement for optimizing network services
CN111193631A (en) * 2018-11-14 2020-05-22 中国电信股份有限公司 Information processing method, system, and computer-readable storage medium
CN111699711A (en) * 2018-02-23 2020-09-22 华为技术有限公司 Service function chain congestion feedback
CN111801911A (en) * 2018-02-22 2020-10-20 华为技术有限公司 Traffic function chain congestion tracking
KR20210044682A (en) * 2019-10-15 2021-04-23 고려대학교 산학협력단 System, apparatus and method for measuring delay time of service function
CN113556259A (en) * 2020-04-24 2021-10-26 华为技术有限公司 Message processing method and device based on flow detection

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109218058A (en) * 2017-07-06 2019-01-15 中国电信股份有限公司 Acquisition methods, system and the computer readable storage medium of OAM Information
US20190068470A1 (en) * 2017-08-31 2019-02-28 Zte Corporation Residence time measurement for optimizing network services
CN111801911A (en) * 2018-02-22 2020-10-20 华为技术有限公司 Traffic function chain congestion tracking
CN111699711A (en) * 2018-02-23 2020-09-22 华为技术有限公司 Service function chain congestion feedback
CN111193631A (en) * 2018-11-14 2020-05-22 中国电信股份有限公司 Information processing method, system, and computer-readable storage medium
KR20210044682A (en) * 2019-10-15 2021-04-23 고려대학교 산학협력단 System, apparatus and method for measuring delay time of service function
CN113556259A (en) * 2020-04-24 2021-10-26 华为技术有限公司 Message processing method and device based on flow detection

Similar Documents

Publication Publication Date Title
CN105684382A (en) Packet control method, switch and controller
CN110413441A (en) Active and standby storage volume synchrodata method of calibration, device, equipment and storage medium
CN112291724B (en) 5G signaling visualization method and device
CN105677469A (en) Timing task executing method and device
CN110806921B (en) OVS (optical virtual system) abnormity alarm monitoring system and method
CN105052076B (en) Network element management system and network element management method based on cloud computing
CN111181800A (en) Test data processing method and device, electronic equipment and storage medium
CN113329139B (en) Video stream processing method, device and computer readable storage medium
CN112350854A (en) Flow fault positioning method, device, equipment and storage medium
CN111368005A (en) Data processing method, device and equipment based on block chain and readable storage medium
CN103812688A (en) Alarm determining method and device
CN107995026B (en) Management and control method, management node, managed node and system based on middleware
CN111831540A (en) Debugging information processing method, processing device and storage medium
CN114205267A (en) Method, system and service function for tracking link information
CN112202896A (en) Edge calculation method, frame, terminal and storage medium
CN110351273B (en) Method, device and system for network tracking long chain attack
CN115549862B (en) MES system concurrency performance test data receiving method based on dynamic analysis
CN111193631B (en) Information processing method, system, and computer-readable storage medium
CN105187490B (en) A kind of transfer processing method of internet of things data
CN114630391B (en) Communication method, device and system under network co-establishment sharing scene and sharing base station
CN114629917A (en) Data processing method and device for cross-system communication and electronic equipment
CN112422349B (en) Network management system, method, equipment and medium for NFV
CN115269269A (en) Drill method, device, backup server, medium, server cluster and system
CN107948316B (en) File synchronization method, device and equipment
CN107147694B (en) Information processing method and device

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