CN113810293A - Network preferred agent method, device, electronic equipment, server and storage medium - Google Patents
Network preferred agent method, device, electronic equipment, server and storage medium Download PDFInfo
- Publication number
- CN113810293A CN113810293A CN202010542097.4A CN202010542097A CN113810293A CN 113810293 A CN113810293 A CN 113810293A CN 202010542097 A CN202010542097 A CN 202010542097A CN 113810293 A CN113810293 A CN 113810293A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- link
- information
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
After an optimal agent query request of a client to a target node is obtained, each reachable link capable of being communicated to the target node is determined according to current node link data of a service network where the target node is located, at least one node meeting node conditions is selected from each reachable link to serve as the optimal agent node of the target node, and node information of the optimal agent node is fed back to the client finally, so that the client forwards the client request to the target node through the optimal agent node. Aiming at the optimal agent query request of the client, the method makes full use of the diversity of the links of the distributed networks such as the CDN, and the optimal route based on the optimal agent is selected for the target node facing the client intelligently through data analysis, so that the stability or transmission rate of the networks such as the public network can be effectively improved, and the service quality of the networks such as the public network is improved.
Description
Technical Field
The application belongs to the technical field of internet, and particularly relates to a network preference agent method, a network preference agent device, electronic equipment, a server and a storage medium.
Background
The CDN network, i.e., a content delivery network, is composed of a plurality of CDN nodes and provides multi-mirror caching of files running on a public network.
The operation and maintenance of the CDN often require the operation of remote CDN nodes in the public network. However, the public network has poor service quality, such as unstable operation and uncertain transmission rate, for example, network jitter, IDC (Internet Data Center) network limitation, operator service quality, link distance (the quality is particularly significant at home and abroad), and other factors may cause packet loss or poor transmission rate in the public network, which affects the public network service quality. Therefore, it is an urgent need in the art to provide a network preference agent technique to improve the service quality of networks such as public networks.
Disclosure of Invention
In view of this, the present application provides a network preferred agent method, apparatus, electronic device, server and storage medium, which are used for selecting an optimal route based on an optimal agent for a client request through network preferred agent processing, so as to improve the service quality of a network.
The specific technical scheme is as follows:
a network preferred agent method is applied to a server side, and the method comprises the following steps:
acquiring an optimal agent query request of a client to a target node, wherein the optimal agent query request is used for indicating to acquire the optimal agent node of the target node;
acquiring current node link data of a service network where the target node is located;
determining each reachable link which can be communicated to the target node according to the node link data;
selecting at least one node meeting the node condition from each reachable link as an optimal proxy node of the target node; the at least one node is at least part of nodes positioned at the target node end on the same reachable link;
and feeding back the node information of the optimal proxy node to the client so that the client performs communication interaction with the target node through the forwarding function of the optimal proxy node.
Optionally, the obtaining of the current node link data of the service network where the target node is located includes:
acquiring node link data of the service network which is acquired and reported last time;
the node link data comprises at least part of node addresses, bandwidths, operators, areas, network topology information, resource usage information, connectivity among different nodes and network delay data of all nodes in the service network.
Optionally, in the method, a network topology structure of the service network is a tree, and the network topology structure information of the service network includes hierarchical information of a node tree;
the process of collecting and reporting the node link data of the service network comprises the following steps:
sending a link probing instruction to the node tree; the node tree acquires basic link information of the service network, wherein the basic link information at least comprises hierarchical information of the node tree;
and the node tree determines dynamic link information corresponding to each node in the node tree based on the hierarchical information, and reports the dynamic link information corresponding to each node and the basic link information as node link data of the service network.
Optionally, the sending the link probing instruction to the node tree includes:
sending a link probing instruction to a root node of the node tree; the root node acquires basic link information of the service network;
the node tree determines dynamic link information corresponding to each node in the node tree based on the hierarchical information, and reports the dynamic link information corresponding to each node and the basic link information as node link data of the service network, including:
the root node determines a child node of the root node according to the hierarchical information and sends the basic link data to the child node;
the child node determines the child node of the child node based on the hierarchical information in the basic link data and issues the basic link data;
repeating the process of determining the child nodes of the nodes based on the hierarchical information and sending basic link information to the downstream nodes layer by layer according to the tree structure of the node tree until the basic link information is sent to the leaf nodes of the node tree;
after obtaining the basic link information sent by the father node of the node tree, the node of the node tree determines the dynamic link information corresponding to the node, and reports the determined dynamic link information to the upstream node layer by layer according to the tree structure of the node tree until the information is reported to the root node;
and after the root node obtains the dynamic link information reported by each node, reporting the dynamic link information reported by each node and the basic link information as node link data of the service network.
Optionally, in the above method, the dynamic link information corresponding to the node in the node tree includes at least one of resource usage information of the node itself, connectivity between the node and an adjacent node, and network delay data;
and the adjacent nodes of the nodes comprise parent-child nodes and/or non-parent-child nodes meeting the position condition of the nodes in the node tree.
The method optionally determines connectivity and network delay data between the node and the neighboring node, and includes:
the node and the adjacent nodes thereof send ping requests to each other;
connectivity and network delay data between the node and neighboring nodes is determined based on the ping information.
Optionally, the selecting at least one node meeting the node condition from each reachable link includes:
selecting at least one node meeting at least one of the following conditions from each reachable link:
is in the same region as the target node;
belonging to the same operator as the target node;
belonging to a different operator than the target node but in a backbone network;
the same branch in a network topology of the serving network as the target node;
the used resources meet the resource consumption condition;
the network delay with the target node satisfies the delay condition.
In the above method, optionally, the nodes in the node tree include a node body and an agent unit, and the agent unit in the node is configured to perform at least one of the following processes:
issuing, collecting or reporting link data of corresponding nodes;
network mutual ping processing;
and forwarding the client request of the client facing the target node.
A network preference agent method is applied to a client, and comprises the following steps:
sending an optimal agent query request for a target node to a server, wherein the optimal agent query request is used for indicating to acquire the optimal agent node of the target node;
acquiring node information of the optimal proxy node fed back by the server;
sending a client request to the optimal proxy node to cause the optimal proxy node to forward the client request to the target node;
and acquiring the request result information of the target node forwarded by the optimal proxy node.
A network preference agent device is applied to a server side, and the device comprises:
the system comprises a first obtaining unit, a second obtaining unit and a third obtaining unit, wherein the first obtaining unit is used for obtaining an optimal proxy query request of a client to a target node, and the optimal proxy query request is used for indicating to obtain an optimal proxy node of the target node;
a second obtaining unit, configured to obtain current node link data of a service network where the target node is located;
a determining unit, configured to determine, according to the node link data, each reachable link that can be communicated to the target node;
a selecting unit, configured to select at least one node that meets a node condition from each reachable link, as an optimal proxy node of the target node; the at least one node is at least part of nodes positioned at the target node end on the same reachable link;
and the feedback unit is used for feeding back the node information of the optimal proxy node to the client so that the client performs communication interaction with the target node through the forwarding function of the optimal proxy node.
A network preference agent apparatus applied to a client, the apparatus comprising:
the system comprises a first sending unit, a second sending unit and a third sending unit, wherein the first sending unit is used for sending an optimal proxy query request for a target node to a server, and the optimal proxy query request is used for indicating to acquire the optimal proxy node of the target node;
a third obtaining unit, configured to obtain node information of an optimal proxy node fed back by the server;
a second sending unit, configured to send a client request to the optimal proxy node, so that the optimal proxy node forwards the client request to the target node;
and the fourth obtaining unit is used for obtaining the request result information of the target node forwarded by the optimal proxy node.
A server, comprising:
a first memory for storing a first set of computer instructions;
the first processor is used for implementing the network preference agent method applied to the server side by executing the instruction set stored on the first memory.
An electronic device, comprising:
a second memory for storing a second set of computer instructions;
and the second processor is used for realizing the network preference agent method applied to the client by executing the instruction set stored on the second memory.
A computer readable storage medium having stored therein a first set of computer instructions which, when executed by a processor, implement a network preference agent method applied to a server as recited in any one of the above.
A computer readable storage medium having stored therein a second set of computer instructions which, when executed by a processor, implement a network preference proxy method as described above for application to a client.
After an optimal proxy query request of a client to a target node is obtained, each reachable link capable of being communicated to the target node is determined according to current node link data of a service network where the target node is located, at least one node meeting node conditions is selected from each reachable link to serve as the optimal proxy node of the target node, and node information of the optimal proxy node is fed back to the client finally, so that the client forwards the client request to the target node through the optimal proxy node. Aiming at the optimal agent query request of the client, the method makes full use of the diversity of the links of the distributed networks such as the CDN, and the optimal route based on the optimal agent is selected for the target node facing the client intelligently through data analysis, so that the stability or transmission rate of the networks such as the public network can be effectively improved, and the service quality of the networks such as the public network is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a network preferred agent method applied to a server according to an embodiment of the present application;
fig. 2 is a logic diagram of collecting and reporting network node link data by a deployed proxy system according to an embodiment of the present disclosure;
fig. 3 is a flowchart of a network preferred agent method applied to a client according to an embodiment of the present application;
fig. 4 is a diagram of an example of an application in which a client requests a proxy and interacts with a target node based on the proxy according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a network preference agent apparatus applied to a server according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a network preference agent apparatus applied to a client according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a server provided in an embodiment of the present application;
fig. 8 is a schematic structural diagram of an electronic device provided in an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and 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 application.
In order to improve the service quality of a distributed public network (such as the internet and the internet of things), embodiments of the present application disclose a network preference agent method, apparatus, electronic device, server, and storage medium, which will be described in detail in the following through a plurality of embodiments.
First, a network preferred agent method provided in an embodiment of the present application is explained, referring to fig. 1, which shows a flow diagram of the network preferred agent method when applied to a server, and the method may include the following steps:
And the optimal proxy inquiry request is used for indicating the optimal proxy node for acquiring the target node.
The network preferred agent method provided by the embodiment of the application can be applied to a preferred agent processing scene of a server side to a client side in the environment of a distributed public network and the like, and the server side can be a server side provided by a CDN running on the public network.
The CDN enables a user to obtain required content from a nearby server in the network through functions of load balancing, content distribution, scheduling and the like, so that network congestion is reduced, and the access response speed and the hit rate of the user are improved. When a client running on a user electronic device such as a mobile phone, a tablet computer, etc. needs to interact with a network, and needs to obtain page content of a webpage, a request is sent to a distributed CDN node in a direct connection manner, however, a public network may affect service quality due to factors such as network jitter, IDC network limitations, operator service quality, link distance (domestic and overseas quality is particularly significant), and the like, so that problems of packet loss (network packet loss is usually instantaneous, in a gap type form, and is not easily detected accurately and objectively, for example, packet loss in a short time may be amplified or ignored by a detection system), request sending failure, transmission rate difference, and the like occur.
In order to solve the problem and improve the network service quality, in the embodiment of the application, when the problem occurs, such as a request sending failure or a too slow transmission rate and the like under the condition that the client is directly connected with the target node, the client can automatically send an optimal proxy query request for the target node to the server, and the purpose is to realize the request and response interaction between the client and the target node in a proxy forwarding mode.
The server correspondingly receives the request, where the request at least carries indication information of the target node, for example, the request may specifically carry a node IP (Internet Protocol ) address of the target CDN node, and in addition, the request may also carry some other information, such as a client IP address, and the information composition of the query request is not limited herein.
And 102, acquiring the current node link data of the service network where the target node is located.
In this embodiment, the target node may be a target CDN node, and the service network where the target node is located may be a CDN network.
In practical implementation, node link data of a service network, such as a CDN network, where the target node is located may be periodically detected and collected and reported. After receiving an optimal agent query request of a client to a target node, a server can preferentially read the network node link data which is collected and reported last time as the current node link data of a service network where the target node is located.
The acquired node link data of the service network may include, but is not limited to, one or more of a node address (e.g., a node IP address), a bandwidth, an affiliated operator, a location area, network topology information, resource usage information, connectivity between different nodes, and network delay data of each node of the service network.
The resource usage information of a node may include information such as the used bandwidth and/or the number of connections within the node.
And 103, determining each reachable link which can be communicated to the target node according to the node link data.
An reachable link of a target node refers to a node path which is communicated with the target node in a service network such as a CDN network and can effectively communicate with the target node, and one reachable link includes at least one other node other than the target node.
It should be noted that if a plurality of other nodes other than the target node are included on the reachable link of the target node, the plurality of other nodes may be nodes in the same area (e.g., district, city, province, etc.) or different areas, or nodes belonging to the same operator or different operators, and similarly, the other nodes may be nodes in the same area (e.g., district, city, province, etc.) or different areas, or nodes belonging to the same operator or different operators, as well as the target node.
In implementation, each reachable link of the target node may be analyzed based on at least a part of data in the current node link data of the serving network, for example, based on an IP address of each node in the CDN network, a network topology, connectivity between different nodes, and network delay data.
104, selecting at least one node meeting the node condition from each reachable link as an optimal proxy node of the target node; the at least one node is at least part of nodes which are positioned at the end of the target node on the same reachable link.
The node condition may be a combination of one or more of the following conditions:
1) is in the same region as the target node;
2) belonging to the same operator as the target node;
3) belonging to a different operator than the target node but in a backbone network;
4) the same branch in a network topology of the serving network as the target node;
5) the used resources meet the resource consumption condition;
6) the network delay with the target node satisfies the delay condition.
In practical application, at least part of the conditions 1) -6) can be flexibly combined and set according to factors such as priority, importance degree and the like, so as to be used as a selection basis for determining the optimal route and selecting the optimal agent in the process of selecting the optimal agent.
Illustratively, an optional implementation manner is to set the node condition to be satisfied by the optimal proxy node as: preferentially selecting nodes which are in the same area (such as district, city, province and the like) as the target node on the reachable link; if the node in the same area as the target node does not exist on the reachable link, preferentially selecting the node which belongs to the same operator as the target node on the reachable link; if the conditions belonging to the same operator are not met, preferentially selecting a node on the reachable link which is positioned in the backbone network; if all the conditions can not be met, the node which is in the same branch with the target node on the reachable link in the network topology structure of the service network is preferentially selected. In addition, the node condition may be formulated by referring to the factors of resource consumption, network delay, and the like, for example, a node that preferentially selects a resource (bandwidth, connection number information) used on the reachable link that satisfies the resource consumption condition, or a node that preferentially selects a network delay between the reachable link and the target node that satisfies the delay condition, and the like.
The network topology structure of the CDN network is generally a tree structure including CDN nodes organized in a node tree structure, so that a node located in the same branch in the network topology structure of the service network as a target node may specifically be a node located in the same branch in a node tree of the CDN network as the target node.
The resource consumption condition may be set to, but not limited to: the bandwidth occupation/occupancy rate of the nodes is lower than a set first threshold value, and/or the connection number is lower than a set second threshold value, and the like; the delay condition may then be set to, but is not limited to: the network delay with the target node is lower than the set time length.
And selecting at least one node meeting the node conditions based on a node selection strategy, and then taking the selected at least one node as an optimal proxy node of the target node. The selected at least one node used as the optimal proxy node is at least part of nodes which are positioned at the target node end on the same reachable link of the target node.
In general, the number of the optimal proxy nodes is one, and the optimal proxy node is a node that is adjacent to and connected (directly connected) to the target node and meets the node condition on the reachable link of the target node, but is not limited to this, the number of the optimal proxy nodes may also be multiple, and when the number of the optimal proxy nodes is multiple, the multiple optimal proxy nodes may specifically be: and multiple nodes which are in accordance with the node conditions and belong to the same reachable link and are positioned at the target node end (so as to realize the communication with the target node) are arranged on each reachable link of the target node. The number of optimal proxy nodes typically does not exceed three. For example, assume that a reachable link is: node 1 → node 2 → node 3 → node 4 → node 5 → target node, and assuming that it is determined that all of the nodes 3, 4, and 5 in the above link meet the node condition based on the node condition that is in the same region as the target node, the node 5 (i.e., 1 optimal proxy node) may be determined as the optimal proxy node of the target node, and the nodes 3, 4, and 5 (i.e., 3 optimal proxy nodes), or the nodes 4 and 5 (i.e., 2 optimal proxy nodes), may be determined as the optimal proxy node of the target node.
And 105, feeding back the node information of the optimal proxy node to the client so that the client performs communication interaction with the target node through the forwarding function of the optimal proxy node.
After the optimal proxy node is selected, the server feeds back node information of the optimal proxy node, such as an IP address, to the client so as to inform the client of the determined optimal proxy node, and then the client sends a client request to a target node through the forwarding function of the optimal proxy node and obtains request result information responded by the target node through the forwarding function of the optimal proxy node; such as sending a url (uniform resource locator) request to the target node through the optimal proxy node, and obtaining the web page content returned by the target node in response to the url request through the optimal proxy node.
The network preferred agent method provided by this embodiment makes full use of network bandwidth and link diversity of distributed networks such as a CDN, intelligently selects an optimal route based on an optimal agent for a target node oriented to a client through data analysis, and performs information feedback of the optimal node, i.e., an agent node, to the client, so that stability or transmission rate of networks such as a public network can be effectively improved, and service quality of networks such as a public network is improved.
An alternative implementation of the collection and reporting of link data of the serving network node is described in detail below in another embodiment.
The network topology structure of the CDN network is tree-shaped, and includes a node tree composed of each CDN node.
Next, a process of collecting and reporting node link data of the service network will be described mainly by taking the service network as a CDN network and a network topology of the service network as a tree structure, where the process of collecting and reporting node link data of the service network may include:
sending a link probing instruction to the node tree; the node tree acquires basic link information of the service network, wherein the basic link information at least comprises hierarchical information of the node tree;
and the node tree determines dynamic link information corresponding to each node in the node tree based on the hierarchical information, and reports the dynamic link information corresponding to each node and the basic link information as node link data of the service network.
More specifically, the above-mentioned collecting and reporting process can be implemented as the following steps:
1) sending a link probing instruction to a root node of a node tree of a serving network; the root node acquires basic link information of the service network;
the basic link information includes at least hierarchical information of the node tree; besides, it can also include but not limited to part or all of the information in the IP address, bandwidth, affiliated operator, located area, etc. of the node in the node tree.
2) Responding to the link detection instruction, the root node determines a child node of the root node according to the hierarchical information, and sends the basic link data to the child node;
specifically, after receiving the link probing instruction, the root node locates the root node in the node tree according to the own IP of the root node and the hierarchical information of the node tree, and after locating the own node (root node) from the node tree, the root node further obtains child nodes of the root node based on the hierarchical information of the node tree, and then pushes the basic link data, such as the hierarchical information of the tree, to each determined child node.
3) The child node determines the child node of the child node based on the hierarchical information in the basic link data and issues the basic link data;
4) repeating the process of determining the child nodes of the nodes based on the hierarchical information and sending basic link information to the downstream nodes layer by layer according to the tree structure of the node tree until the basic link information is sent to the leaf nodes of the node tree;
similarly, each node obtaining the basic link data carries out self-position positioning in the node tree and further determines the sub-node positioned at the downstream, the basic link data is pushed to the downstream nodes layer by layer according to the tree structure, and the basic link data is pushed to the leaf nodes of the node tree until the basic link information is sent to the leaf nodes of the node tree.
5) After each node of the node tree obtains the basic link information sent by the father node of the node tree, the dynamic link information corresponding to the node is determined, and the determined dynamic link information is reported to the upstream nodes layer by layer according to the tree structure of the node tree until the dynamic link information is reported to the root node.
The dynamic link information corresponding to the node in the node tree may include, but is not limited to, at least one of resource usage information of the node itself, connectivity between the node and a neighboring node, and network delay data.
The adjacent nodes of the nodes comprise parent-child nodes and/or non-parent-child nodes meeting the position condition of the nodes in the node tree. The position condition that needs to be satisfied when two nodes that are not parent-child nodes form an adjacent node may be, but is not limited to, set as: two nodes are in the same region, or two nodes are in the same or close layers in the node tree, etc.
Specifically, after receiving the basic link information pushed by its parent node, each node of the node tree may send a mutual ping request with an adjacent node, and collect mutual ping information to obtain information such as connectivity and/or network delay data with the adjacent node. Besides, the resource usage information of the node itself, such as the used bandwidth, the number of connections, etc., can be collected.
After collecting the information, each node reports to the upstream nodes layer by layer according to the tree structure of the node tree until reporting to the root node.
6) And after the root node obtains the dynamic link information reported by each node, reporting the dynamic link information reported by each node and the basic link information as node link data of the service network.
Referring to fig. 2, a schematic diagram illustrating a principle of collecting and reporting link data of a service network node by an application example of this embodiment is shown, in this example, as shown in fig. 2, a proxy system is deployed in a CDN network in advance, and a network priority proxy method applied to a server according to the embodiment of the present application is implemented in the form of the proxy system, where the proxy system includes three modules: an agent module 201, a CDN topology management module 202 and a link tuning module 203.
The agent module 201 is deployed on each node of a node tree of the CDN network, that is, one agent unit (proxy-agent) is deployed on each node, the agent units (proxy-agents) on all the nodes form one agent module 201, and the agent units (proxy-agents) on the nodes mainly have the following functions:
issuing, collecting or reporting link data of corresponding nodes;
mutual ping processing with the network of the adjacent node;
and forwarding the client request of the client facing the target node.
And the CDN topology management module 202 is configured to manage node link data, such as node IP, bandwidth, an operator to which the node link data belongs, a region in which the node link data is located, and hierarchical information of a node tree of the entire CDN node cluster. And the node cluster is used for issuing a link detection instruction to the tree node cluster and triggering the node cluster with the tree topology in the CDN network to perform more complete detection of node link data, such as dynamically variable link data, such as the number of connections of a detection node, bandwidth usage information, connectivity with an adjacent node, and network delay.
The link tuning module 203 provides a link analysis function based on the reported node link data, and performs selection and determination processing of the optimal agent of the target node for the client sending the optimal agent query request based on the reported node link data.
In implementation, the functions of the CDN topology management module 202 and the link tuning module 203 may be implemented in the same physical device or different physical devices, and the functions of the two modules may be implemented in the form of additional functions on an existing CDN node of the CDN network, or may also be implemented on an additional physical device, such as a server, that is independent of the CDN node.
As shown in fig. 2, the principle of implementing the collection and reporting of the node link data based on each module is as follows:
the CDN topology management module 202 is configured to periodically issue a link detection request to a proxy-agent of a root node, which is the uppermost node of the node tree, based on a set information acquisition policy, and in addition, the CDN topology management module may also send basic link data including at least node tree hierarchy information to the proxy-agent of the root node, which is the uppermost node of the node tree, where the basic link data may include information such as a node IP of the node, an operator to which the node belongs, and a location area in addition to the node tree hierarchy information.
On the basis, the proxy-agent of the node in the tree can position the node in the node tree based on the IP and the hierarchical information of the node to acquire the downstream child nodes, push the basic link data to the downstream nodes layer by layer according to the hierarchical structure of the tree, simultaneously obtain the resource use condition information (such as bandwidth use condition, connection number and the like) of the node and/or send mutual ping requests with adjacent nodes (nodes with parent-child relationship or non-parent-child nodes meeting position conditions), and collect mutual ping information to obtain the data such as connectivity with the adjacent nodes, network delay and the like. And reporting the data to the proxy-agent of the upper node after the proxy-agent of the downstream node finishes the collection of the information, and further reporting layer by layer until the data is reported to the proxy-agent of the uppermost node, namely the root node. The root node proxy-agent finally collects the reported information to obtain complete node link data (such as the basic link data + the collected link data), and further reports the complete node link data to the link tuning module 203, and on the basis, the link tuning module 203 can provide a preferred agent processing function for the client sending the optimal agent query request by taking the reported node link data as a data basis.
The embodiment makes full use of the network bandwidth and link diversity of the distributed networks such as the CDN, intelligently selects the optimal route for the client request by analyzing the collected node link data, can effectively improve the stability or transmission rate of the networks such as the public network, and improves the service quality of the networks such as the public network. In this embodiment, based on the advantage of the distributed characteristics of the CDN network, the CDN node is multiplexed to serve as a proxy to provide the route forwarding function, so that the quality of network service across the public network is improved by 5%. And the distributed proxy service can provide more qps (query rate per second) and has higher adaptivity, so that the network service quality is improved from aspects of stability, transmission rate and the like, which is incomparable with the centralized proxy service.
Matching with the network preferred agent method applied to the server, the embodiment of the application also discloses a network preferred agent method applied to the client, and referring to fig. 3, the network preferred agent method applied to the client comprises the following steps:
Specifically, the optimal proxy query request for the target node may be sent to the server if the proxy condition is satisfied. And the optimal proxy inquiry request is used for indicating the optimal proxy node for acquiring the target node. The proxy conditions may include, but are not limited to: the client fails to send the request to the target node under the condition of directly connecting the target node, or the target node responds overtime, or the response of the target node is estimated to be overtime or the problem of network instability exists on the basis of the acquired parameter information.
The client can estimate the response time length of the target node or the network stability by acquiring one or more parameter information of network jitter, idc network limitation, operator service quality, link distance and the like.
Under the condition that the proxy condition is met, the service quality of the service obtained by the client through directly connecting the target node is not guaranteed, and in order to solve the problem, the client automatically sends an optimal proxy inquiry request for the target node to the server (the operation is invisible to the user).
And step 302, obtaining the node information of the optimal proxy node fed back by the server.
After receiving the query request of the client, the server analyzes the optimal proxy node of the target node based on the current node link data of the service network and feeds back the node information of the optimal proxy node to the client.
The client can specifically obtain the IP address of the optimal proxy node fed back by the server.
After the client obtains the node information of the optimal proxy node fed back by the server, the client sends a client request to the target node through the optimal proxy node based on the forwarding function provided by the optimal proxy node.
And step 304, acquiring the request result information of the target node forwarded by the optimal proxy node.
The target node responds to the client request and generates request result information, and then the request result information is transmitted to the client through forwarding of the optimal proxy node.
Referring to fig. 4, an application example of the above processing procedure is provided, where the application example is based on the proxy system deployed in the CDN network in the above embodiment, and in the application example, as shown in fig. 4, a processing procedure in which the client requests the optimal proxy from the server and interacts with the target node based on the optimal proxy includes:
(1) a client sends a request for inquiring an optimal agent of a node (namely a target node) to a link tuning module deployed by a server;
(2) the link tuning module returns the information of the optimal proxy b node to the client;
(3) the client sends a request to a proxy-agent of the node b;
(4) b, the proxy-agent of the node b forwards the client request to the node a;
(5) the node a returns the request result information to the proxy-agent of the node b;
(6) and the b node proxy-agent forwards the request result information to the client.
In the embodiment, when the client is directly connected with the target node and the request sending to the target node fails and the like, the client requests the optimal proxy to the server and performs communication interaction with the target node based on the optimal proxy, so that the network service quality facing the client can be effectively improved, and the problems of packet loss or slow response rate and the like under the condition of direct connection are solved.
Corresponding to the foregoing network preferred agent method applied to the server, an embodiment of the present application further discloses a network preferred agent apparatus applied to the server, as shown in fig. 5, the network preferred agent apparatus applied to the server includes:
a first obtaining unit 501, configured to obtain an optimal proxy query request of a client for a target node, where the optimal proxy query request is used to indicate to obtain an optimal proxy node of the target node;
a second obtaining unit 502, configured to obtain current node link data of a service network where the target node is located;
a determining unit 503, configured to determine, according to the node link data, each reachable link that can be communicated to the target node;
a selecting unit 504, configured to select at least one node that meets a node condition from each reachable link, as an optimal proxy node of the target node; the at least one node is at least part of nodes positioned at the target node end on the same reachable link;
a feedback unit 505, configured to feed back the node information of the optimal proxy node to the client, so that the client performs communication interaction with the target node through a forwarding function of the optimal proxy node.
In an optional implementation manner of the embodiment of the present application, the second obtaining unit 502 is specifically configured to:
acquiring node link data of the service network which is acquired and reported last time;
the node link data comprises at least part of node addresses, bandwidths, operators, areas, network topology information, resource usage information, connectivity among different nodes and network delay data of all nodes in the service network.
In an optional implementation manner of the embodiment of the present application, a network topology structure of the service network is a tree type, and network topology structure information of the service network includes hierarchical information of a node tree;
in the second obtaining unit 502, the process of acquiring and reporting the node link data of the service network includes:
sending a link probing instruction to the node tree; the node tree acquires basic link information of the service network, wherein the basic link information at least comprises hierarchical information of the node tree;
and the node tree determines dynamic link information corresponding to each node in the node tree based on the hierarchical information, and reports the dynamic link information corresponding to each node and the basic link information as node link data of the service network.
In an optional implementation manner of the embodiment of the present application, the sending, by the second obtaining unit 502, a link probing instruction to the node tree includes:
sending a link probing instruction to a root node of the node tree; the root node acquires basic link information of the service network;
in the second obtaining unit 502, the determining, by the node tree based on the hierarchical information, dynamic link information corresponding to each node in the node tree, and reporting the dynamic link information corresponding to each node and the basic link information as node link data of the service network includes:
the root node determines a child node of the root node according to the hierarchical information and sends the basic link data to the child node;
the child node determines the child node of the child node based on the hierarchical information in the basic link data and issues the basic link data;
repeating the process of determining the child nodes of the nodes based on the hierarchical information and sending basic link information to the downstream nodes layer by layer according to the tree structure of the node tree until the basic link information is sent to the leaf nodes of the node tree;
after obtaining the basic link information sent by the father node of the node tree, the node of the node tree determines the dynamic link information corresponding to the node, and reports the determined dynamic link information to the upstream node layer by layer according to the tree structure of the node tree until the information is reported to the root node.
And after the root node obtains the dynamic link information reported by each node, reporting the dynamic link information reported by each node and the basic link information as node link data of the service network.
In an optional implementation manner of the embodiment of the present application, the dynamic link information corresponding to the node in the node tree includes at least one of resource usage information of the node itself, connectivity between the node and an adjacent node, and network delay data;
and the adjacent nodes of the nodes comprise parent-child nodes and/or non-parent-child nodes meeting the position condition of the nodes in the node tree.
In an optional implementation manner of the embodiment of the present application, in the second obtaining unit 502, determining connectivity and network delay data between a node and an adjacent node includes:
the node and the adjacent nodes thereof send ping requests to each other;
connectivity and network delay data between the node and neighboring nodes is determined based on the ping information.
In an optional implementation manner of the embodiment of the present application, the selecting unit 504 is specifically configured to:
selecting at least one node meeting at least one of the following conditions from each reachable link:
is in the same region as the target node;
belonging to the same operator as the target node;
belonging to a different operator than the target node but in a backbone network;
the same branch in a network topology of the serving network as the target node;
the used resources meet the resource consumption condition;
the network delay with the target node satisfies the delay condition.
In an optional implementation manner of the embodiment of the present application, a node in the node tree includes a node body and a proxy unit, and the proxy unit in the node is configured to perform at least one of the following processes:
issuing, collecting or reporting link data of corresponding nodes;
network mutual ping processing;
and forwarding the operation request of the client facing the target node.
For the network preferred agent apparatus applied to the server disclosed in the embodiment of the present application, since it corresponds to the network preferred agent method applied to the server disclosed in the above respective embodiments, the description is relatively simple, and for the relevant similarities, please refer to the description of the network preferred agent method portion of the server in the above respective embodiments, and the detailed description is omitted here.
Corresponding to the foregoing network preferred agent method applied to the client, the embodiment of the present application further discloses a network preferred agent apparatus applied to the client, and referring to fig. 6, the network preferred agent apparatus applied to the client includes:
a first sending unit 601, configured to send an optimal proxy query request for a target node to a server, where the optimal proxy query request is used to indicate to obtain an optimal proxy node of the target node;
a third obtaining unit 602, configured to obtain node information of an optimal proxy node fed back by the server;
a second sending unit 603, configured to send a client request to the optimal proxy node, so that the optimal proxy node forwards the client request to the target node;
a fourth obtaining unit 604, configured to obtain request result information of the target node forwarded by the optimal proxy node.
The network preferred agent apparatus applied to the client disclosed in the embodiments of the present application is relatively simple in description since it corresponds to the network preferred agent method applied to the client disclosed in the respective embodiments above, and for the relevant similarities, please refer to the description of the network preferred agent method portion of the client in the respective embodiments above, and details are not described here.
The embodiment of the present application further discloses a server, as shown in fig. 7, the server at least includes:
a first memory 701 for storing a first set of computer instructions;
the first set of computer instructions may specifically be implemented in the form of a computer program. The first memory 701 may include a high speed random access memory and may also include a non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid state storage device.
A first processor 702, configured to implement any network agent preference method applied to the server as provided in the above embodiments by executing the instruction set stored in the first memory.
The first processor 702 may be a Central Processing Unit (CPU), an application-specific integrated circuit (ASIC), a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device.
Besides, the server may further include a communication interface, a communication bus, and the like. The first memory, the first processor and the communication interface are communicated with each other through a communication bus.
The communication interface is used for communication between the server and other devices (such as a device corresponding to the CDN root node). The communication bus may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like, and may be divided into an address bus, a data bus, a control bus, and the like.
In this embodiment, a first processor in a server obtains an optimal proxy query request of a client to a target node by executing a first computer instruction set stored in a first memory, determines each reachable link that can be communicated to the target node according to current node link data of a service network in which the target node is located, selects at least one node that meets a node condition from each reachable link as an optimal proxy node of the target node, and finally feeds back node information of the optimal proxy node to the client, so that the client forwards the client request to the target node through the optimal proxy node. Aiming at the optimal agent query request of the client, the method makes full use of the diversity of the links of the distributed networks such as the CDN, and the optimal route based on the optimal agent is selected for the target node facing the client intelligently through data analysis, so that the stability or transmission rate of the networks such as the public network can be effectively improved, and the service quality of the networks such as the public network is improved.
The embodiment of the present application further discloses an electronic device, as shown in fig. 8, the electronic device at least includes:
a second memory 801 for storing a first set of computer instructions;
the second set of computer instructions may also be embodied in the form of a computer program.
A second processor 802 for implementing any of the network proxy preference methods applied to the client as provided by the above embodiments by executing the set of instructions stored on the second memory. .
Besides, the electronic device may further include a communication interface, a communication bus, and the like. The second memory, the second processor and the communication interface are communicated with each other through a communication bus.
The hardware structures of the second memory 801, the second processor 802, the communication bus, and the communication interface in the electronic device are similar to the hardware structures of the first memory 701, the first processor 702, the communication bus, and the communication interface in the server in the foregoing embodiments, and related similar parts may refer to the description of the server embodiment, and are not described in detail here.
In addition, the embodiment of the application also discloses an electronic device computer readable storage medium, in which a first computer instruction set is stored, and when the first computer instruction set is executed by a processor, the first computer instruction set implements any network agent preference method applied to a server as provided in the above embodiment.
The embodiment of the application also discloses another electronic device computer-readable storage medium, wherein a second computer instruction set is stored in the another computer-readable storage medium, and when being executed by a processor, the second computer instruction set realizes any network agent optimization method applied to the client side, which is provided by the above embodiment.
When the instruction sets stored in the two computer-readable storage media run, the network bandwidth and link diversity of the distributed network such as the CDN can be realized, the optimal route based on the optimal agent is intelligently selected for the client request through data analysis, the stability or transmission rate of the network such as the public network is effectively improved, and the service quality of the network such as the public network is improved.
It should be noted that, in the present specification, the embodiments are all described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments may be referred to each other.
For convenience of description, the above system or apparatus is described as being divided into various modules or units by function, respectively. Of course, the functionality of the units may be implemented in one or more software and/or hardware when implementing the present application.
From the above description of the embodiments, it is clear to those skilled in the art that the present application can be implemented by software plus necessary general hardware platform. Based on such understanding, the technical solutions of the present application may be essentially or partially implemented in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., and includes several instructions for enabling a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the embodiments or some parts of the embodiments of the present application.
Finally, it is further noted that, herein, relational terms such as first, second, third, fourth, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The foregoing is only a preferred embodiment of the present application and it should be noted that those skilled in the art can make several improvements and modifications without departing from the principle of the present application, and these improvements and modifications should also be considered as the protection scope of the present application.
Claims (15)
1. A network preferential agent method is applied to a server side and comprises the following steps:
acquiring an optimal agent query request of a client to a target node, wherein the optimal agent query request is used for indicating to acquire the optimal agent node of the target node;
acquiring current node link data of a service network where the target node is located;
determining each reachable link which can be communicated to the target node according to the node link data;
selecting at least one node meeting the node condition from each reachable link as an optimal proxy node of the target node; the at least one node is at least part of nodes positioned at the target node end on the same reachable link;
and feeding back the node information of the optimal proxy node to the client so that the client performs communication interaction with the target node through the forwarding function of the optimal proxy node.
2. The method of claim 1, wherein the obtaining current node link data of a service network where the target node is located comprises:
acquiring node link data of the service network which is acquired and reported last time;
the node link data comprises at least part of node addresses, bandwidths, operators, areas, network topology information, resource usage information, connectivity among different nodes and network delay data of all nodes in the service network.
3. The method of claim 2, wherein the network topology of the service network is tree-shaped, and the network topology information of the service network comprises hierarchical information of a node tree;
the process of collecting and reporting the node link data of the service network comprises the following steps:
sending a link probing instruction to the node tree; the node tree acquires basic link information of the service network, wherein the basic link information at least comprises hierarchical information of the node tree;
and the node tree determines dynamic link information corresponding to each node in the node tree based on the hierarchical information, and reports the dynamic link information corresponding to each node and the basic link information as node link data of the service network.
4. The method of claim 3, wherein sending link probing instructions to the node tree comprises:
sending a link probing instruction to a root node of the node tree; the root node acquires basic link information of the service network;
the node tree determines dynamic link information corresponding to each node in the node tree based on the hierarchical information, and reports the dynamic link information corresponding to each node and the basic link information as node link data of the service network, including:
the root node determines a child node of the root node according to the hierarchical information and sends the basic link data to the child node;
the child node determines the child node of the child node based on the hierarchical information in the basic link data and issues the basic link data;
repeating the process of determining the child nodes of the nodes based on the hierarchical information and sending basic link information to the downstream nodes layer by layer according to the tree structure of the node tree until the basic link information is sent to the leaf nodes of the node tree;
after obtaining the basic link information sent by the father node of the node tree, the node of the node tree determines the dynamic link information corresponding to the node, and reports the determined dynamic link information to the upstream node layer by layer according to the tree structure of the node tree until the information is reported to the root node;
and after the root node obtains the dynamic link information reported by each node, reporting the dynamic link information reported by each node and the basic link information as node link data of the service network.
5. The method of claim 3, wherein the dynamic link information corresponding to the nodes in the node tree comprises at least one of resource usage information of the nodes themselves, connectivity between the nodes and neighboring nodes, and network delay data;
and the adjacent nodes of the nodes comprise parent-child nodes and/or non-parent-child nodes meeting the position condition of the nodes in the node tree.
6. The method of claim 5, wherein determining connectivity and network delay data between a node and a neighboring node comprises:
the node and the adjacent nodes thereof send ping requests to each other;
connectivity and network delay data between the node and neighboring nodes is determined based on the ping information.
7. The method of claim 1, wherein selecting at least one node from each reachable link that meets a node condition comprises:
selecting at least one node meeting at least one of the following conditions from each reachable link:
is in the same region as the target node;
belonging to the same operator as the target node;
belonging to a different operator than the target node but in a backbone network;
the same branch in a network topology of the serving network as the target node;
the used resources meet the resource consumption condition;
the network delay with the target node satisfies the delay condition.
8. The method of claim 6, wherein the nodes in the node tree comprise node ontologies and proxy elements, and wherein the proxy elements in the nodes are configured to perform at least one of the following processes:
issuing, collecting or reporting link data of corresponding nodes;
network mutual ping processing;
and forwarding the client request of the client facing the target node.
9. A network preferential agent method is applied to a client side, and the method comprises the following steps:
sending an optimal agent query request for a target node to a server, wherein the optimal agent query request is used for indicating to acquire the optimal agent node of the target node;
acquiring node information of the optimal proxy node fed back by the server;
sending a client request to the optimal proxy node to cause the optimal proxy node to forward the client request to the target node;
and acquiring the request result information of the target node forwarded by the optimal proxy node.
10. A network preference agent apparatus, applied to a server, the apparatus comprising:
the system comprises a first obtaining unit, a second obtaining unit and a third obtaining unit, wherein the first obtaining unit is used for obtaining an optimal proxy query request of a client to a target node, and the optimal proxy query request is used for indicating to obtain an optimal proxy node of the target node;
a second obtaining unit, configured to obtain current node link data of a service network where the target node is located;
a determining unit, configured to determine, according to the node link data, each reachable link that can be communicated to the target node;
a selecting unit, configured to select at least one node that meets a node condition from each reachable link, as an optimal proxy node of the target node; the at least one node is at least part of nodes positioned at the target node end on the same reachable link;
and the feedback unit is used for feeding back the node information of the optimal proxy node to the client so that the client performs communication interaction with the target node through the forwarding function of the optimal proxy node.
11. A network preference agent apparatus applied to a client, the apparatus comprising:
the system comprises a first sending unit, a second sending unit and a third sending unit, wherein the first sending unit is used for sending an optimal proxy query request for a target node to a server, and the optimal proxy query request is used for indicating to acquire the optimal proxy node of the target node;
a third obtaining unit, configured to obtain node information of an optimal proxy node fed back by the server;
a second sending unit, configured to send a client request to the optimal proxy node, so that the optimal proxy node forwards the client request to the target node;
and the fourth obtaining unit is used for obtaining the request result information of the target node forwarded by the optimal proxy node.
12. A server, comprising:
a first memory for storing a first set of computer instructions;
a first processor arranged to implement the method of any one of claims 1 to 8 by executing a set of instructions stored on said first memory.
13. An electronic device, comprising:
a second memory for storing a second set of computer instructions;
a second processor for implementing the method of claim 9 by executing a set of instructions stored on said second memory.
14. A computer-readable storage medium having stored therein a first set of computer instructions which, when executed by a processor, implement the method of any one of claims 1-8.
15. A computer-readable storage medium having stored therein a second set of computer instructions which, when executed by a processor, implement the method of claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010542097.4A CN113810293B (en) | 2020-06-15 | 2020-06-15 | Network preferred agent method, device, electronic equipment, server and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010542097.4A CN113810293B (en) | 2020-06-15 | 2020-06-15 | Network preferred agent method, device, electronic equipment, server and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113810293A true CN113810293A (en) | 2021-12-17 |
| CN113810293B CN113810293B (en) | 2023-01-20 |
Family
ID=78892563
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010542097.4A Active CN113810293B (en) | 2020-06-15 | 2020-06-15 | Network preferred agent method, device, electronic equipment, server and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113810293B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114615706A (en) * | 2022-03-18 | 2022-06-10 | 重庆邮电大学 | Method for increasing communication capacity of micropower wireless network in smart power grid |
| CN114629919A (en) * | 2022-03-31 | 2022-06-14 | 北京百度网讯科技有限公司 | Resource acquisition method, device, equipment and storage medium |
| CN115102986A (en) * | 2022-06-15 | 2022-09-23 | 之江实验室 | Internet of things data distribution and storage method and system in edge environment |
| CN115913956A (en) * | 2022-11-30 | 2023-04-04 | 网易（杭州）网络有限公司 | Network acceleration method and device and electronic equipment |
| CN116684476A (en) * | 2023-06-13 | 2023-09-01 | 内蒙古殊征科技有限公司 | Informationized remote management system and method based on big data |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847380A (en) * | 2016-04-18 | 2016-08-10 | 乐视控股（北京）有限公司 | UDP acceleration method and system in content distribution network |
| CN107864228A (en) * | 2017-12-22 | 2018-03-30 | 网宿科技股份有限公司 | Connection method for building up and system in a kind of content distributing network |
| CN108429682A (en) * | 2018-02-26 | 2018-08-21 | 湖南科技学院 | A kind of optimization method and system of network transmission link |
| CN109150576A (en) * | 2017-06-28 | 2019-01-04 | 华为技术有限公司 | A kind of content data transmission method and equipment |
| CN111245727A (en) * | 2020-01-07 | 2020-06-05 | 深圳市网心科技有限公司 | Message routing method, electronic device, proxy node and medium based on DHT network |
-
2020
- 2020-06-15 CN CN202010542097.4A patent/CN113810293B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847380A (en) * | 2016-04-18 | 2016-08-10 | 乐视控股（北京）有限公司 | UDP acceleration method and system in content distribution network |
| CN109150576A (en) * | 2017-06-28 | 2019-01-04 | 华为技术有限公司 | A kind of content data transmission method and equipment |
| CN107864228A (en) * | 2017-12-22 | 2018-03-30 | 网宿科技股份有限公司 | Connection method for building up and system in a kind of content distributing network |
| CN108429682A (en) * | 2018-02-26 | 2018-08-21 | 湖南科技学院 | A kind of optimization method and system of network transmission link |
| CN111245727A (en) * | 2020-01-07 | 2020-06-05 | 深圳市网心科技有限公司 | Message routing method, electronic device, proxy node and medium based on DHT network |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114615706A (en) * | 2022-03-18 | 2022-06-10 | 重庆邮电大学 | Method for increasing communication capacity of micropower wireless network in smart power grid |
| CN114615706B (en) * | 2022-03-18 | 2024-04-16 | 重庆邮电大学 | Method for increasing communication capacity of micropower wireless network in smart grid |
| CN114629919A (en) * | 2022-03-31 | 2022-06-14 | 北京百度网讯科技有限公司 | Resource acquisition method, device, equipment and storage medium |
| CN115102986A (en) * | 2022-06-15 | 2022-09-23 | 之江实验室 | Internet of things data distribution and storage method and system in edge environment |
| CN115102986B (en) * | 2022-06-15 | 2023-12-01 | 之江实验室 | Internet of things data distribution and storage method and system in edge environment |
| CN115913956A (en) * | 2022-11-30 | 2023-04-04 | 网易（杭州）网络有限公司 | Network acceleration method and device and electronic equipment |
| CN116684476A (en) * | 2023-06-13 | 2023-09-01 | 内蒙古殊征科技有限公司 | Informationized remote management system and method based on big data |
| CN116684476B (en) * | 2023-06-13 | 2024-08-16 | 内蒙古殊征科技有限公司 | Informationized remote management system and method based on big data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113810293B (en) | 2023-01-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113810293B (en) | Network preferred agent method, device, electronic equipment, server and storage medium | |
| EP3528440B1 (en) | Path selection method and system, network acceleration node, and network acceleration system | |
| WO2017005223A1 (en) | Information sharing method of smart electricity meter, smart electricity meter and acquisition router | |
| US7376087B2 (en) | Method and apparatus for monitoring and displaying routing metrics of a network | |
| CN108521656B (en) | Lora communication method and system | |
| CN104717304B (en) | A kind of CDN P2P content optimizations select system | |
| JP7521005B2 (en) | Method for determining user plane function, method for providing information, device, and medium | |
| CN110890994B (en) | Method, device and system for determining message forwarding path | |
| CN101710905A (en) | Address resolution control method and system based on tactics | |
| CN103825975A (en) | Cdn node distribution server and system | |
| CN102668467A (en) | Computer system and monitoring method for computer system | |
| CN103945198A (en) | System and method for controlling streaming media route of video monitoring system | |
| CN111935780B (en) | Method for sharing traffic load in wireless mesh network and network system | |
| CN106162787B (en) | A kind of method for routing foundation and device | |
| CN101355521B (en) | Control method for equalizing load, communication apparatus and communication system | |
| WO2012065531A1 (en) | Method, device, and system for implementing relay selection | |
| CN106059861B (en) | System and method for constructing minimum dynamic aggregation tree of Internet of things in distributed mode | |
| CN107332744B (en) | Routing path selection method and system and user access server | |
| JP5871908B2 (en) | Method and system for controlling data communication within a network | |
| CN102404133A (en) | Method and device for internet protocol (IP) network data interaction | |
| CN107454647A (en) | The sending method and device of periodicity routing iinformation | |
| US20140317272A1 (en) | Method of collecting information, content network management system, and node apparatus using management interface in content network based on information-centric networking | |
| CN101547188B (en) | System and method for achieving generalized routing protocol of wireless sensor network | |
| CN116319549B (en) | Distributed flow scheduling method and device | |
| CN110460482B (en) | Traffic acquisition method, device, server and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |