CN114553727A

CN114553727A - Data processing method and device based on content distribution network

Info

Publication number: CN114553727A
Application number: CN202210149696.9A
Authority: CN
Inventors: 陈志艺
Original assignee: Wangsu Science and Technology Co Ltd
Current assignee: Wangsu Science and Technology Co Ltd
Priority date: 2022-02-18
Filing date: 2022-02-18
Publication date: 2022-05-27

Abstract

The embodiment of the invention provides a data processing method and a device based on a content distribution network, wherein the method comprises the steps that a first node determines a node level of the first node based on a first service access request message, and determines a first service function configuration matched with the node level from a plurality of service function configurations of different levels, namely the node level of the node is not fixed statically any more, so that the node has different node levels in different scenes, and the first service access request message is processed by executing the first service function configuration. Therefore, the scheme dynamically defines the node levels of all the nodes from the software dimension, so that the nodes can take effect in different node levels under different scenes, the nodes can take effect flexibly according to the current scene of the nodes, the service function configuration more conforming to the current scene is realized, the effective multiplexing of the nodes is realized, and the condition of resource waste caused by the fact that all the nodes need redundancy planning is effectively avoided.

Description

Data processing method and device based on content distribution network

Technical Field

The embodiment of the invention relates to the technical field of content distribution networks, in particular to a data processing method and device based on a content distribution network.

Background

As more and more enterprises are added to the CDN (Content Delivery Network) industry, the competition is more and more intense, and cost optimization has become a key index of each large CDN manufacturer in order to better capture the market, so that the existing resources need to be maximally utilized. Meanwhile, as more and more services have periodic increases, enough redundant resources have to be prepared in advance, so that for the CDN with the priority on cost, snow frosting is undoubtedly caused, the resource allocation period is long, and the resource cost and the labor cost are both high expenses.

The existing hierarchical resource management scheme based on a content distribution network is as follows: in the content distribution network, different hierarchy types (namely, resource hierarchy and resource types) are directly distinguished and planned from hardware dimensions according to different stages of service processing, namely, edge resources (namely, edge nodes), one-layer father resources (namely, one-layer father nodes) and two-layer father resources (namely, two-layer father nodes). Moreover, in a content distribution network, all application layer data is processed according to the flow of client- > edge resource- > parent resource (multi-hierarchy) - > source station. In addition, since different hierarchy types of resources require different functional services, different functional configurations may be deployed for the resources of different hierarchy types. However, in the hierarchical resource management scheme, from the perspective of hardware resources, the hierarchical types of resources (i.e., nodes) are statically planned directly, and differentiated functional configurations are deployed for resources of different hierarchical types, so that the resources of different hierarchical types cannot be used in a mixed manner. Moreover, since the resources of different hierarchy types cannot be used in a mixed manner, the resources of different hierarchy types respectively need to be separately redundantly planned, thereby causing resource waste.

In summary, there is a need for a data processing method based on a content distribution network, so as to effectively avoid the situation of resource waste caused by the need of redundant planning for each node.

Disclosure of Invention

The embodiment of the invention provides a data processing method and device based on a content distribution network, which are used for effectively avoiding the situation of resource waste caused by the fact that each node needs redundancy planning.

In a first aspect, an embodiment of the present invention provides a data processing method based on a content distribution network, including:

the first node determines the node level of the first node based on a first service access request message; the first service access request message is used for indicating any client to acquire a service file provided by a target source station; the first node is any node located in the content distribution network;

the first node enables a first traffic function configuration that matches a node hierarchy of the first node; the first node is pre-configured with a plurality of different levels of service function configurations;

and the first node processes the first service access request message by executing the first service function configuration.

In the above technical solution, because the prior art solution directly and statically differentiates and plans different node hierarchies of each node from the hardware dimension, the node hierarchy of each node is clear and fixed, and therefore, the nodes of different node hierarchies cannot be mixed. Moreover, since the nodes of different node levels cannot be used in a mixed manner, when the amount of service access requests increases, redundancy planning needs to be performed on each node, which results in resource waste. Based on this, the technical scheme in the invention is that the node hierarchy and the node type are defined from the software dimension, that is, the node hierarchy definition, the node type definition and the hardware device (namely, the node) are stripped, and different node hierarchies and different node types are not required to be statically distinguished and planned from the hardware dimension directly, so that the node hierarchy and the node type of the node are dynamically defined, the node hierarchy and the node type constraint on the hardware can be broken, the dynamic control or the adjustment of any node to take effect on different node hierarchies and node types can be realized, the flexibility of defining the node hierarchy and the node type of the node can be effectively improved, and the effective multiplexing of the node can be realized. Specifically, for any node (i.e., a first node) located in a content distribution network, when detecting a first service access request packet, the first node can accurately know the node hierarchy of the first node through the first service access request packet, where the first service access request packet is used to instruct any client to acquire a service file provided by a target source station, and at the same time, determine, from a plurality of service function configurations belonging to different hierarchies, a first service function configuration matching the node hierarchy of the first node, that is, the node hierarchy of the node is no longer statically fixed, so that the node has different node hierarchies (for example, one node may be used as an edge node, or may be used as a parent node of a certain hierarchy, such as a first-layer parent node or a second-layer parent node) in different scenarios, and generates service function configurations corresponding to the different node hierarchies, therefore, the effective multiplexing of the nodes is realized, and the nodes do not need to be subjected to redundancy planning, so that the resource waste is effectively avoided. And then, the first service access request message can be processed by executing the first service function configuration, so that the service file provided by the target source station corresponding to the first service request message can be effectively inquired in time. Therefore, according to the scheme, the node levels of all the nodes are dynamically defined from the software dimension, so that the nodes take effect in different node levels under different scenes, the node levels of the nodes are not statically fixed, the flexibility of the node levels of the nodes is increased, the nodes can flexibly and dynamically take effect according to the current scenes, the service function configuration which is more consistent with the current scenes can be realized, the effective multiplexing of the nodes can be realized, and the condition that resources are wasted due to the fact that all the nodes need redundant planning can be effectively avoided.

