Path verification method in content delivery network and device

Abstract

The present invention provides a path verification method in a content delivery network and a device. The method comprises: a client sends a first connection identification frame to a server, wherein the first connection identification frame comprises a current communication address of the client; the client receives a second connection identification frame fed back by the server for the first connection identification frame, wherein the second connection identification frame comprises candidate communication addresses of the server; for any candidate communication address, the client sends a path verification frame to the server on a new path constructed on the basis of the current communication address and the candidate communication address; the client receives, by means of a selected target path, a path response frame fed back by the server, wherein the target path is selected by the server from among a plurality of candidate paths.

Description

A path verification method and device in a content distribution network

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on March 21, 2024, with application number 202410330088.7 and invention name “A Path Verification Method and Device in a Content Distribution Network”, the entire contents of which are incorporated by reference into this application. Technical Field

[0003] The present disclosure relates to the field of communication technology, and in particular to a path verification method and device in a content distribution network. Background Art

[0004] MPQUIC (Multipath QUIC) is a multipath transport protocol based on QUIC (Quick UDP Internet Connections). In a content distribution network, MPQUIC can transmit data simultaneously on multiple network paths, improving the reliability and efficiency of data transmission. When a problem occurs on one path, other paths can continue to transmit data, thus avoiding connection interruptions. It has good application prospects in mobile devices and networks with multiple network interfaces. MPQUIC address verification is a path verification mechanism that verifies whether the data packets sent to the other end on the new path can be received by the other end. Summary of the Invention

[0005] On one hand, the present disclosure provides a path verification method in a content distribution network, the method comprising: a client sending a first connection identification frame to a server, the first connection identification frame including the client's current communication address; the client receiving a second connection identification frame fed back by the server in response to the first connection identification frame, the second connection identification frame including the server's candidate communication addresses; for any candidate communication address, the client sending a path verification frame to the server on a new path constructed based on the current communication address and the candidate communication address; the client receiving a path response frame fed back by the server based on a target path obtained by screening, to complete uplink verification of the new path; wherein the target path is obtained by the server from a plurality of candidate paths screened.

[0006] On the other hand, the present disclosure further provides a client, which includes: a first sending unit, used to send a first connection identification frame to a server, wherein the first connection identification frame includes the current communication address of the client; a first receiving unit, used to receive a second connection identification frame fed back by the server in response to the first connection identification frame, wherein the second connection identification frame includes a candidate communication address of the server; a second sending unit, used to send a path verification frame to the server on a new path constructed based on the current communication address and the candidate communication address for any candidate communication address; a second receiving unit, used to receive a path response frame fed back by the server through a target path obtained by screening, so as to complete the uplink verification of the new path; wherein the target path is obtained by the server from multiple candidate paths screened by the server.

[0007] On the other hand, the present disclosure also provides a path verification method in a content distribution network, the method comprising: a server receiving a first connection identification frame sent by a client, the first connection identification frame including the current communication address of the client; the server feeding back a second connection identification frame to the client in response to the first connection identification frame, the second connection identification frame including a candidate communication address of the server; the server receiving a path verification frame sent by the client on a new path to be verified, the new path being constructed based on the current communication address and the candidate communication address; the server screening out a target path from the multiple candidate paths, and feeding back a path response frame to the client via the target path to complete the uplink verification of the new path.

[0008] On the other hand, the present disclosure also provides a server, which includes: a third receiving unit, used to receive a first connection identification frame sent by a client, the first connection identification frame including the current communication address of the client; a third sending unit, used to feedback a second connection identification frame to the client based on the first connection identification frame, the second connection identification frame including the candidate communication address of the server; a fourth receiving unit, used to receive a path verification frame sent by the client on a new path to be verified, the new path being constructed based on the current communication address and the candidate communication address; a fourth sending unit, used to filter out a target path from multiple candidate paths, and feedback a path response frame to the client through the target path to complete the uplink verification of the new path.

[0009] Another aspect of the present disclosure provides an electronic device, comprising a memory and a processor, wherein the memory is used to store a computer program, and when the computer program is executed by the processor, the path verification method in the content distribution network is implemented.

[0010] On the other hand, the present disclosure further provides a computer-readable storage medium, which is used to store a computer program. When the computer program is executed by a processor, it implements the above-mentioned path verification method in the content distribution network. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The features and advantages of the various embodiments of the present disclosure will be more clearly understood by referring to the accompanying drawings, which are schematic and should not be construed as limiting the present disclosure in any way. In the accompanying drawings:

[0012] FIG1 shows a schematic diagram of a path verification method in a content distribution network in the related art;

[0013] FIG2 is a schematic diagram showing steps of a path verification method in a content distribution network executed by a client in one embodiment of the present disclosure;

[0014] FIG3 shows an interactive schematic diagram of a path verification method in a content distribution network according to an embodiment of the present disclosure;

[0015] FIG4 shows a schematic diagram of functional modules of a client in one embodiment of the present disclosure;

[0016] FIG5 is a schematic diagram showing the steps of a path verification method in a content distribution network executed by a server in one embodiment of the present disclosure;

[0017] FIG6 shows a schematic diagram of functional modules of a server in one embodiment of the present disclosure;

[0018] FIG7 shows a schematic structural diagram of an electronic device in one embodiment of the present disclosure. DETAILED DESCRIPTION

[0019] To make the purpose, technical solutions, and advantages of the embodiments of the present disclosure more clear, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments of the present disclosure, all other embodiments obtained by those skilled in the art without making any creative efforts shall fall within the scope of protection of the present disclosure.

[0020] As mentioned above, MPQUIC address verification is a path verification mechanism that verifies that packets sent to a peer on a new path can be received by that peer. Currently, when performing path verification in content delivery networks (CDNs), data frames are typically transmitted along a predetermined path. However, due to network instability, this path may experience poor data transmission, thus impacting the efficiency of path verification in the CDN.

[0021] In view of this, one or more embodiments of the present disclosure provide a path verification method and device in a content distribution network, which can improve the efficiency of path verification in the content distribution network. According to the technical solution provided by one or more embodiments of the present disclosure, after the client sends a path verification frame to the server through the new path to be verified, the server can filter out a target path whose transmission status meets the conditions from multiple candidate paths based on the actual network transmission situation, and then feed back the path response frame to the client through the target path, thereby completing the uplink verification process of the new path. By dynamically selecting the feedback path of the path response frame, the success rate and speed of the path response frame being received by the client can be ensured, thereby improving the efficiency and stability of path verification in the content distribution network.

[0022] Referring to FIG. 1 , in related art, MPQUIC address verification in a content delivery network may include the following steps:

[0023] Step 1: After the client and server complete the TCP / IP handshake process, the client can send a connection identification frame to the server. The connection identification frame can carry the client's communication address (for example, the client's communication address can be represented by C1 in Figure 1);

[0024] Step 2: After receiving the connection identification frame, the server may also feed back a connection identification frame to the client. The connection identification frame fed back by the server may carry multiple communication addresses currently available to the server (for example, the two communication addresses available to the server in Figure 1 may be represented by S1 and S2);

[0025] Step 3: After informing each other of their communication addresses, the client can send a path verification frame on the path to be verified. For example, in Figure 1, the path to be verified can be composed of the client's communication address C1 and the server's communication address S2. The client can send a path verification frame along this path.

[0026] Step 4: After receiving the path verification frame through the path to be verified, the server can check the information in it. If the information is correct, it can feedback the path response frame to the client through the path to be verified;

[0027] Step 5: After the client receives the path response frame, it can be indicated that the uplink path from the client to the server has completed the verification in the path to be verified.

[0028] Subsequently, the server can follow a similar approach to complete the downlink verification in the path to be verified.

[0029] It's not difficult to see that in the aforementioned related technologies, both the path verification frame and the path response frame are transmitted over the same path (the path to be verified). However, in some scenarios, due to fluctuations in the content delivery network (CDN) environment, when the server sends the path response frame back to the client, the downlink path in the path to be verified may not have good communication conditions, thus affecting the entire path verification process.

[0030] In view of this, an embodiment of the present disclosure provides a path verification method in a content distribution network. Please refer to Figures 2 and 3. The method may include the following steps.

[0031] S11: The client sends a first connection identification frame to the server, where the first connection identification frame includes the current communication address of the client.

[0032] In this embodiment, before performing content delivery network path verification, the client and server can perform a three-way handshake. After completing the three-way handshake process, network parameters such as latency and packet loss rate between each communication address of the client and each communication address of the server can be obtained. Based on the obtained network parameters, the communication quality of the possible communication paths between the client and the server can be evaluated.

[0033] For example, if the client's currently available communication address is C1 and the server's currently available communication addresses are S1 and S2, then the communication links between the client and server can include at least two paths: [C1, S1] and [C1, S2]. [C1, S1] indicates that the communication address at one end of the path is C1, and the communication address at the other end is S1. Similarly, [C1, S2] indicates that the communication address at one end of the path is C1, and the communication address at the other end is S2.

[0034] After the client and server complete the three-way handshake process, assuming that the network parameters indicate that the communication quality of path [C1, S1] is better than that of path [C1, S2], the evaluation result of this communication quality will affect the data frame transmission rules during the subsequent path verification process.

[0035] In this embodiment, after the client and the server complete the handshake process and determine the communication quality evaluation results between different paths, the client can start the path verification process.

[0036] In this embodiment, at the beginning of the path verification, the client and the server can inform each other of the currently available communication addresses. Specifically, the client can send a first connection identification frame (NEW_CONNECTION_ID frame) to the server in the default path. The default path can be a path that does not require path verification. For example, one end of the default path can be the client's communication address C0, and the other end can be the server's communication address S0. The first connection identification frame can carry the client's current communication address. The current communication address can be the communication address to be verified on the client side. For example, the current communication address can be C1.

[0037] S13: The client receives a second connection identification frame fed back by the server in response to the first connection identification frame, where the second connection identification frame includes a candidate communication address of the server.

[0038] In this embodiment, after the server receives the first connection identification frame sent by the client through the default path, it can parse out the client's subsequent communication address to be verified. Then, in response to the first connection identification frame, the server can feedback a second connection identification frame (still a NEW_CONNECTION_ID frame) to the client. The second connection identification frame can carry the server's candidate communication address. The candidate communication address can be the communication address to be verified on the server side. For example, the candidate communication address can be S1 and S2.

[0039] In one embodiment, the above-mentioned first connection identification frame and the second connection identification frame can be located in the same packet number space. For example, in Figure 3, the first connection identification frame and the second connection identification frame can both be located in the packet number space of 1-RTT[]. It's just that in the same packet number space, in order to ensure the independence of data transmission, different candidate communication addresses can be located in different second connection identification frames. For example, the server can feedback two second connection identification frames, carrying the above-mentioned candidate communication addresses S1 and S2 respectively, and in different second connection identification frames, different sequence numbers can be added according to the order in which the data frames are created. For example, the two second connection identification frames in Figure 3 can carry sequence numbers 1 and 2 (Seq=1 and Seq=2), respectively.

[0040] S15: For any candidate communication address, the client sends a path verification frame to the server on a new path constructed based on the current communication address and the candidate communication address.

[0041] In this embodiment, after the client and server have communicated their respective communication addresses, they can proceed to the subsequent stages of path verification. Each path to be verified between the client and server can undergo the subsequent stages of path verification. Taking a new path to be verified [C1, S2] as an example, the two communication addresses that constitute this new path are C1 and S2, where C1 is the current communication address on the client side, and S2 is the candidate communication address on the server side. In other words, based on the current communication address and a candidate communication address, a new path to be verified can be constructed.

