CN114553727B

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

Info

Publication number: CN114553727B
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: 2024-08-09
Anticipated expiration: 2042-02-18
Also published as: CN114553727A

Abstract

The embodiment of the invention provides a data processing method and a data processing 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 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 statically fixed any more, so that the first service access request message is processed by executing the first service function configuration under different scenes of the node. Therefore, the scheme dynamically defines the node hierarchy of each node from the software dimension, so that the nodes can take effect in different node hierarchies under different scenes, the flexible effect of each node according to the current scene is realized, the service function configuration of the current scene is more accordant, the effective multiplexing of the nodes is realized, and the condition that resources are wasted due to the fact that each node needs redundant 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 join in the CDN (Content Delivery Network ) industry, competition is becoming more and more intense, cost optimization has become an important indicator for each large CDN manufacturer in order to better occupy the market, and thus, it is necessary to make maximum use of existing resources. Meanwhile, as more and more businesses have periodical expansion, enough redundant resources have to be prepared in advance, the CDN under the background of cost priority is definitely frosted on snow, and the resource allocation period is long, so that the cost of resources and the cost of manpower are both great overheads.

The existing hierarchical resource management scheme based on the content distribution network is as follows: within the content delivery network, the planning is directly differentiated from hardware dimensions into different hierarchical types (i.e., resource hierarchy and resource type) according to different stages of business processing, namely edge resources (i.e., edge nodes), one-level parent resources (i.e., one-level parent nodes), and two-level parent resources (i.e., two-level parent nodes), but the hierarchical types are fixed, and once the planning is completed, each resource has an explicit hierarchical type. In the content distribution network, all application layer data are processed according to the flow of client side- > edge resource- > father resource (multi-level) - > source station. Furthermore, because the functional services required for the resources of the different hierarchical types are different, different functional configurations may be deployed for the resources of the different hierarchical types. However, the hierarchical resource management scheme directly performs static planning on the hierarchical type of the resource (i.e. node) from the perspective of hardware resource, and deploys differentiated functional configuration for the resource of different hierarchical types, so that the resource of different hierarchical types cannot be used. Moreover, since the resources of different hierarchy types cannot be mixed, the resources of different hierarchy types respectively need respective redundancy plans, thereby causing resource waste.

In summary, a data processing method based on a content distribution network is needed at present, so as to effectively avoid resource waste caused by redundant planning required by 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 condition that resources are wasted due to the fact that each node needs redundant planning.

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

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; 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 positioned in the content distribution network;

The first node enables a first service function configuration matched with a node hierarchy of the first node; the first node is preconfigured with a plurality of service function configurations of different levels;

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

In the above technical solution, since the prior art solution directly performs static distinction between different node levels of each node from the hardware dimension, the node level of each node is clear and fixed, so that each node of different node levels is not miscible. Moreover, since the nodes of different node levels cannot be mixed, when the service access request amount increases, redundant planning needs to be performed for each node, so that resource waste is also caused. Based on the method, the technical scheme of the invention defines the node level and the node type from the software dimension, namely, the node level definition and the node type definition are stripped from the hardware equipment (namely, the node) and the node type definition are not directly and statically distinguished and planned from the hardware dimension, so that the node level and the node type of the node are dynamically defined, constraint of the node level and the node type on the hardware can be broken, dynamic control or adjustment of any node to take effect on different node levels and node types can be realized, and the flexibility of the node level and the node type of the defined node can be effectively improved, so that the effective multiplexing of the node can be realized. Specifically, for any node (i.e., a first node) located in the content distribution network, when detecting a first service access request message, the first node can accurately acquire a node level of the first node through the first service access request message, where the first service access request message is used to instruct any client to acquire a service file provided by a target source station, and determine a first service function configuration matched with the node level of the first node from multiple service function configurations belonging to different levels, that is, the node level of the node is not statically fixed any more, so that the node has different node levels (for example, one node can be used as an edge node or a parent node of a certain level, for example, a parent node of a layer of a parent node or two layers of parent nodes) and respective corresponding service function configurations of different node levels are validated, thereby realizing effective multiplexing of the node, and certainly, each node does not need to perform redundancy planning, so as to effectively avoid resource waste. And then the first service function configuration is executed to process the first service access request message, so that the service file provided by the target source station corresponding to the first service request message can be effectively queried in time. Therefore, the scheme dynamically defines the node levels of the nodes from the software dimension so as to enable the nodes to take effect of different node levels under different scenes instead of statically fixing the node levels of the nodes, so that flexibility of the node levels of the nodes is increased, flexible dynamic effect of the nodes according to own current scenes can be achieved, service function configuration which is more in line with the current scenes can be achieved, effective multiplexing of the nodes can be achieved, and resource waste caused by redundancy planning of the nodes can be effectively avoided.

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

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

According to the technical scheme, after the first node inquires the service file requested by a certain client, the service file can be accurately transmitted to the client through the request path of the service file, so that the client can acquire the service file in time.

Optionally, the determining, by the first node, a node level 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 or not;

if yes, 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 the first service access request packet, the first node may perform content detection or parse for the first service access request packet, so as to determine whether the first service access request packet carries a node level, if so, the first node may timely learn which level is specifically in the current service access request path, because different node levels correspond to different service function configurations, that is, different node levels correspond to different service function rights, the first node may timely take effect of the service function configuration matched with the node level of the first node, so that corresponding processing can be performed on the first service access request packet accurately 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 the 0 th level;

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

In the above technical solution, when a service access request message sent by a certain client for a certain service file is detected, a node logically close to the client may be allocated from nodes located in the content distribution network as a node for receiving the service access request message, so that the service access request message received by the node logically close to the client does not carry a node hierarchy, that is, the node logically close to the client belongs to the 0 th hierarchy, and meanwhile, it may be determined that the node logically close to the client is used as an edge node in the service access request, and then the node logically close to the client takes effect as a service function configuration matched with the 0 th hierarchy, so that corresponding processing may be performed on the first service access request message through the service function configuration matched with the 0 th hierarchy. Wherein a node logically close to the client is an edge node in the current service access request, but may be 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 queried, 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 located within the content distribution network.