Optionally, after the first service access request packet is processed by executing the first service function configuration, the method further includes:

and when the first node determines to inquire out the service file provided by the target source station, the first node transmits the service file to the client based on the first service function configuration.

In the above technical solution, after querying a service file requested by a certain client, the first node can accurately transmit the service file to the client through a request path of the service file, so that the client can obtain the service file in time.

Optionally, the determining, by the first node, a node hierarchy of the first node based on the first service access request packet includes:

the first node detects the first service access request message and determines whether the first service access request message carries a node level;

if so, the first node determines the node level carried in the first service access request message as the node level of the first node.

In the above technical solution, after receiving a first service access request message, a first node may perform content detection or analysis on the first service access request message, so as to determine whether the first service access request message carries a node level, and if the first service access request message carries a node level, the first node may timely learn which level the first node is specifically located in a path of the service access request, because different node levels correspond to different service function configurations, that is, different node levels correspond to different service function permissions, the first node may timely take effect on a service function configuration matched with the node level of the first node, so that the first service access request message may be accurately processed correspondingly through the service function configuration.

Optionally, the method further comprises:

if the first service access request message does not carry a node level, the first node determines that the node level of the first node is a 0 th level;

wherein the first node at level 0 is an edge node.

In the above technical solution, when detecting a service access request message for a service file sent by a certain client, a node logically close to the client may be allocated from each node located in the content distribution network as a node for receiving the service access request packet, and then the service access request packet received by the node logically close to the client does not carry a node level, that is, the node logically close to the client belongs to the 0 th level, meanwhile, the node which is logically close to the client can be determined to be used as an edge node in the service access request, so that the service function configuration which is matched with the 0 th level is acted by the node which is logically close to the client, therefore, the first service access request message can be correspondingly processed through the service function configuration matched with the 0 th layer. The node logically close to the client serves as an edge node in the current service access request, but may serve as a parent node in other service access requests.

when the first node determines that the service file provided by the target source station is not inquired, generating a second service access request message based on the first service access request message, and forwarding the second service access request message to the second node; the second node is a next hop node of the first node within the content distribution network.

In the above technical solution, when the first node does not locally query the service file requested by the client, the first node forwards the service access request to the next hop node, that is, the first service access request packet is subjected to certain processing, so as to generate a second service access request packet forwarded to the next hop node (i.e., the second node), so that the service file requested by the client can be queried by enabling the service function configuration matched with the node hierarchy of the second node through the second node. The second node is used as a parent node in the current service access request, but may be used as an edge node in other service access requests.

Optionally, the generating a second service access request packet based on the first service access request packet includes:

the first node adds the forwarding times of the service access request message and the node type of the second node in a preset field in a basic header of the first service access request message to generate a second service access request message; the service access request message forwarding times are used for indicating the node level of the second node; the node hierarchy and the node type are used for indicating service function permission which the second node has; and the service function authority is used for indicating the service function configuration matched with the second node.

In the above technical solution, when the first node needs to forward the service access request to the next hop node, the content in the received first service access request message is changed, for example, the number of forwarding times of the service access request message (for indicating the node level of the second node) and the node type of the next hop node are added to a preset field in the basic header of the first service access request message, so as to generate the second service access request message, so that when the next hop node receives the second service access request message, it can timely know which level the next hop node is specifically located in the current service access request path and whether the next hop node is a parent node or an edge node through the second service access request message, and after knowing corresponding information, it can take effect a service function configuration matched with the next hop node, so that the node can flexibly take effect according to its current scene and more conform to the service function configuration of the current scene Can be configured so that efficient multiplexing of nodes can be achieved. The method includes the steps of adding a service access request message, forwarding the service access request message, and performing a certain fault tolerance on the forwarding of the service access request message, that is, it can be understood that if the forwarding times of the service access request message exceed a certain value, a back-to-source policy can be executed (that is, the service access request message is forwarded to a target source station outside a content distribution network, and a corresponding service file is queried through the target source station).

Optionally, before generating the second service access request packet, the method further includes:

if the first node determines that the next hop node of the first node is a target source station located outside the content distribution network, deleting the content added by a preset field in a basic header of the first service access request message, and forwarding the deleted first service access request message to the target source station; and the target source station is used for acquiring a corresponding service file according to the deleted first service access request message.