[0042] For the new path [C1, S2] to be verified, the client can send a path verification frame (PATH_CHALLENGE[X] frame) to the server on this new path. The path verification frame sent by the client can be used to verify whether the uplink path from the client to the server meets the communication requirements, where X indicates that the current path verification frame is used to verify the uplink path. In actual applications, the destination address carried in the path verification frame initiated by the client can be the candidate communication address (S2) of the new path to be verified on the server side, which can be represented by a field such as DCID=S2.

[0043] S17: The client receives a path response frame fed back by the server through the target path obtained by screening, so as to complete the uplink verification of the new path; wherein, the target path is obtained by the server through screening from multiple candidate paths.

[0044] In this embodiment, after receiving the path verification frame sent by the client, in order to improve the stability and efficiency of path verification, after confirming that the content in the path verification frame is correct, the server can screen out the target path with the best communication quality based on the communication quality evaluation results of each path obtained in the aforementioned steps, and then feedback a path response frame (PATH_RESPNSE frame) to the client on the target path.

[0045] For example, if the new path to be verified is [C1, S2], and the client sends a path verification frame to the server on this new path, and the server determines that the communication quality of path [C1, S1] is better than that of path [C1, S2], then the server can send a path response frame back to the client on path [C1, S1] instead of sending a path response frame back via path [C1, S2]. In other words, the communication address of the server receiving the path verification frame is S2, but the communication address of the path response frame sent in response to the path verification frame is S1.

[0046] The purpose of this process is to ensure that, during the uplink path verification process, the client only needs to ensure that the path verification frame sent by the client corresponds to the new path to be verified. After confirming the content of the path verification frame is correct, the server does not necessarily need to send back a path response frame for the new path to be verified. Therefore, in this embodiment, the server ensures the stability and efficiency of the uplink path verification process by sending back a path response frame to the client on the target path with the best communication quality.

[0047] In one embodiment, based on various network parameters between the client and the server, the path delay of each path between the client and the server can be calculated, and then the path delays are sorted in ascending order to screen out the minimum delay path, and the minimum delay path is used as the target path for transmitting the path response frame.

[0048] In this embodiment, after the client receives the path response frame fed back by the server through the target path, the client completes the path verification process for the uplink path in the new path to be verified.

[0049] It can be understood that the above-mentioned new path and target path both include an uplink path and a downlink path, wherein the client can send a path verification frame to the server through the uplink path of the new path, and the client can receive a path response frame sent by the server through the downlink path of the target path.

[0050] Subsequently, the downlink path in the new path to be verified also needs to be verified in a similar manner. Specifically, the server can send a path verification frame (PATH_CHALLENGE[Y] frame) to the client on the new path to be verified, where Y indicates that the path verification frame is used to verify the downlink path. Since the new path to be verified is [C1, S2], the path verification frame sent by the server is sent from the communication address S2 and the destination address is the client's communication address C1, which can be represented by DCID=C1.

[0051] Similarly, after receiving the path verification frame sent by the server, the client can screen out the path with the best communication quality from the multiple candidate paths, and feedback the path response frame to the server on the path with the best communication quality. In one embodiment, based on the various network parameters between the client and the server, the client can calculate the path delay of each path between the client and the server, and then sort the paths in ascending order according to the path delay, and use the path corresponding to the smallest path delay as the screened target path. For example, if the communication quality of path [C1, S1] is better than the communication quality of path [C1, S2], then when the client feeds back the path response frame to the server, the destination address is S1, not S2. In other words, the server sends a path verification frame from the communication address S2, but receives a path response frame from the communication address S1.

[0052] Although steps S15 and S17 differ from the mutual communication address notification phase in steps S11 and S13, both phases are part of the path verification process and can therefore be performed within the same packet numbering space, 1-RTT. In other words, the aforementioned first connection identification frame, second connection identification frame, path verification frame, and path response frame can all be transmitted within the same packet numbering space.

[0053] After the client and server complete the verification of the upstream path and the downstream path respectively, the new path to be verified in the content distribution network completes the verification process.

[0054] In one embodiment, the communication quality of each path between the client and the server can have a more detailed representation. In the aforementioned embodiment, the communication quality of the path can characterize the overall communication quality of the round-trip path composed of the uplink path and the downlink path. For example, when using the path delay to characterize the communication quality of the path [C1, S1], the sum of the delays of the two unidirectional paths from C1 to S1 and from S1 to C1 is calculated. In order to further improve the efficiency of path verification, the uplink path and the downlink path can be treated as two independent unidirectional paths to determine the communication quality separately. In this way, the two paths in the aforementioned embodiment can be split into four independent unidirectional paths in the subsequent process of determining the communication quality.

[0055] Specifically, similar to the aforementioned embodiment, the client and the server can still perform a handshake process first. After the handshake, the network parameters between the client and the server can be learned. Based on the learned network parameters, the communication quality of each unidirectional path between the client and the server can be determined. For example, for the path [C1, S1] (represented by path 1) and [C1, S2] (represented by path 2), it can be split into four independent unidirectional paths:

[0056] U(path 1), U(path 2), D(path 1), D(path 2)

[0057] The four unidirectional paths described above represent the uplink path of path 1, the uplink path of path 2, the downlink path of path 1, and the downlink path of path 2, respectively. The communication quality of each unidirectional path can be determined in a similar manner. For example, the path delay of each unidirectional path can be calculated separately, and the path delay can be used to represent the communication quality of the unidirectional path. The smaller the path delay, the better the communication quality.

[0058] In this embodiment, after completing the handshake, the client and server can continue to inform each other of available communication addresses according to the method of steps S11 and S13. For the new path to be verified (taking [C1, S2] as an example), the client can continue to send a path verification frame to the server via the uplink path of the new path according to the method of step S15. In this path verification frame, the source address can be C1 and the destination address can be S2.

[0059] After confirming that the path verification frame is correct, the server can select the downlink path with the best current communication quality based on the communication quality of each unidirectional path, and feedback the path response frame to the client through the downlink path.

[0060] Unlike the previous implementation, the server selects the path for the feedback path response frame based on a finer granularity of one-way paths, rather than simply selecting based on the overall communication quality of the round-trip path. Assume that the communication quality relationship of the four one-way paths mentioned above is as follows:

[0061] U(path 1) is better than U(path 2), and D(path 2) is better than D(path 1)

[0062] The path currently to be verified is path 2 [C1, S2]. The client then sends a path verification frame to the server via U (path 2). After confirming that the path verification frame is correct, the server can feedback a path response frame to the client via D (path 2), which has better communication quality. In this scenario, both the path verification frame and the path response frame are actually transmitted via path 2. Although the overall round-trip communication quality of path 2 may be lower than that of path 1, for a one-way downlink path, the downlink path communication quality of path 2 is better. Therefore, when the server feedbacks a path response frame to the client, it will select the downlink path of path 2. In other words, each candidate path includes an uplink path and a downlink path, and the target path can be obtained by the server by screening the candidate downlink paths.

[0063] Similarly, when verifying the downlink path of Path 2, the server sends a Path Verification frame to the client via D (Path 2). After confirming that the content of the Path Verification frame sent by the server is correct, the client selects U (Path 1) with better communication quality and sends a Path Response frame back to the server. In other words, after receiving the Path Verification frame from the server via the new path, the client responds to it by selecting the optimal uplink path from the candidate uplink paths and sending a Path Response frame back to the server via the optimal uplink path, completing the downlink verification of the new path in the content delivery network.

[0064] Specifically, when screening the optimal uplink path, the client may calculate the path delay of each candidate uplink path, and use the uplink path corresponding to the minimum path delay as the screened optimal uplink path.

[0065] It can be seen from the above implementation method that after the client sends a path verification frame to the server through the new path to be verified, the server can filter out the target path whose transmission status meets the conditions from multiple candidate paths based on the actual network transmission situation, and then feed back the path response frame to the client through the target path, thereby completing the uplink verification process of the new path in the content distribution network.

[0066] Similarly, when the server is performing downstream verification of a new path, the client can also select a path that meets the conditions based on the actual network transmission situation, and then feedback a path response frame on the selected path, thereby completing the verification of the downstream path in the content distribution network.

[0067] By dynamically selecting the feedback path of the path response frame, the success rate and speed of the path response frame being received by the client can be ensured, thereby improving the efficiency and stability of path verification in the content distribution network.

[0068] Referring to FIG4 , an embodiment of the present disclosure further provides a client, the client comprising:

[0069] The first sending unit 100 is configured to send a first connection identification frame to the server, where the first connection identification frame includes the current communication address of the client;

[0070] The first receiving unit 200 is configured to receive a second connection identification frame fed back by the server in response to the first connection identification frame, where the second connection identification frame includes a candidate communication address of the server;

[0071] The second sending unit 300 is configured to send a path verification frame to the server on a new path constructed based on the current communication address and the candidate communication address for any candidate communication address;

[0072] The second receiving unit 400 is configured to receive a path response frame fed back by the server through the screened target path to complete uplink verification of the new path; wherein the target path is screened by the server from multiple candidate paths.

[0073] In one embodiment, the first connection identification frame and the second connection identification frame are located in the same packet numbering space, and different candidate communication addresses are located in different second connection identification frames, and different second connection identification frames carry different sequence numbers.

[0074] In one embodiment, the client further includes:

[0075] a path verification frame receiving unit, configured to receive a path verification frame sent by the server through the new path;

[0076] A path screening unit is used to respond to the path verification frame sent by the server, screen out the target path from the multiple candidate paths, and feed back a path response frame to the server through the target path to complete the downlink verification of the new path.

[0077] In one embodiment, the path screening unit is specifically configured to calculate the path delay of each candidate path, and select the path corresponding to the minimum path delay as the screened target path.

[0078] In one embodiment, the first connection identification frame, the second connection identification frame, the path verification frame, and the path response frame are all located in the same packet numbering space.

[0079] In one embodiment, the new path and the target path both include an uplink path and a downlink path, wherein the client sends the path verification frame to the server through the uplink path of the new path, and receives the path response frame sent by the server through the downlink path of the target path.

[0080] In one embodiment, each candidate path includes an uplink path and a downlink path, and the target path is obtained by the server by screening each candidate downlink path.

[0081] In one embodiment, the client further includes:

[0082] a path verification frame receiving unit, configured to receive a path verification frame sent by the server through the new path;

[0083] The uplink path screening unit is used to screen out the best uplink path from the candidate uplink paths in response to the path verification frame sent by the server, and feed back a path response frame to the server via the best uplink path to complete the downlink verification of the new path.

[0084] In one embodiment, the uplink path screening unit is specifically configured to calculate the path delay of each candidate uplink path, and use the uplink path corresponding to the minimum path delay as the screened optimal uplink path.

[0085] The specific processing logic of each functional module can be found in the description of the aforementioned method implementation method, which will not be repeated here.

[0086] The various units described in the above embodiments can be implemented by computer chips or products with certain functions. A typical implementation device is a computer. Specifically, the computer can be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

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

[0088] Please refer to FIG5 . An embodiment of the present disclosure further provides a path verification method in a content distribution network. The execution subject of the method may be a server, and the method may include the following steps.

[0089] S21: The server receives a first connection identification frame sent by the client, where the first connection identification frame includes the current communication address of the client;

[0090] S23: The server feeds back a second connection identification frame to the client in response to the first connection identification frame, where the second connection identification frame includes a candidate communication address of the server;

[0091] S25: The server receives a path verification frame sent by the client on a new path to be verified, where the new path is constructed based on the current communication address and the candidate communication address;

[0092] S27: The server selects a target path from the multiple candidate paths, and feeds back a path response frame to the client via the target path to complete the uplink verification of the new path.

[0093] The specific implementation of each step can be found in the description of the aforementioned embodiment, which will not be repeated here.

[0094] Referring to FIG6 , an embodiment of the present disclosure further provides a server, which includes:

[0095] The third receiving unit 110 is configured to receive a first connection identification frame sent by a client, where the first connection identification frame includes a current communication address of the client;

[0096] The third sending unit 210 is configured to feed back a second connection identification frame to the client in response to the first connection identification frame, where the second connection identification frame includes a candidate communication address of the server;

[0097] A fourth receiving unit 310 is configured to receive a path verification frame sent by the client on a new path to be verified, where the new path is constructed based on the current communication address and the candidate communication address;

[0098] The fourth sending unit 410 is configured to select a target path from the multiple candidate paths, and feed back a path response frame to the client via the target path to complete uplink verification of the new path.

[0099] The specific processing logic of each functional module can be found in the description of the aforementioned method implementation method, which will not be repeated here.

[0100] The various units described in the above embodiments can be implemented by computer chips or products with certain functions. A typical implementation device is a computer. Specifically, the computer can be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

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

[0102] Please refer to FIG. 7 . An embodiment of the present disclosure further provides an electronic device, comprising a memory and a processor. The memory is used to store a computer program. When the computer program is executed by the processor, the path verification method in the content distribution network is implemented.

[0103] The present disclosure also provides a computer-readable storage medium, which is used to store a computer program. When the computer program is executed by a processor, it implements the path verification method in the content distribution network.

[0104] The processor may be a central processing unit (CPU). The processor may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or a combination of the above chips.

[0105] Memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as the program instructions / modules corresponding to the methods in the embodiments of the present disclosure. The processor executes the non-transitory software programs, instructions, and modules stored in the memory to perform various processor functions and data processing, thereby implementing the methods in the aforementioned method embodiments.

[0106] The memory may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created by the processor, etc. In addition, the memory may include a high-speed random access memory, and may also include a non-transitory memory, such as at least one disk storage device, a flash memory device, or other non-transitory solid-state storage device. In some embodiments, the memory may optionally include a memory remotely located relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0107] Those skilled in the art will appreciate that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program. The program can be stored in a computer-readable storage medium. When the program is executed, it can include the processes of the above-mentioned embodiments. The storage medium can be a magnetic disk, an optical disk, a read-only memory (ROM), a random access memory (RAM), a flash memory, a hard disk drive (HDD), or a solid-state drive (SSD). The storage medium can also include a combination of the above-mentioned types of memory.

[0108] The various embodiments in this specification are described in a progressive manner. Similar portions between the various embodiments can be referenced to each other, and each embodiment focuses on the differences from the other embodiments. In particular, the embodiments of the client, server, device, and storage medium are generally similar to the method embodiments, so their descriptions are relatively simple. For relevant portions, refer to the descriptions of the method embodiments.

[0109] The foregoing is merely an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present application should all be included within the scope of the claims of the present application.

[0110] Although the embodiments of the present disclosure have been described with reference to the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present disclosure, and such modifications and variations are all within the scope defined by the appended claims.

Claims

1. A path verification method in a content distribution network, comprising: The client sends a first connection identification frame to the server, where the first connection identification frame includes the current communication address of the client; The client receives a second connection identification frame fed back by the server in response to the first connection identification frame, where the second connection identification frame includes a candidate communication address of the server; For any candidate communication address, the client sends a path verification frame to the server on a new path constructed based on the current communication address and the candidate communication address; The client receives the path response frame fed back by the server through the target path obtained by screening, so as to complete the uplink verification of the new path; wherein, the target path is obtained by the server through screening from multiple candidate paths.

2. The method according to claim 1, wherein The first connection identification frame and the second connection identification frame are located in the same packet number space, and different candidate communication addresses are located in different second connection identification frames, and different second connection identification frames carry different sequence numbers.

3. The method according to claim 1, wherein After completing the uplink verification of the new path, the method further includes: The client receives a path verification frame sent by the server through the new path; In response to the path verification frame sent by the server, the target path is selected from the multiple candidate paths, and a path response frame is fed back to the server via the target path to complete the downlink verification of the new path.

4. The method according to claim 3, wherein: Filtering the target path from the multiple candidate paths includes: The path delay of each candidate path is calculated, and the path corresponding to the minimum path delay is selected as the target path.

5. The method according to claim 1 or 3, wherein: The first connection identification frame, the second connection identification frame, the path verification frame, and the path response frame are all located in the same packet numbering space.

6. The method according to claim 1, wherein The new path and the target path both include an uplink path and a downlink path, wherein the client sends the path verification frame to the server through the uplink path of the new path, and receives the path response frame sent by the server through the downlink path of the target path.

7. The method according to claim 1, wherein Each candidate path includes an uplink path and a downlink path, and the target path is obtained by screening the server from each candidate downlink path.

8. The method according to claim 7, wherein: After completing the uplink verification of the new path, the method further includes: The client receives a path verification frame sent by the server through the new path; In response to the path verification frame sent by the server, the optimal uplink path is screened out from the candidate uplink paths, and a path response frame is fed back to the server via the optimal uplink path to complete the downlink verification of the new path.

9. The method according to claim 8, wherein The optimal uplink path selected from the candidate uplink paths includes: The path delay of each candidate uplink path is calculated, and the uplink path corresponding to the minimum path delay is used as the selected optimal uplink path.

10. A client, comprising: A first sending unit is configured to send a first connection identification frame to the server, where the first connection identification frame includes the current communication address of the client; A first receiving unit is configured to receive a second connection identification frame fed back by the server in response to the first connection identification frame, where the second connection identification frame includes a candidate communication address of the server; A second sending unit is configured to send a path verification frame to the server on a new path constructed based on the current communication address and the candidate communication address for any candidate communication address; The second receiving unit is configured to receive a path response frame fed back by the server through the screened target path to complete uplink verification of the new path; wherein the target path is screened by the server from multiple candidate paths.

11. A path verification method in a content distribution network, comprising: The server receives a first connection identification frame sent by the client, where the first connection identification frame includes the current communication address of the client; The server feeds back a second connection identification frame to the client in response to the first connection identification frame, where the second connection identification frame includes a candidate communication address of the server; The server receives a path verification frame sent by the client on a new path to be verified, where the new path is constructed based on the current communication address and the candidate communication address; The server selects a target path from the candidate paths and feeds back a path response frame to the client via the target path to complete the uplink verification of the new path.

12. A server comprising: A third receiving unit is configured to receive a first connection identification frame sent by a client, where the first connection identification frame includes a current communication address of the client; a third sending unit, configured to feed back a second connection identification frame to the client in response to the first connection identification frame, where the second connection identification frame includes a candidate communication address of the server; a fourth receiving unit, configured to receive a path verification frame sent by the client on a new path to be verified, where the new path is constructed based on the current communication address and the candidate communication address; The fourth sending unit is configured to select a target path from the multiple candidate paths, and feed back a path response frame to the client via the target path to complete uplink verification of the new path.

13. An electronic device comprising a memory and a processor, wherein the memory is used to store a computer program, and when the computer program is executed by the processor, the path verification method in a content distribution network according to any one of claims 1 to 9 or 11 is implemented.

14. A computer storage medium, wherein the computer storage medium is used to store a computer program, wherein when the computer program is executed by a processor, the path verification method in a content distribution network according to any one of claims 1 to 9 or 11 is implemented.

Images