In the above technical solution, when the first node does not query the service file requested by the client locally, the first node forwards the service access request to the next hop node, that is, performs a certain process on the first service access request message, so as to generate a second service access request message 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. The second node is used as a father node in the 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 service access request message forwarding times and node types of the second node to a preset field in a basic head 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 level and the node type are used for indicating the service function authority of the second node; the service function authority is used for indicating 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 times of forwarding 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 in a preset field in the basic header of the first service access request message, so as to generate a second service access request message, when the next-hop node receives the second service access request message, the next-hop node can timely acquire, through the second service access request message, which level is specifically in the current service access request path and whether the next-hop node is used as a father node or an edge node, and after acquiring corresponding information, the service function configuration matched with the next-hop node can be validated, so that the node can flexibly validate the service function configuration more conforming to the current scene according to the current scene, thereby realizing the effective multiplexing of the node. The service access request message forwarding times are set to realize a certain fault tolerance for forwarding the service access request message, that is, it can be understood that if the service access request message forwarding times exceed a certain value, a source returning strategy can be executed (that is, the service access request message is forwarded to a target source station outside the 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 positioned outside the content distribution network, deleting the content added by a 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; the target source station is used for acquiring the 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, then it is not necessary to generate the second service access request message, but the content added by the preset field in the basic header of the first service access request message is deleted, and the deleted first service access request message is forwarded to the target source station, so that the target source station queries the corresponding service file through the deleted first service access request message, thereby enabling the client that initiates the service access request to timely acquire 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 smaller than or equal to a preset threshold value.

In the above technical solution, in order to prevent the service access request message 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 service access request messages exceeds a certain value (i.e., a preset threshold), a source-back policy is executed (i.e., 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 needs to determine whether the forwarding frequency of the service access request message exceeds a preset threshold, if not, generating the second service access request message and forwarding the second service access request message to the next hop node, and if yes, executing the source-returning strategy. Therefore, the processing efficiency of the service access request message can be improved, and the client side which is convenient for initiating the service access request can timely acquire the corresponding service file, so that the user experience can be improved.

If the first node determines that the next hop node of the first node is a node located in the content distribution network, deleting content added by 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 is greater than the preset threshold, and forwarding the deleted first service access request message to the target source station; the target source station is used for acquiring the corresponding service file according to the deleted first service access request message.

In the above technical solution, after receiving the first service access request packet, if it is determined that the service file requested by the client is not queried, when it is required to forward the service access request to the next hop node, if it is determined that the number of times of forwarding the service access request packet forwarded to the next hop node exceeds a certain value (i.e., a preset threshold), a source returning policy is executed, that is, the service access request packet after deleting the content added in the preset field in the basic header is forwarded to a target source station located outside the content distribution network, so that the service file requested by the client is queried by 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 positioned in the content distribution network;

A processing module, configured to enable a first service function configuration matched with a node hierarchy of the first node; the first node is preconfigured with a plurality of service function configurations of different levels; 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 or not;

if yes, 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 the 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 queried, 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 located within the content distribution network.

Optionally, the processing module is specifically configured to:

Adding service access request message forwarding times and node types of the second node to a preset field in a basic head 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 level and the node type are used for indicating the service function authority of the second node; the service function authority is used for indicating service function configuration matched with the second node.

Optionally, the processing module is further configured to:

Before the second service access request message is generated, if the next hop node of the first node is determined to be a target source station positioned outside the content distribution network, deleting the content added by a 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; the target source station is used for acquiring the 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 smaller 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 the next hop node of the first node is determined to be a node located in the content distribution network, deleting the content added by a preset field in the basic header of the first service access request message when the service access request message forwarding times are determined to be greater than the preset threshold, and forwarding the deleted first service access request message to the target source station; the target source station is used for acquiring the 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 that, when executed by the processor, causes the processor to perform the content distribution network-based data processing method of any of the first aspects described above.

In a fourth aspect, an embodiment of the present invention provides 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 content distribution network based data processing method of any of the first aspects described above.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

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

Fig. 2 is a schematic flow chart 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 device 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 more apparent, the present invention will be described in further detail below with reference to the accompanying drawings, and it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.

In the embodiments of the present invention, "at least one" means one or more, and "a plurality" means two or more. "and/or", describes an association relationship of an association object, and indicates that there may be three relationships, for example, a and/or B, and may indicate: a alone, a and B together, and B alone, wherein a, B may be singular or plural. The character "may be a relationship that generally indicates that the front and rear associated objects are an" or ". "under at least one item(s) or the like, refers to any combination of these items, including any combination of single item(s) or plural items(s). 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 plural.

And, unless specified to the contrary, references to "first," "second," etc. ordinal words of embodiments of the present invention are used for distinguishing between multiple objects and are not used for limiting the order, timing, priority, or importance of the multiple objects. For example, the first service access request message and the second service access request message are only for distinguishing different service access request messages, and are not meant to indicate the difference of priority, importance, etc. of the two service access request messages.

To facilitate an understanding of embodiments of the present invention, a data processing system architecture based on a content distribution network suitable for use with embodiments of the present invention is first described with respect to one possible system architecture shown in FIG. 1. The possible system architecture may be applied to a data processing scenario between one client, a content distribution 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 distribution network (including a plurality of CDN nodes), and a plurality of source stations, or may be applied to a data processing scenario between a client, a content distribution network (including a plurality of CDN nodes), and a plurality of source stations, etc., which is not limited in this embodiment of the present invention. As shown in fig. 1, which is described by way of example with respect to multiple clients, a content delivery network (including multiple CDN nodes), and multiple source stations, the possible system architecture may include multiple clients (e.g., client 101, client 102, client 103, etc.), multiple CDN nodes (e.g., node 201, node 202, node 203, etc.), and multiple source stations (e.g., source station 301, source station 302, source station 303, etc.). The source station (such as a server and the like) and the CDN nodes may be in communication connection, and each CDN node may be in communication connection with the client, for example, may be connected by a wired network manner or may be connected by a wireless network manner, which is not limited in the embodiment of the present invention. The source station may be any device that can provide a relevant service file, and the client may be any device, application software, or the like that needs to initiate a service access request. Taking the client 101 as an example, the client 101 sends a service access request message for a certain service file to the content delivery network, when the content delivery network detects the service access request message, a CDN node logically close to the client 101 is allocated to the client 101 to receive the service access request message of the client 101, for example, 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 established successfully, at this time, the node 201 is known to be an edge node in the service access request path of the client 101, the node level of the node 201 is level 0 and will take effect of the service function configuration matching level 0. 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 service access request message is not stored, the service access request message is forwarded to the next-hop node, if the next-hop node is not a source station, the node 201 adds a node level (the service access request message forwarding times and the node type, etc.) of the next-hop node in a preset field in a 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 of service function configuration matched with the node level in the service access request message, thereby querying a service file corresponding to the service access request message. if the next hop node is the source station, node 201 directly forwards the service access request message to the destination source station (e.g., 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 merely an example, and the embodiment of the present invention is not limited thereto.

Based on the above description, fig. 2 exemplarily illustrates a flow of a data processing method based on a content distribution network provided by an embodiment of the present invention, which may be performed 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 the first node (such as a server or other electronic device having functions required for implementing the method), or may be executed by a functional unit (such as a chip or an integrated circuit supporting the functions required for implementing the method by the first node) provided in the first node. The following describes an example of a data processing method performed by the first node based on the content distribution network.

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

step 201, a first node determines a node hierarchy of the first node based on a first service access request message.

Step 202, the first node enables a first service function configuration matching 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 the service file provided by the target source station; the first node is any node located within the content distribution network. Specifically, the technical solution of the embodiment of the present invention defines a node level and a node type from a software dimension, that is, the node level definition and the node type definition are stripped from a hardware device, and different node levels are not statically planned from the hardware dimension, so as to break the constraint of the node level and the node type on the hardware device, thereby realizing the flexibility of the node level and the node type of the node, so that the effective multiplexing of the node can be realized, each node does not know what node type the node specifically belongs to and what node level the node type belongs to before receiving a service access request message, and then the first node needs to perform corresponding identification processing for the service access request message after receiving the first service access request message, for example, can detect the first service access request message, for example, perform content detection for the first service access request message, so as to detect whether the first service access request message carries a node level (i.e. whether the service access request message is carried with the number of forwarding times), or can parse for the first service access request message, and determine whether the first service access request message carries the service access request message after parsing. If the node hierarchy is carried, the node hierarchy is determined to be the node hierarchy of the first node, and it can be understood that the first node can timely learn, through the node hierarchy carried in the first service access request packet, which hierarchy is specifically located in the current service access request path of the client, because different node hierarchies correspond to different service function configurations, that is, different node hierarchies correspond to different service function authorities, for example, for the same node, the node hierarchies of the node in different scenes are different, and the validated service function authorities are also different, so that the first node can timely take effect (or enable) the service function configuration matched with the node hierarchy of the first node, thereby accurately performing corresponding processing on the first service access request packet through the service function configuration. If the node level is not carried (i.e. the number of times of forwarding the service access request message is not carried, that is, the number of times of forwarding the service access request message is indicated as 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 level of the first node is the 0 th level, and the service function configuration that is matched with the 0 th level is validated (or enabled) by the first node.

Taking a node a as an example, after receiving a service access request message, the node a analyzes the service access request message, determines whether the analyzed service access request message carries node level data (i.e. the service access request message forwarding times), if not, the node a is used as an edge node to receive the service access request message sent by a certain client, and the node level of the node a in the service access request is the 0 th level, then the node a takes effect as the service function authority matched with the 0 th level. If the node level data is carried, the node A is used as a father 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 is used as the father node in the service access request, meanwhile, the node level of the node A is known to be the 1 st level through the service access request message forwarded by the previous node, the node A is validated to be the service function authority matched with the 1 st level, if the previous node is the father node belonging to the 1 st level, the node A is also used as the father node in the service access request, meanwhile, the node level of the node A is known to be the 2 nd level through the service access request message forwarded by the previous node, and the node A is validated to be the service function matched with the 2 nd level. In this way, for the node a, the node levels of the nodes are different in different scenes, so that the corresponding service function authorities are also different, and the node levels of the nodes are not fixed and clear any more and are 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 a query function, a control function or a service processing timeout function (i.e. a request response timeout function)) of different node levels, each service function configuration has its own specific effective range, that is, each service function configuration has corresponding service function authority, each node takes effect of different service function authorities, such as a first node, in different node levels, when the node level belongs to the 0 th level, what is executed is service function logic of the node of the 0 th level, that is, service processing logic under the exclusive service function authority of the node of the 0 th level. For example, continuing to take node a as an example and taking the service function configuration as a service processing timeout function as an example, the service processing timeout time (i.e., service processing response time) set by the node a when belonging to level 0 is T1 (e.g., 10 s), and the service processing timeout time set by the node a when belonging to level 1 is T2 (e.g., 6 s).

It should be noted that, when the service access request generated by the client is sent to the CDN node of the content delivery network, the user may obtain, through the CDN node in the content delivery network, a service file provided by a certain source station based on the client installed on a certain terminal (such as a smart phone, a tablet computer, a desktop computer, or a notebook 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 dispatches CDN nodes logically close to a terminal where the client is located for the client, and the service access request is received through the CDN nodes, thereby realizing the query for the service file.

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

In the embodiment of the invention, the first node performs corresponding processing on the service access request message by enabling the service function authority matched with the node level of the first node, namely by executing the service function logic belonging to the node level.

Specifically, if the first node queries a service file provided by a target source station requested by a client in the process of executing service function logic belonging to the node hierarchy (i.e. service function configuration belonging to the node hierarchy), the service file can be accurately transmitted to the client based on the service function logic through a request path of the service file, so that the client can acquire the service file in time. If the service file provided by the target source station requested by the client is not queried, forwarding the service access request message to the next hop node, namely, 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, 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. Wherein the second node is a next hop node of the first node located within 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 to a preset field in the basic head 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 level and the node type are used for indicating the service function authority possessed by the second node; the service function authority is used for indicating service function configuration matched with the second node. Then, after receiving the second service access request message, the second node can timely learn which level is specifically in the service access request and whether the second node is used as a father node or an edge node according to the detection of the second service access request message, and can take effect of service function configuration matched with the second node after learning the corresponding information.

If the first node is a parent node belonging to a certain node hierarchy, 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 queried, when it is determined that 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, it is not necessary to generate the second service access request message, it is necessary to delete content added by a preset field in a basic header of the first service access request message, and forward the deleted first service access request message to the target source station, so that the target source station queries 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 message, 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, the first service access request message (which is sent from the client and is not added to a preset field in a basic header of the first service access request message) 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 message. In addition, in order to prevent the service access request message from being endlessly and circularly forwarded all the time, a disaster recovery strategy is also set, namely, 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 obtained 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 in a preset field in the basic header of the first service access request message can be obtained when the first node needs to forward the first service access request message to the next hop node. Specifically, if the next-hop node is determined to be a node located in the content distribution network, it is determined whether the forwarding number of the service access request message forwarded to the next-hop node exceeds a certain value (i.e., whether the forwarding number of the service access request message is greater than a preset threshold value is determined), if the forwarding number of the service access request message forwarded to the next-hop node exceeds a certain value, a source returning strategy is executed, that is, the content added by a preset field in the basic header of the first service access request message is deleted, and the deleted first service access request message 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 message. If it is determined that the number of times of forwarding the service access request message forwarded to the next hop node does not exceed a certain value (i.e., it is determined that the number of times of forwarding the service access request message is less than or equal to a preset threshold), it is necessary to generate a second service access request message by adding the number of times of forwarding the service access request message and the node type of the second node to a preset field in a basic header of the first service access request message. In the content distribution network, each time a service access request message needs to be forwarded between nodes, the number of times of forwarding the service access request message is added by 1, for example, from an edge node, when the edge node receives the service access request message sent by a client, the number of times of forwarding the service access request message is 0, namely, the edge node is a node belonging to the 0 th level; When the edge node needs to forward the service access request message to the next hop node (namely a layer of father node), the forwarding times 1 of the service access request message need to be added in a preset field in the basic head of the service access request message, namely the next hop node is a node belonging to the 1 st layer, and meanwhile, the node type (namely the father node) needs to be added in the preset field in the basic head of the service access request message; if the next-hop node also needs to forward the service access request message to other next-hop nodes (i.e. two-layer parent nodes), the other next-hop nodes need to update the forwarding times 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 times 2, that is, the other next-hop nodes belong to the node of the 2 nd hierarchy, and meanwhile, because the node type of the other next-hop nodes 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 message 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 number of times of forwarding between the node and the source station is not counted.

Illustratively, continuing with the example of node a and the example of service function configuration as service timeout function, different node levels correspond to different service timeout times (i.e. represent the longest time that a node belonging to a node level is allowed to wait for a next hop node to respond to a service access request message), i.e. different node levels correspond to different service timeout rights, e.g. for the same node, the service timeout time of the node belonging to level 0 and the service timeout time of the node belonging to level 1 are different, assuming that the node level of the node a is level 0, the node a validates the service timeout rights belonging to level 0, i.e. the traffic handling timeout time for this node a at level 0 is T1. Assuming that a certain client needs to request a certain service file, a service access request message for acquiring the service file is generated and sent to a node (such as node a) logically close to the client, when the node a receives the service access request message sent by the client, the node a detects the service access request message, and can know that its own node level belongs to level 0 and determine that its own node type is an edge node, so that the node a takes effect of a service processing timeout authority matched with level 0, that is, the service processing timeout time of level 0 for the node a is T1, that is, if the node a needs to forward the service access request message to the next hop node (such as the node B), the node a needs to wait for the longest time for the node B to respond to the service access request message to be T1, if the waiting time exceeds T1, the request fails, and meanwhile, the node a feeds back response timeout information to the client. Or assuming that the node level of the node A is 1 st level, the node A takes effect of the service processing timeout authority belonging to 1 st level, namely the service processing timeout time of the node A in 1 st level is T2, then when the node A receives the service access request message forwarded by the previous node, the node A detects the forwarded service access request message to acquire that the node level of the node A belongs to 1 st level, and determines that the node type of the node A is a father node, so that the node A takes effect of the service processing timeout authority matched with 1 st level, namely the service processing timeout time of the node A in 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 the node C), the node a needs to wait for the longest time that the node C responds to the service access request message to be T2, and if the time waiting for the response exceeds T2, the request fails, and meanwhile, the node a feeds back the response timeout information to the previous-hop node. Wherein T2 is less than T1. For example, a service access request message obtains service files through two nodes in a content distribution network, for example, the two nodes are node a and node B, if node a is an edge node and node B is a parent node, for a service processing timeout function, node a takes effect is a service processing timeout authority matched with level 0, for example, the service processing timeout time of node a is 10s, that is, the maximum time that node a needs to wait for node B to respond to the service access request message is 10s, and if the waiting time 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 the source station a) located outside the content distribution network, and at this time, a new service access request message is not required to be generated, the service access request message can be directly forwarded to the source station a, so that the source station a queries a corresponding service file through the service access request message; Or if the node a is a parent node belonging to the 1 st hierarchy, if the node a needs to forward the service access request message to a target source station (such as the source station a) located outside the content distribution network, deleting the content added by a preset field in the basic header of the received service access request message, and forwarding the deleted service access request message to the source station a, so that the source station a queries a corresponding service file through the deleted service access request message. And if it is determined that the next hop node is a node located in the content distribution network, determining whether the forwarding number of the service access request message forwarded to the next hop node exceeds a certain value (for example, 3), and if the forwarding number of the service access request message added by the node a to the preset field in the basic header of the service access request message is 2, the 2 is smaller than 3, at this time, a new service access request message may be generated by performing a corresponding change on the service access request message, and forwarding the new service access request message to the next hop node (for example, node B), so that the node B uses the effective query function range to perform a corresponding query on the service file requested by the client. Or assuming that the number of times of forwarding the service access request message, which is added by the node a to the preset field in the basic header of the service access request message, is 4, then 4 is greater than 3, and at this time, a back source policy is executed, that is, deleting the content added by the preset field in the basic header of the service access request message, and forwarding the deleted service access request message to the source station a located outside the content distribution network, so that the source station a queries a corresponding service file through the deleted service access request message. After the service file requested by the client is inquired, the service file can be accurately transmitted to the client through the request path of the service file.

The above embodiments show that, since the prior art solution is to statically distinguish between different node levels of planning each node directly from the hardware dimension, the node levels of each node are explicit and fixed, thus resulting in that each node of the different node levels is not miscible. Moreover, since the nodes of different node levels cannot be mixed, when the service access request amount increases, redundant planning needs to be performed for each node, so that resource waste is also caused. Based on the method, the technical scheme of the invention defines the node level and the node type from the software dimension, namely, the node level definition and the node type definition are stripped from the hardware equipment (namely, the node) and the node type definition are not directly and statically distinguished and planned from the hardware dimension, so that the node level and the node type of the node are dynamically defined, constraint of the node level and the node type on the hardware is broken, dynamic control or adjustment of any node to take effect on different node levels and node types is facilitated, and the flexibility of the node level and the node type of the defined node is effectively improved, so that the effective multiplexing of the node is realized. Specifically, for any node (i.e., a first node) located in the content distribution network, when detecting a first service access request message, the first node can accurately acquire a node level of the first node through the first service access request message, where the first service access request message is used to instruct any client to acquire a service file provided by a target source station, and determine a first service function configuration matched with the node level of the first node from multiple service function configurations belonging to different levels, that is, the node level of the node is not statically fixed any more, so that the node has different node levels (for example, one node can be used as an edge node or a parent node of a certain level, for example, a parent node of a layer of a parent node or two layers of parent nodes) and respective corresponding service function configurations of different node levels are validated, thereby realizing effective multiplexing of the node, and certainly, each node does not need to perform redundancy planning, so as to effectively avoid resource waste. And then the first service function configuration is executed to process the first service access request message, so that the service file provided by the target source station corresponding to the first service request message can be effectively queried in time. Therefore, the scheme dynamically defines the node levels of the nodes from the software dimension so as to enable the nodes to take effect of different node levels under different scenes instead of statically fixing the node levels of the nodes, so that flexibility of the node levels of the nodes is increased, flexible dynamic effect of the nodes according to own current scenes can be achieved, service function configuration which is more in line with the current scenes can be achieved, effective multiplexing of the nodes can be achieved, and resource waste caused by redundancy planning of the nodes can be effectively avoided.

Fig. 3 exemplarily shows a data processing apparatus based on a content distribution network according to an embodiment of the present invention, which may perform a flow of a data processing method based on a content distribution network, based on the same technical concept. The data processing device based on the content distribution network may be a first node (such as a server or other electronic device having functions required to implement the method), or may be a functional component (such as a chip or an integrated circuit supporting the functions required by the first node to implement the method) disposed 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 the 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 positioned in the content distribution network;

A processing module 302, configured to enable a first service function configuration matched to a node hierarchy of the first node; the first node is preconfigured with a plurality of service function configurations of different levels; 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, the 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 in the embodiment of the present invention, a specific connection medium between the processor 401 and the memory 402 is not limited, and in fig. 4, the processor 401 and the memory 402 are connected by a bus, for example. The buses may be divided into address buses, data buses, control buses, etc.

In an 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 perform the steps included in the foregoing data processing method based on the content distribution network by executing the instructions stored in the memory 402.

Where the processor 401 is a control center of a computing device, various interfaces and lines may be utilized to connect various portions of the computing device, through execution or execution of instructions stored in the memory 402, and invocation of data stored in the memory 402, to effect data processing. Alternatively, the processor 401 may include one or more processing units, and the processor 401 may integrate an application processor and a modem processor, wherein the application processor mainly processes an operating system, a user interface, an application program, etc., and the modem processor mainly processes an issue 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, and 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), digital signal processor, application SPECIFIC INTEGRATED Circuit (ASIC), field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, etc., that may implement or perform the methods, steps, and logic diagrams disclosed in embodiments of the present invention. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in connection with embodiments of a data processing method based on a content distribution network may be embodied directly in a hardware processor for execution or in a combination of hardware and software modules in the processor.

Memory 402 is a non-volatile computer-readable storage medium that can 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, which may include, for example, flash Memory, hard disk, multimedia card, card Memory, random access Memory (RandomAccess Memory, RAM), static random access Memory (Static Random Access Memory, SRAM), programmable Read-Only Memory (Programmable Read Only Memory, PROM), read-Only Memory (ROM), charged erasable programmable Read-Only Memory (ELECTRICALLY ERASABLE PROGRAMMABLE READ-Only Memory, EEPROM), magnetic Memory, magnetic disk, optical disk, and the like. 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 in embodiments of the present invention may also be circuitry or any other device capable of performing memory functions for storing program instructions and/or data.

Based on the same technical idea, an embodiment of the present invention further provides a computer-readable storage medium storing a computer program executable by a computing device, which when run on the computing device, causes the computing device to perform the steps of the above-described data processing method based on a content distribution network.

It will be appreciated by those skilled in the art that 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 flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations 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. It is therefore intended that the following claims be interpreted as including the 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 modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims

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

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

The first node determines a node level of the first node based on a first service access request message, including:

if yes, the first node determines the node level carried in the first service access request message as the node level of the first node;

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

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

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

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

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

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

6. The method of claim 3, further comprising, prior to forwarding the second service access request message to the second node:

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

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

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

The determining module is specifically configured to:

If yes, determining the node level carried in the first service access request message as the node level of the first node;

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

9. 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 7.

10. A computer readable storage medium, characterized in that it stores a computer program executable by a computing device, which when run on the computing device, causes the computing device to perform the method of any of claims 1 to 7.