In the above technical solution, if the first node determines that the next hop node is the target source station, at this time, a second service access request message does not need to be generated, but the target source station queries a corresponding service file through the deleted first service access request message by deleting the content added to the preset field in the basic header of the first service access request message and forwarding the deleted first service access request message to the target source station, so that the client initiating the service access request can timely obtain the corresponding service file.

Optionally, before forwarding the second service access request packet to the second node, the method further includes:

and the first node determines that the forwarding times of the service access request message are less than or equal to a preset threshold value.

In the above technical solution, in order to prevent the service access request packet from being continuously and circularly forwarded, a disaster recovery policy needs to be set, that is, if it is determined that the forwarding number of the service access request packet exceeds a certain value (that is, a preset threshold value), a source return policy is executed (that is, the service access request is forwarded to a target source station located outside the content distribution network, and a corresponding service file is queried through the target source station). Therefore, before generating the second service access request message and forwarding the second service access request message, it is necessary to determine whether the number of times of forwarding the service access request message at this time exceeds a preset threshold, if not, the second service access request message is generated and forwarded to the next hop node, and if so, a back-to-source policy is executed. Therefore, the processing efficiency of the service access request message can be improved, and the client side which initiates the service access request can obtain the corresponding service file in time, so that the user experience can be improved.

if the first node determines that a next hop node of the first node is a node located in the content distribution network, deleting the content added to a preset field in a basic header of the first service access request message when determining that the forwarding frequency of the service access request message is greater than the preset threshold, and forwarding the deleted first service access request message to the target source station; and the target source station is used for acquiring a corresponding service file according to the deleted first service access request message.

In the above technical solution, after receiving a first service access request message, if it is determined that a service file requested by a client is not queried, when the service access request needs to be forwarded to a next hop node, if it is determined that the forwarding number of the service access request message forwarded to the next hop node exceeds a certain value (i.e. a preset threshold), a source return policy is executed, that is, the service access request message from which the content added to a preset field in a basic header is deleted is forwarded to a target source station located outside a content distribution network, so as to query the service file requested by the client through the target source station.

In a second aspect, an embodiment of the present invention further provides a data processing apparatus based on a content distribution network, including:

the determining module is used for determining the node level of the first node based on the first service access request message; the first service access request message is used for indicating any client to acquire a service file provided by a target source station; the first node is any node located in the content distribution network;

a processing module for enabling a first service function configuration that matches a node hierarchy of the first node; the first node is pre-configured with a plurality of different levels of service function configurations; and processing the first service access request message by executing the first service function configuration.

Optionally, the processing module is further configured to:

after the first service access request message is processed by executing the first service function configuration, when the service file provided by the target source station is determined to be inquired, the service file is sent to the client based on the first service function configuration.

Optionally, the determining module is specifically configured to:

detecting the first service access request message, and determining whether the first service access request message carries a node level;

and if so, determining the node level carried in the first service access request message as the node level of the first node.

Optionally, the determining module is further configured to:

if the first service access request message does not carry a node level, determining that the node level of the first node is a 0 th level;

wherein the first node at level 0 is an edge node.

Optionally, the processing module is further configured to:

after the first service access request message is processed by executing the first service function configuration, when the service file provided by the target source station is determined not to be inquired, generating a second service access request message based on the first service access request message, and forwarding the second service access request message to the second node; the second node is a next hop node of the first node within the content distribution network.

Optionally, the processing module is specifically configured to:

adding service access request message forwarding times and the node type of the second node to a preset field in a basic header of the first service access request message to generate a second service access request message; the service access request message forwarding times are used for indicating the node level of the second node; the node hierarchy and the node type are used for indicating service function permission which the second node has; and the service function authority is used for indicating the service function configuration matched with the second node.

Optionally, the processing module is further configured to:

before generating the second service access request message, if it is determined that a next hop node of the first node is a target source station located outside the content distribution network, deleting content added to a preset field in a basic header of the first service access request message, and forwarding the deleted first service access request message to the target source station; and the target source station is used for acquiring a corresponding service file according to the deleted first service access request message.

Optionally, the processing module is further configured to:

before forwarding the second service access request message to the second node, determining that the forwarding times of the service access request message are less than or equal to a preset threshold value.

Optionally, the processing module is further configured to:

before generating the second service access request message, if it is determined that a next hop node of the first node is a node located in the content distribution network, deleting the content added to a preset field in a basic header of the first service access request message when it is determined that the forwarding frequency of the service access request message is greater than the preset threshold, and forwarding the deleted first service access request message to the target source station; and the target source station is used for acquiring a corresponding service file according to the deleted first service access request message.

In a third aspect, an embodiment of the present invention provides a computing device, including at least one processor and at least one memory, where the memory stores a computer program, and when the program is executed by the processor, the processor is caused to execute the data processing method based on the content distribution network according to any of the first aspect.

In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, which stores a computer program executable by a computing device, and when the program runs on the computing device, causes the computing device to execute the data processing method based on the content distribution network according to any one of the first aspect.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

FIG. 1 is a schematic diagram of a possible system architecture according to an embodiment of the present invention;

fig. 2 is a schematic flowchart of a data processing method based on a content distribution network according to an embodiment of the present invention;

fig. 3 is a schematic structural diagram of a data processing apparatus based on a content distribution network according to an embodiment of the present invention;

fig. 4 is a schematic structural diagram of a computing device according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present invention, not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

In the embodiments of the present invention, "at least one" means one or more, "a plurality" means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone, wherein A and B can be singular or plural. The character "is a relationship generally indicating that the former and latter associated objects are an" or ". "at least one of the following items or the like, refers to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or multiple.

And, unless stated to the contrary, the embodiments of the present invention refer to the ordinal numbers "first", "second", etc., for distinguishing a plurality of objects, and do not limit the sequence, timing, priority, or importance of the plurality of objects. For example, the first service access request message and the second service access request message are only used for distinguishing different service access request messages, and do not represent the difference of the priority or importance of the two service access request messages.

To facilitate understanding of the embodiments of the present invention, a data processing system architecture based on a content distribution network suitable for the embodiments of the present invention is first described by taking one possible system architecture shown in fig. 1 as an example. The possible system architecture may be applied to a data processing scenario between one client, a content delivery network (including a plurality of CDN nodes) and one source station, or may be applied to a data processing scenario between a plurality of clients, a content delivery network (including a plurality of CDN nodes) and a plurality of source stations, or may be applied to a data processing scenario between one client, a content delivery network (including a plurality of CDN nodes) and a plurality of source stations, and the like, which is not limited in this embodiment of the present invention. As shown in fig. 1, taking a plurality of clients, a content delivery network (including a plurality of CDN nodes) and a plurality of source stations as an example, the possible system architecture may include a plurality of clients (such as client 101, client 102, client 103, etc.), a plurality of CDN nodes (such as node 201, node 202, node 203, etc.), and a plurality of source stations (such as source station 301, source station 302, source station 303, etc.). The source station (for example, a server, etc.) and the CDN nodes may be in communication connection, each CDN node may be in communication connection, and the CDN nodes and the client may be in communication connection, for example, the CDN nodes may be connected in a wired network manner or in a wireless network manner, which is not limited in this embodiment of the present invention. It should be noted that any device capable of providing the relevant service file may be used as the source station, and any device or application software that needs to initiate a service access request may be used as the client. Exemplarily, taking the client 101 as an example, the client 101 sends a service access request message for a certain service file to the content distribution network, and when detecting the service access request message, the content distribution network allocates a CDN node logically close to the client 101 to receive the service access request message of the client 101, for example, if the node 201 is logically closest to the client 101, the node 201 is responsible for establishing a communication connection with the client 101 and receives the service access request message of the client 101 after the communication connection is successfully established, at this time, it is known that the node 201 is an edge node in a service access request path of the client 101, and a node level of the node 201 is a 0 th level and a service function configuration matching with the 0 th level will be validated. After receiving the service access request message, the node 201 queries whether a service file corresponding to the service access request message is stored locally, and if so, sends the service file corresponding to the service access request message to the client 101. If the information is not stored, the service access request message is forwarded to the next hop node, and if the next hop node is not the source station, the node 201 adds the node level (the number of times of forwarding the service access request message, the node type, and the like) of the next hop node to a preset field in the basic header of the service access request message, and then forwards the added service access request message to the next hop node (such as the node 202), so that the next hop node can timely take effect on the service function configuration matched with the node level in the service access request, and query the service file corresponding to the service access request message. If the next hop node is the source station, the node 201 directly forwards the service access request message to a target source station (such as the source station 301) that provides the service file corresponding to the service access request message.

It should be noted that the system architecture shown in fig. 1 is only an example, and the embodiment of the present invention is not limited thereto.

Based on the above description, fig. 2 exemplarily shows a flow of a data processing method based on a content distribution network according to an embodiment of the present invention, which can be executed by a data processing apparatus based on a content distribution network. The data processing method based on the content distribution network may be executed by a first node (such as a server or other electronic device with functions required for implementing the method) or may be executed by a functional component (such as a chip or an integrated circuit supporting the functions required for implementing the method by the first node) arranged in the first node. The following description will be given taking as an example a case where the first node executes a data processing method based on a content distribution network.

As shown in fig. 2, the process specifically includes:

step 201, a first node determines a node level of the first node based on a first service access request packet.

Step 202, the first node enables a first service function configuration matched with a node hierarchy of the first node.

In the embodiment of the invention, the first service access request message is used for indicating any client to acquire a service file provided by a target source station; the first node is any node located within the content distribution network. Specifically, since the technical solution of the embodiment of the present invention is to define the node hierarchy and the node type from the software dimension, that is, to strip the node hierarchy definition, the node type definition from the hardware device, and not to directly and statically distinguish and plan different node hierarchies from the hardware dimension, so as to break the node hierarchy and node type constraints on the hardware, thereby implementing the flexibility of the node hierarchy and node type of the node, and thus implementing the effective multiplexing of the node, each node does not know what node type and node hierarchy it belongs to before receiving the service access request packet, and then the first node needs to perform corresponding identification processing on the service access request packet after receiving the first service access request packet, for example, it can perform detection on the first service access request packet, for example, content detection is performed on the first service access request packet, so as to detect whether the first service access request packet carries a node level (that is, whether the first service access request packet carries the number of times of forwarding the service access request packet), or the first service access request packet may be analyzed, and whether the analyzed first service access request packet carries a node level is determined. If the node hierarchy is carried, it can be determined that the node hierarchy is the node hierarchy of the first node, which, as can be appreciated, the first node can timely know which hierarchy the first node is specifically positioned in the current service access request path of the client through the node hierarchy carried in the first service access request message, since different node levels correspond to different service function configurations, i.e., different node levels correspond to different service function permissions, e.g., for the same node, the node hierarchy of the node under different scenes is different, and the service function authority that is validated is also different, so that the first node can validate (or enable) the service function configuration matched with the node hierarchy of the first node in time, therefore, corresponding processing can be accurately carried out on the first service access request message through the service function configuration. If the node hierarchy is not carried (i.e., the node hierarchy does not carry the number of forwarding service access request packets, i.e., indicates that the number of forwarding service access request packets is 0), it may be determined that the current node type of the first node is an edge node, and it may be determined that the current node hierarchy of the first node is a 0 th hierarchy, and the service function configuration that is validated (or enabled) by the first node is matched with the 0 th hierarchy.

Exemplarily, taking a node a as an example, after receiving a service access request message, the node a performs parsing on the service access request message, and determines whether the parsed service access request message carries node level data (i.e., the number of times of forwarding the service access request message), if the parsed service access request message does not carry the node level data, it indicates that the node a is used as an edge node to receive a service access request message sent by a certain client, and the node level of the node a in the current service access request is the 0 th level, and what the node a takes effect is a service function authority matched with the 0 th level. If the node hierarchy data is carried, it is indicated that the node a serves as a parent node to receive a service access request message forwarded by a previous node, for example, the previous node is an edge node, the node a serves as the parent node in the current service access request, and at the same time, it is known that the node hierarchy of the node a is the 1 st hierarchy through the service access request message forwarded by the previous node, and the node a takes effect as a service function authority matched with the 1 st hierarchy, and if the previous node is the parent node belonging to the 1 st hierarchy, the node a also serves as the parent node in the current service access request, and at the same time, it is known that the node hierarchy of the node a is the 2 nd hierarchy through the service access request message forwarded by the previous node, and the node a takes effect as the service function authority matched with the 2 nd hierarchy. Therefore, for the node A, the node levels under different scenes are different, and the corresponding service function authorities are also different, so that the node levels of the nodes are not fixed and definite any more, but dynamically changed according to the actual application scene.

In addition, in the content distribution network, each node is preconfigured with a plurality of service function configurations (such as an inquiry function, a control function, or a service processing timeout function (i.e., a request response timeout function), etc.) at different node levels, each service function configuration has its own specific validation range, that is, each service function configuration has a corresponding service function authority, each node validates different service function authorities at different node levels, for example, a first node, and when a node level belongs to a 0 th level, the executed node is a service function logic possessed by the node at the 0 th level, and the service function logic is a service processing logic under the service function authority exclusive to the node at the 0 th level. For example, continuing to take the node a as an example, and taking the service function configured as the service processing timeout function as an example, the service processing timeout time (i.e., the service processing response time) set by the node a when the node a belongs to the 0 th level is T1 (e.g., 10s), and the service processing timeout time set when the node a belongs to the 1 st level is T2 (e.g., 6 s).

It should be noted that, when a service access request generated by a client is sent to a CDN node of a content delivery network, a user may obtain a service file provided by a certain source station through the CDN node in the content delivery network based on the client installed on a certain terminal (e.g., a smart phone, a tablet computer, a desktop computer, or a laptop computer). After a client generates a service access request for a certain service file, the service access request is firstly sent to a server, so that the server schedules a CDN node which is logically close to a terminal where the client is located for the client, and the service access request is received through the CDN node, so that the query for the service file is realized.

Step 203, the first node processes the first service access request packet by executing the first service function configuration.

In the embodiment of the present invention, the first node performs corresponding processing on the service access request packet by enabling the service function permission matched with the node hierarchy of the first node, that is, by executing the service function logic belonging to the node hierarchy.

Specifically, if the first node queries a service file provided by a target source station requested by the client in the process of executing the service function logic belonging to the node hierarchy (i.e., the service function configuration belonging to the node hierarchy), the service file may be accurately transmitted to the client through a request path of the service file based on the service function logic, so that the client can obtain the service file in time. If the service file provided by the target source station requested by the client is not queried, the service access request message needs to be forwarded to the next-hop node, that is, a second service access request message is generated based on the first service access request message, and the second service access request message is forwarded to the second node, so that the service file requested by the client can be queried by enabling the service function configuration matched with the node hierarchy of the second node through the second node. The second node is a next hop node of the first node in the content distribution network. The first node generates a second service access request message by adding the service access request message forwarding times and the node type of the second node in a preset field in a basic header of the first service access request message. The service access request message forwarding times are used for indicating the node level of the second node; the node hierarchy and the node type are used for indicating the service function authority of the second node; the service function permission is used for indicating the service function configuration matched with the second node. Then, after receiving the second service access request message, the second node can detect the second service access request message, and timely learn what kind of hierarchy the second node is specifically located in the current service access request and whether the second node is a parent node or an edge node, and after learning the corresponding information, can take effect on the service function configuration matched with the second node.

If the first node is a father node belonging to a certain node level, before the first node generates a second service access request message, if it is determined that a service file requested by a client is not inquired, when the service access request needs to be forwarded to a next hop node, if it is determined that the next hop node is a target source station located outside a content distribution network, at this time, the second service access request message does not need to be generated, the content added to a preset field in a basic header of the first service access request message needs to be deleted, and the deleted first service access request message is forwarded to the target source station, so that the target source station inquires a corresponding service file through the deleted first service access request message. Or, if the first node is an edge node, before the first node generates the second service access request packet, if it is determined that the service file requested by the client is not queried, when the service access request needs to be forwarded to the next-hop node, if it is determined that the next-hop node is a target source station located outside the content distribution network, at this time, the first service access request packet (at this time, the first service access request packet is sent from the client, and is not added for a preset field in a basic header of the first service access request packet) may be directly forwarded to the target source station, so that the target source station queries the corresponding service file through the first service access request packet. In addition, in order to prevent the service access request message from being continuously and endlessly forwarded in a cyclic manner, a disaster recovery policy is further set, that is, before the first node generates the second service access request message, the number of times of forwarding the current specific service access request message can be known by detecting the first service access request message, so that the number of times of forwarding the service access request message, which needs to be added to a preset field in the basic header of the first service access request message, can be known when the first node needs to forward the first service access request message to the next hop node. Specifically, if it is determined that the next hop node is a node located in the content distribution network, it is determined whether the number of times of forwarding the service access request packet forwarded to the next hop node exceeds a certain value (i.e., it is determined whether the number of times of forwarding the service access request packet is greater than a preset threshold), and if the number of times of forwarding the service access request packet forwarded to the next hop node exceeds a certain value, a source return policy is executed, that is, content added to a preset field in a basic header of the first service access request packet is deleted, and the deleted first service access request packet is forwarded to a target source station located outside the content distribution network, so that the target source station queries a corresponding service file through the deleted first service access request packet. If the forwarding number of the service access request message forwarded to the next hop node does not exceed a certain value (that is, it is determined that the forwarding number of the service access request message is less than or equal to the preset threshold), the second service access request message needs to be generated by adding the forwarding number of the service access request message and the node type of the second node in a preset field in the basic header of the first service access request message. In the content distribution network, the service access request message is forwarded once between each node, the cumulative number of times of forwarding the service access request message is added by 1, for example, when the edge node receives the service access request message sent by the client, the number of times of forwarding the service access request message is 0, that is, the edge node is a node belonging to the 0 th level; when an edge node needs to forward the service access request message to a next-hop node (i.e., a layer of parent node), adding the forwarding number 1 of the service access request message to a preset field in a basic header of the service access request message, that is, indicating that the next-hop node is a node belonging to the level 1, and adding a node type (i.e., a parent node) to a preset field in the basic header of the service access request message; if the next-hop node also needs to forward the service access request message to another next-hop node (i.e., a two-layer parent node), the other next-hop node needs to update the forwarding number 1 of the service access request message added by the preset field in the basic header of the service access request message to the forwarding number 2, that is, it indicates that the other next-hop node belongs to the level 2 node, and meanwhile, because the node type of the other next-hop node is also the parent node, the node type in the preset field in the basic header of the service access request message does not need to be updated. In addition, if a node needs to forward the service access request packet to a source station located outside the content distribution network, the number of times of forwarding to the source station is not counted, that is, the forwarding between the node and the source station is not counted.

Illustratively, continuing to take the node a as an example, and taking the service function configured as a service processing timeout function as an example, different node levels correspond to different service processing timeout times (i.e. it represents the longest time for a node belonging to a certain node level to be allowed to wait for a next hop node to respond to a service access request message), that is, different node levels correspond to different service processing timeout permissions, for example, for the same node, the service processing timeout time of the node belonging to the 0 th level at the node level is different from the service processing timeout time of the node belonging to the 1 st level at the node level, and assuming that the node level of the node a is the 0 th level, the node a takes effect as the service processing timeout permission belonging to the 0 th level, that is, the service processing timeout time of the node a at the 0 th level is T1. Assuming that a client needs to request a service file, a service access request message for acquiring the service file is generated, and the service access request message is sent to a node (such as node a) logically close to the client, then when receiving the service access request message sent by the client, the node a performs detection on the service access request message, so that it can know that its node level belongs to the 0 th level, and determine that its node type is an edge node, so that the node a takes effect as a service processing timeout authority matching with the 0 th level, that is, the service processing timeout time for the node a at the 0 th level is T1, that is, if the node a needs to forward the service access request message to a next hop node (such as node B), the node a needs to wait for the node B to respond to the service access request message for a maximum time of T1, if the time waiting for the response exceeds T1, the request fails, and node a feeds back response timeout information to the client. Or, assuming that the node level of the node a is the 1 st level, the node a takes effect as the service processing timeout permission belonging to the 1 st level, that is, the service processing timeout time of the node a at the 1 st level is T2, when receiving the service access request message forwarded by the previous node, the node a detects the forwarded service access request message, so as to know that the node level of the node a belongs to the 1 st level and determine that the node type of the node a is the parent node, and thus the node a takes effect as the service processing timeout permission matching with the 1 st level, that is, the service processing timeout time of the node a at the 1 st level is T2, that is, if the node a needs to forward the service access request message to the next hop node (such as node C), the node a needs to wait for the maximum time of the node C responding to the service access request message to be T2, if the time waiting for the response exceeds T2, the request fails, and node a feeds back response timeout information to the previous hop node. Wherein T2 is less than T1. For example, a service access request packet acquires a service file through two nodes in a content distribution network, for example, the two nodes are a node a and a node B, assuming that the node a is an edge node and the node B is a layer of parent node, for a service processing timeout function, the node a takes effect as a service processing timeout permission matched with the 0 th level, for example, the service processing timeout time of the node a is 10s, that is, the maximum time that the node a needs to wait for a response of the node B to the service access request packet is 10s, and if the time for waiting for the response exceeds 10s, the request fails. In addition, assuming that the node a is an edge node, if the node a needs to forward the service access request message to a target source station (such as a source station a) located outside the content distribution network, at this time, a new service access request message does not need to be generated, the node a may directly forward the service access request message to the source station a, so that the source station a queries a corresponding service file through the service access request message; or, assuming that the node a is a parent node belonging to the level 1, if the node a needs to forward the service access request packet to a target source station (for example, a source station a) located outside the content distribution network, it needs to delete the content added to the preset field in the basic header of the received service access request packet, and forward the deleted service access request packet to the source station a, so that the source station a queries a corresponding service file through the deleted service access request packet. And if it is determined that the next hop node is a node located in the content distribution network, determining whether the number of forwarding times of the service access request packet forwarded to the next hop node exceeds a certain value (for example, 3), assuming that the number of forwarding times of the service access request packet that the node a needs to add to a preset field in a basic header of the service access request packet is 2, and if so, 2 is less than 3, at this time, a new service access request packet may be generated by performing corresponding change on the service access request packet, and the new service access request packet is forwarded to the next hop node (for example, the node B), so that the node B performs corresponding query on the service file requested by the client using the valid query function range. Or, assuming that the number of times that the node a needs to forward the service access request packet added to the preset field in the basic header of the service access request packet is 4, if 4 is greater than 3, then a source return policy is executed, that is, the content added to the preset field in the basic header of the service access request packet is deleted, and the deleted service access request packet is forwarded to the source station a located outside the content distribution network, so that the source station a queries the corresponding service file through the deleted service access request packet. After inquiring the service file requested by the client, the service file can be accurately transmitted to the client through the request path of the service file.

The above embodiments show that, in the prior art, different node hierarchies of each node are statically distinguished and planned directly from hardware dimensions, so that the node hierarchies of each node are clear and fixed, and therefore, the nodes of different node hierarchies cannot be used in a mixed manner. Moreover, since the nodes of different node levels cannot be used in a mixed manner, when the amount of service access requests increases, redundancy planning needs to be performed on each node, which results in resource waste. Based on this, the technical scheme in the invention is that node hierarchy definition, node type definition and hardware equipment (namely nodes) are separated from software dimension, and different node hierarchies and different node types are not required to be statically distinguished and planned directly from hardware dimension, so that the node hierarchy and the node types of the nodes are dynamically defined, thereby breaking the constraint of the node hierarchy and the node types on hardware, being beneficial to dynamically controlling or adjusting any node to take effect on different node hierarchies and node types, effectively improving the flexibility of defining the node hierarchy and the node types of the nodes, and further realizing the effective multiplexing of the nodes. Specifically, for any node (i.e., a first node) located in the content distribution network, when the first node detects a first service access request packet, the first node may accurately know the node hierarchy of the first node through the first service access request packet, where the first service access request packet is used to instruct any client to acquire a service file provided by a target source station, and at the same time, determine, from a plurality of service function configurations belonging to different hierarchies, a first service function configuration that matches the node hierarchy of the first node, that is, the node hierarchy of the node is no longer statically fixed, so that the node has different node hierarchies (for example, one node may be an edge node, or a parent node of a certain hierarchy, such as a parent node of a layer or a parent node of two layers) in different scenarios, and generates service function configurations corresponding to different node hierarchies, therefore, the effective multiplexing of the nodes is realized, and the nodes do not need to carry out redundancy planning, thereby effectively avoiding resource waste. And then, the first service access request message can be processed by executing the first service function configuration, so that the service file provided by the target source station corresponding to the first service request message can be effectively inquired in time. Therefore, according to the scheme, the node levels of all the nodes are dynamically defined from the software dimension, so that the nodes take effect in different node levels under different scenes, the node levels of the nodes are not statically fixed, the flexibility of the node levels of the nodes is increased, the nodes can flexibly and dynamically take effect according to the current scenes, the service function configuration which is more consistent with the current scenes can be realized, the effective multiplexing of the nodes can be realized, and the condition that resources are wasted due to the fact that all the nodes need redundant planning can be effectively avoided.

Based on the same technical concept, fig. 3 exemplarily shows a data processing apparatus based on a content distribution network, which can execute a flow of a data processing method based on a content distribution network according to an embodiment of the present invention. The data processing device based on the content distribution network may be a first node (such as a server or other electronic equipment with functions required for implementing the method) or may be a functional component (such as a chip or an integrated circuit supporting the functions required for implementing the method by the first node) arranged in the first node.

As shown in fig. 3, the apparatus includes:

a determining module 301, configured to determine a node level of a first node based on a first service access request packet; the first service access request message is used for indicating any client to acquire a service file provided by a target source station; the first node is any node located in the content distribution network;

a processing module 302, configured to enable a first service function configuration matched with a node hierarchy of the first node; the first node is pre-configured with a plurality of different levels of service function configurations; and processing the first service access request message by executing the first service function configuration.

Optionally, the processing module 302 is further configured to:

Optionally, the determining module 301 is specifically configured to:

Optionally, the determining module 301 is further configured to:

wherein the first node at level 0 is an edge node.

Optionally, the processing module 302 is further configured to:

Optionally, the processing module 302 is specifically configured to:

Optionally, the processing module 302 is further configured to:

Based on the same technical concept, an embodiment of the present invention further provides a computing device, as shown in fig. 4, including at least one processor 401 and a memory 402 connected to the at least one processor, where a specific connection medium between the processor 401 and the memory 402 is not limited in the embodiment of the present invention, and the processor 401 and the memory 402 are connected through a bus in fig. 4 as an example. The bus may be divided into an address bus, a data bus, a control bus, etc.

In the embodiment of the present invention, the memory 402 stores instructions executable by the at least one processor 401, and the at least one processor 401 may execute the steps included in the data processing method based on the content distribution network by executing the instructions stored in the memory 402.

The processor 401 is a control center of the computing device, and may be connected to various parts of the computing device through various interfaces and lines, and may perform data processing by executing or executing instructions stored in the memory 402 and calling data stored in the memory 402. Optionally, the processor 401 may include one or more processing units, and the processor 401 may integrate an application processor and a modem processor, where the application processor mainly processes an operating system, a user interface, an application program, and the like, and the modem processor mainly processes an issued instruction. It will be appreciated that the modem processor described above may not be integrated into the processor 401. In some embodiments, processor 401 and memory 402 may be implemented on the same chip, or in some embodiments, they may be implemented separately on separate chips.

The processor 401 may be a general-purpose processor, such as a Central Processing Unit (CPU), a digital signal processor, an Application Specific Integrated Circuit (ASIC), a field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof, configured to implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present invention. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the disclosed method in connection with the data processing method embodiments based on the content distribution network may be directly embodied as hardware processor, or may be implemented by a combination of hardware and software modules in the processor.

The memory 402, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The Memory 402 may include at least one type of storage medium, and may include, for example, a flash Memory, a hard disk, a multimedia card, a card-type Memory, a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Programmable Read Only Memory (PROM), a Read Only Memory (ROM), a charge Erasable Programmable Read Only Memory (EEPROM), a magnetic Memory, a magnetic disk, an optical disk, and so on. The memory 402 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory 402 of embodiments of the present invention may also be circuitry or any other device capable of performing a storage function to store program instructions and/or data.

Based on the same technical concept, embodiments of the present invention also provide a computer-readable storage medium storing a computer program executable by a computing device, wherein the program, when executed on the computing device, causes the computing device to execute the steps of the data processing method based on the content distribution network.

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable 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 invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to the invention. 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.

While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims

1. A data processing method based on a content distribution network, comprising:

the first node enables a first service function configuration matched with a node hierarchy of the first node; the first node is pre-configured with a plurality of different levels of service function configurations;

2. The method of claim 1, wherein after processing the first service access request message by performing the first service function configuration, further comprising:

3. The method of claim 1, wherein the first node determining the node hierarchy of the first node based on a first service access request message comprises:

the first node detects the first service access request message and determines whether the first service access request message carries a node level or not;

4. The method of claim 3, further comprising:

wherein the first node at level 0 is an edge node.

5. The method of claim 1, wherein after processing the first service access request message by performing the first service function configuration, further comprising:

6. The method of claim 5, wherein generating a second service access request message based on the first service access request message comprises:

7. The method of claim 6, prior to generating the second service access request message, further comprising:

8. The method of claim 5, wherein prior to forwarding the second service access request packet to the second node, further comprising:

9. The method of claim 8, prior to generating the second service access request message, further comprising:

if the first node determines that a next hop node of the first node is a node located in the content distribution network, deleting the content added to a preset field in a basic header of the first service access request message when determining that the forwarding times of the service access request message are greater than the preset threshold value, and forwarding the deleted first service access request message to the target source station; and the target source station is used for acquiring a corresponding service file according to the deleted first service access request message.

10. A data processing apparatus based on a content distribution network, comprising:

11. A computing device comprising at least one processor and at least one memory, wherein the memory stores a computer program that, when executed by the processor, causes the processor to perform the method of any of claims 1 to 9.

12. A computer-readable storage medium, storing a computer program executable by a computing device, the program, when run on the computing device, causing the computing device to perform the method of any of claims 1 to 9.