CN114650296A - Information center network copy selection method - Google Patents
Information center network copy selection method Download PDFInfo
- Publication number
- CN114650296A CN114650296A CN202011508971.9A CN202011508971A CN114650296A CN 114650296 A CN114650296 A CN 114650296A CN 202011508971 A CN202011508971 A CN 202011508971A CN 114650296 A CN114650296 A CN 114650296A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- source end
- network
- replica
- 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
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload
-
- 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/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/101—Server selection for load balancing based on network conditions
-
- 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/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1021—Server selection for load balancing based on client or server locations
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention belongs to the technical field of computer networks and communication, and particularly relates to a method for selecting a network copy of an information center, which comprises the following steps: according to the distance between the data request entity and the replica source end node, different node state information maintenance and selection strategies are adopted, and the replica source end node in the distance constraint range among the nodes is preferentially selected to initiate a transmission request of the data block; aiming at a copy source end node in a distance constraint range between nodes, a data request entity maintains a node state table locally for the copy source end node; the data request entity selects a copy source end node with the best state to initiate a transmission request of a data block according to the node state value, and updates the corresponding node state value by collecting data transmission information; and aiming at the replica source end nodes outside the distance constraint range among the nodes, the node state table information is not maintained, and the replica nodes are selected only through the network distance.
Description
Technical Field
The invention belongs to the technical field of computer networks and communication, and particularly relates to a method for selecting a network copy of an information center.
Background
An Information Centric Networking (ICN) is a new network model, which is one of the research directions of future network architectures, and the network model no longer focuses on the traditional end-to-end transmission mode, but focuses on data acquisition. The ICN network decouples the identification and the address, and utilizes the in-network cache characteristic, thereby facilitating information distribution. ICN networks typically default to splitting data objects (data objects) into smaller chunks of data, each identified by a unique name EID for addressing and caching.
Since the blocks of data of an ICN network are identified by location independent EIDs rather than locators (e.g., IP), EIDs and IP mappings are required, referred to as a name resolution system. ICN network evolution has now derived a number of related projects, which mainly include two name resolution approaches: Name-Based Routing approach (NBR) and independent Name Resolution approach (SNR). Among them, the NBR method generally uses hierarchical and aggregated names, and the name resolution process is combined with message routing, such as NDN. In the SNR method, the two functions of name resolution and message routing are decoupled, and usually planar names are used to find their locators, and then the locators are used for routing (the locator IP corresponding to the name EID is queried by the name resolution system, and then the locator IP is used for routing), such as MobilityFirst.
When multiple copies of data blocks exist in the ICN network, how to select the optimal ICN network copy node for data service is a problem worthy of study. In the existing method, a nearby copy node, such as MobilityFirst, is selected in a global scope, the information maintenance cost is high, and the nearby copy is not necessarily an optimal copy; in addition, the existing method can only select from copy nodes of paths of consumers and data distribution sources, such as NDN, and can not discover superior copy nodes outside the paths. In addition, the existing method cannot optimally select the duplicate source end node, cannot balance the load of the data service source, cannot avoid network congestion, reduces the overall network throughput, increases the data transmission delay time, and reduces the data transmission efficiency.
Disclosure of Invention
In order to solve the above-mentioned defects existing in the prior art, the invention provides an information center network copy selection method, which is used for solving the problem of how to select a copy source end node after a data request entity inquires and acquires a network address list of multiple copies from a name resolution system according to a data block identifier, an ICN network divides an object into multiple data blocks, and the data request entity inquires and acquires the network address list of the multiple copies from the name resolution system according to the data block identifier and then selects the copy source end node, and is characterized in that the method comprises the following steps:
according to the distance between the data request entity and the replica source end node, different node state information maintenance and selection strategies are adopted, and the replica source end node in the distance constraint range among the nodes is preferentially selected to initiate a data block transmission request;
aiming at a copy source end node in a distance constraint range between nodes, a data request entity maintains a node state table locally for the copy source end node; the entries of the node state table include: copying the network address and the node state value of the source end node;
the method comprises the steps that a node state value is obtained through comprehensive calculation according to the node load degree of a replica source end node, the network distance from a data request entity to the replica source end node and the path congestion degree of a transmission path;
the data request entity selects a copy source end node with the best state to initiate a transmission request of the data block according to the node state value, and updates the corresponding node state value by acquiring data transmission information;
aiming at the replica source end nodes outside the distance constraint range among the nodes, the node state table information is not maintained, and the replica nodes are selected only through the network distance;
the distance constraint range between the nodes can be, but is not limited to, obtained by a field name resolution system and a global name resolution system.
As an improvement of the above technical solution, the data request entity includes an edge network device located at a junction between the information center network and another network; wherein, the edge network device at the other network boundary may be, but is not limited to, a gateway or an edge router;
the data request entity also comprises information center network terminal user equipment.
As an improvement of the above technical solution, the name resolution system receives a name resolution request from a data requesting entity, and request parameters of the name resolution request include: the data block identification information responds to a network address list of a copy source end node corresponding to the data block identification;
the name resolution system comprises: a field name resolution system and a global name resolution system;
the on-site name resolution system comprises a plurality of on-site name resolution nodes and a plurality of source end nodes, wherein the on-site name resolution nodes are used for providing name resolution service with exact distance constraint, so that an on-site resolution result obtained by a data request entity only contains duplicate source end nodes within the distance constraint range between the nodes;
the global name resolution system comprises a plurality of global name resolution nodes and a copy source end node, wherein the global name resolution nodes are used for providing name resolution service of the whole ICN network, so that a global resolution result obtained by a data request entity is contained in the whole ICN network;
the field name resolution node and the global name resolution node are resolution nodes; the distance constraint range of the field name resolution system is determined by time delay between nodes; the field analysis result is that the replica source node with the highest state value in the matching replica node state table in the node distance constraint range is used as a data service node; and the global analysis result is that the copy source end node which is out of the node distance constraint range and closest to the network distance of the data request entity in the whole ICN serves as a data service node.
As an improvement of the above technical solution, the process of acquiring the field analysis result is as follows:
initiating a name resolution query request to a field name resolution node;
judging whether an analysis query result list in a distance constraint range returned by the field name analysis node is empty or not;
if the analysis query result list is not empty, turning to the next step;
maintaining a node state table of a copy source end node corresponding to the network address list of the analysis result;
matching the replica source node with the highest state value in the replica node state table in the analysis result list to serve as a data service node, and sending a data request;
if the analysis query result list is empty, a name analysis query request is sent to the global name analysis node;
judging whether an analysis result list returned by the global name analysis node is empty, and if the returned analysis result list is not empty, turning to the next step; if the returned analysis result list is empty, returning the source end node without the service copy;
and selecting a copy source end node with the closest network distance in the global name resolution result list as a data service node, and sending a data request.
As an improvement of the above technical solution, the node load degree is determined by the service response time of the replica source node and the service load number of the data blocks of the replica source node.
As an improvement of the above technical solution, the node load degree is obtained by calculating a product of a service response time of the replica source node and a service load number of the data block of the replica source node.
As an improvement of the above technical solution, the network distance is a hop count or a round trip delay.
As an improvement of the above technical solution, the path congestion degree is determined by a queuing delay of the data packet in the transmission path;
the queuing delay can be calculated by subtracting the historical minimum transmission delay from the current transmission delay.
As an improvement of the above technical solution, the acquiring of the data transmission information includes: the data request entity actively detects a data transmission path and a copy source end node; further comprising: feedback information for each actual data transmission process.
Compared with the prior art, the invention has the beneficial effects that:
the method of the invention considers the characteristic that the data block identification is fixed and invariable in the transmission process, utilizes the copy selection strategy based on the information of node load degree, network distance, path congestion degree and the like, fully utilizes the local characteristic brought by field name analysis in the name analysis system, limits the data transmission flow in the network in the local area as much as possible, selects the copy source end node in the area, and performs copy selection by maintaining the information of three parameters of the network distance between the nodes, the load degree of the copy node and the congestion degree of the transmission path between the nodes, thereby embodying the scheduling of finer granularity. Compared with the existing method, the method has the advantages that various aspects of information of the network distance between the nodes, the load degree of the replica nodes and the congestion degree of the transmission path between the nodes are fully utilized, the maintenance task is unloaded to the edge, the calculation capacity of edge equipment (the calculation capacity of an edge router) can be effectively utilized, the node state table is maintained, the congestion condition in the network is improved, the load balance of data service is realized, the throughput of the whole network is effectively improved, the data transmission delay time is reduced, and the selection of the information center network replica is completed.
Drawings
FIG. 1 is a flow chart of an information centric network replica selection method of the present invention;
fig. 2 is a schematic view of a scene implementation of the information center network replica selection method according to the present invention.
Detailed Description
The invention will now be further described with reference to the accompanying drawings.
As shown in fig. 1, the present invention provides a method for selecting a copy of an information-centric network, in which an ICN network divides content into a plurality of data blocks, and a data request entity queries and obtains a network address list of a plurality of copies from a name resolution system according to the data block identifiers, and then selects a copy source node, the method including:
according to the distance between the data request entity and the replica source end node, different node state information maintenance and selection strategies are adopted, and the replica source end node in the distance constraint range among the nodes is preferentially selected to initiate a transmission request of the data block;
aiming at a copy source end node in a distance constraint range between nodes, a data request entity maintains a node state table locally for the copy source end node; the entries of the node state table include: copying the network address and the node state value of the source end node;
the method comprises the steps that a node state value is obtained through comprehensive calculation according to the node load degree of a replica source end node, the network distance from a data request entity to the replica source end node and the path congestion degree of a transmission path;
the data request entity selects a copy source end node with the best state to initiate a transmission request of the data block according to the node state value, and updates the corresponding node state value by acquiring data transmission information;
aiming at the replica source end nodes outside the distance constraint range among the nodes, the node state table information is not maintained, and the replica nodes are selected only through the network distance;
the distance constraint range between the nodes can be, but is not limited to, obtained by a field name resolution system and a global name resolution system. Wherein the inter-node distance constraint is the distance between the data request entity and the replica source node. For example, those replica source end nodes that are within 10 hops away or within 50ms of the network around the data requesting entity. Here, the data requesting entity is started, and the duplicate source nodes within a specific distance constraint range between the data requesting entity and the data requesting entity are obtained through respective resolving nodes (namely third-party nodes).
The data request entity comprises edge network equipment located at the junction of an information center network and other networks; wherein, the edge network device at the other network boundary may be, but is not limited to, a gateway or an edge router;
the data request entity also comprises information center network terminal user equipment.
The name resolution system receives a name resolution request from a data request entity, and request parameters of the name resolution request comprise: the data block identification information responds to a network address list of a copy source end node corresponding to the data block identification;
the name resolution system comprises: a field name resolution system and a global name resolution system;
the field name resolution system comprises a plurality of field name resolution nodes and a plurality of source end nodes, wherein the field name resolution nodes are used for providing name resolution service with exact distance constraint between the nodes, so that a field resolution result obtained by a data request entity only contains copy source end nodes within the distance constraint range between the nodes;
the global name resolution system comprises a plurality of global name resolution nodes and is used for providing name resolution service of the whole ICN network, so that a global resolution result obtained by a data request entity is only contained in a copy source end node in the whole ICN network;
the name resolution system is a distributed system and comprises a field name resolution system and a global name resolution system, wherein the field name resolution system and the global name resolution system can provide a distance constraint range between nodes; and the field name analysis node and the global name analysis node are analysis nodes. The data request entity can perform name resolution query service through one or more resolution nodes serving the data request entity.
The distance constraint range of the field name resolution system is determined by time delay between nodes; the on-site analysis result is that the replica source node with the highest state value in the matched replica node state table is used as a data service node; and the global analysis result is that the copy source end node closest to the network in the whole ICN is used as a data service node.
Specifically, if the replica source end node list is obtained from the field name resolution system, it indicates that the serviceable replica source end node in the list is within the distance constraint range between nodes of the data request entity, and therefore, the replica selection is further matched with the replica node state table from the replica source end node list, and the selection of the information network replica and the issuance of the service request are completed.
If the analysis query result of the field name analysis system is null, the data block with the request does not exist in the distance constraint range between the nodes of the data request entity (the data block is distinguished by the data block identifier), so the global name analysis system needs to be queried to obtain the copy source end nodes outside the distance constraint range between the nodes in the whole ICN network, and the copy far-point node closest to the data request entity is selected as the data service node to send out the data block service request.
Specifically, the process of acquiring the field analysis result is as follows:
initiating a name resolution query request to a field name resolution node;
judging whether an analysis query result list in a distance constraint range returned by the field name analysis node is empty or not;
if the analysis query result list is not empty, turning to the next step;
maintaining a node state table of a copy source end node corresponding to the network address list of the analysis result;
the replica source node with the highest state value in the state table of the matched replica nodes in the analysis result list is used as a data service node, and a data request is sent;
if the analysis query result list is empty, a name analysis query request is sent to the global name analysis node;
judging whether an analysis result list returned by the global name analysis node is empty, and if the returned analysis result list is not empty, turning to the next step; if the returned analysis result list is empty, returning the source end node without the service copy;
and selecting a copy source end node with the closest network distance in the global name resolution result list as a data service node, and sending a data request.
The node load degree is determined by the service response time of the replica source end node and the service load number of the data block of the replica source end node;
specifically, the node load degree is obtained by calculating the product of the service response time of the replica source end node and the service load number of the data block of the replica source end node.
The network distance is a hop count or a round trip delay.
The path congestion degree is determined by queuing delay of the data message in a transmission path;
the queuing delay can be calculated by subtracting the historical minimum transmission delay from the current transmission delay.
The acquisition of the data transmission information comprises: the data request entity actively detects a data transmission path and a copy source end node; further comprising: feedback information for each actual data transmission process.
As shown in fig. 1, the specific process of the ICN network copy selection method is as follows:
step 1) initiating a name resolution query request to a field name resolution node;
step 2) judging whether an analysis query result list in a distance constraint range returned by the field name analysis node is empty, and if the returned analysis query result list is not empty, turning to the step 3); if the returned analysis query result list is empty, turning to the step 5);
step 3) maintaining a node state table of a copy source end node corresponding to the network address list of the analysis result;
step 4) matching the replica source node with the highest state value in the replica node state table in the analysis result list to be used as a data service node, and turning to step 8);
step 5) sending a name resolution query request to a global name resolution node;
step 6) judging whether an analysis result list returned by the global name analysis node is empty, and if the returned analysis query result list is not empty, turning to the step 7); if the returned analysis query result list is empty, returning the source end node without the servable copy;
step 7) selecting a copy source end node with the closest network distance in the global name resolution result list as a data service node, and turning to step 8);
step 8) initiates a data request.
In step 3), the entry of the node state table includes: copying the network address and the node state value of the source end node;
the method comprises the steps that a node state value is obtained through comprehensive calculation according to the node load degree of a replica source end node, the network distance from a data request entity to the replica source end node and the path congestion degree of a transmission path;
specifically, the method for calculating the node state value includes:
Value＝f(Hops，Load，Congestion)
wherein Value is a node state Value; f () can be flexibly defined by an optimization goal; hops is the network distance between nodes; load is the Load degree of the replica node; congestion is the Congestion degree of a transmission path between nodes;
and evaluating the state of the replica source end node by integrating three types of parameters, preferably, the calculation method is as follows:
Value＝α*Hops+β*Load+γ*Congestion
wherein α, β, γ ∈ (0, 1), and α + β + γ ═ 1.
The data request entity selects a copy source end node with the best state to initiate a transmission request of a data block according to the node state value, and updates the corresponding node state value by collecting data transmission information;
as shown in fig. 2, a specific embodiment example of a copy selection method for an ICN network includes the following steps:
(1) after the data distribution source generates the data blocks divided by the object, the data block chunk1 is distributed;
(2) the end User1 requests to obtain chunk1, constructs data request message request #1 of data identifier EID1, analysis limit condition RTT <200ms and destination address as network address of data issuing source, that is, the data request message includes: a data block identifier (not called ID1), a distance constraint range of field name resolution, also called a constraint condition (not set to 200ms), and a destination address as a network address of a data distribution source (here, an IP address of a source in fig. 2); after receiving the data request message, the edge router NA6 initiates an analysis request of the EID1 to the field analysis node ENRS1, and when the field analysis node 1 detects that no data source node storing chunk1 exists within RTT <200ms, the returned field analysis result is null; the edge router will continue to initiate a resolution query request of ID1 to the global name resolution node (not shown in fig. 2), and receive only one global resolution result (note: if not, one is selected by using the policy with the closest network distance), which is the network address of the source; the network address of the source is unified with the original destination address of the request message request #1, so that the edge router NA6 receiving the request #1 directly forwards the data message without modifying the destination address of the data request message; the data issuing source replies to chunk1 after receiving the request; assuming that all routers with cache capability in the transmission path cache the data block successfully, namely NA1, NA4, NA6 cache chunk 1;
(3) the method comprises the steps that an end User2 requests to acquire a chunk1, an edge router NA5 receives a data request message request # 2 with a destination address being a network address of chunk1, initiates request analysis for analyzing an EID1 to a field analysis node ENRS1, receives NA4 and NA6, caches the network address of the router with the chunk1, and the edge router NA5 inquires state values of NA4 and NA6, namely 7.4 and 8.1, in a node state table and initiates a data request to NA4 with the best state (namely the lowest state value);
(4) the edge router NA5 updates the node status table according to the feedback information of the transmission result. All edge routers in the ICN network maintain the node state table and perform a complete copy selection operation.
Finally, it should be noted that the above embodiments are only used for illustrating the technical solutions of the present invention and are not limited. Although the present invention has been described in detail with reference to the embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (9)
1. An ICN network divides an object into a plurality of data blocks, and a data request entity inquires and acquires a network address list of a plurality of copies from a name resolution system according to the data block identification and then selects a copy source end node, wherein the method comprises the following steps:
according to the distance between the data request entity and the replica source end node, different node state information maintenance and selection strategies are adopted, and the replica source end node in the distance constraint range among the nodes is preferentially selected to initiate a transmission request of the data block;
aiming at a copy source end node in a distance constraint range between nodes, a data request entity maintains a node state table locally for the copy source end node; the entries of the node state table include: copying the network address and the node state value of the source end node;
the method comprises the steps that a node state value is obtained through comprehensive calculation according to the node load degree of a replica source end node, the network distance from a data request entity to the replica source end node and the path congestion degree of a transmission path;
the data request entity selects a copy source end node with the best state to initiate a transmission request of a data block according to the node state value, and updates the corresponding node state value by collecting data transmission information;
aiming at the replica source end nodes outside the distance constraint range among the nodes, the node state table information is not maintained, and the replica nodes are selected only through the network distance;
the distance constraint range between the nodes can be, but is not limited to, obtained by a field name resolution system and a global name resolution system.
2. The information-centric network replica selection method according to claim 1, wherein the data request entity comprises an edge network device located at a junction of the information-centric network and another network; wherein, the edge network device at the other network boundary may be, but is not limited to, a gateway or an edge router;
the data request entity also comprises information center network terminal user equipment.
3. The information-centric network replica selection method of claim 1, wherein the name resolution system receives a name resolution request from a data requesting entity, request parameters of the name resolution request comprising: the data block identification information responds to a network address list of a copy source end node corresponding to the data block identification;
the name resolution system comprises: a field name resolution system and a global name resolution system;
the on-site name resolution system comprises a plurality of on-site name resolution nodes and a plurality of source end nodes, wherein the on-site name resolution nodes are used for providing name resolution service with exact distance constraint, so that an on-site resolution result obtained by a data request entity only contains duplicate source end nodes within the distance constraint range between the nodes;
the global name resolution system comprises a plurality of global name resolution nodes and a copy source end node, wherein the global name resolution nodes are used for providing name resolution service of the whole ICN network, so that a global resolution result obtained by a data request entity is contained in the whole ICN network;
the field name resolution node and the global name resolution node are resolution nodes; the distance constraint range of the field name resolution system is determined by time delay between nodes; the field analysis result is that the replica source node with the highest state value in the matching replica node state table in the node distance constraint range is used as a data service node; and the global analysis result is that the source end node of the copy, which is outside the node distance constraint range and closest to the network distance of the data request entity, in the whole ICN is used as a data service node.
4. The information center network replica selection method according to claim 3, wherein the process of obtaining the field analysis result is as follows:
initiating a name resolution query request to a field name resolution node;
judging whether an analysis query result list in a distance constraint range returned by the field name analysis node is empty or not;
if the analysis query result list is not empty, turning to the next step;
maintaining a node state table of a copy source end node corresponding to the network address list of the analysis result;
matching the replica source node with the highest state value in the replica node state table in the analysis result list to serve as a data service node, and sending a data request;
if the analysis query result list is empty, a name analysis query request is sent to the global name analysis node;
judging whether an analysis result list returned by the global name analysis node is empty, and if the returned analysis result list is not empty, turning to the next step; if the returned analysis result list is empty, returning the source end node without the service copy;
and selecting a copy source end node with the closest network distance in the global name resolution result list as a data service node, and sending a data request.
5. The information-centric network replica selection method of claim 1, wherein the node load degree is determined by a service response time of the replica source node and a data block service load number of the replica source node.
6. The information-centric network replica selection method of claim 5, wherein the node load degree is calculated from a product of a service response time of the replica source node and a data block service load number of the replica source node.
7. The information-centric network replica selection method according to claim 1, wherein the network distance is a hop count or a round trip delay.
8. The method of claim 1, wherein the path congestion level is determined by a queuing delay of the data packet in the transmission path;
the queuing delay can be calculated by subtracting the historical minimum transmission delay from the current transmission delay.
9. The information-centric network replica selection method according to claim 1, wherein the collecting of the data transmission information comprises: the data request entity actively detects a data transmission path and a copy source end node; further comprising: feedback information for each actual data transmission process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011508971.9A CN114650296B (en) | 2020-12-18 | 2020-12-18 | Information center network copy selection method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011508971.9A CN114650296B (en) | 2020-12-18 | 2020-12-18 | Information center network copy selection method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114650296A true CN114650296A (en) | 2022-06-21 |
| CN114650296B CN114650296B (en) | 2023-03-24 |
Family
ID=81991048
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011508971.9A Active CN114650296B (en) | 2020-12-18 | 2020-12-18 | Information center network copy selection method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114650296B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101800771A (en) * | 2010-01-29 | 2010-08-11 | 北京理工大学 | Copy selection method based on kernel density estimation |
| CN102984188A (en) * | 2011-09-06 | 2013-03-20 | 中国科学院声学研究所 | Content replica placement method and content replica placement system used in content delivery network (CDN) |
| CN105208616A (en) * | 2015-06-17 | 2015-12-30 | 重庆邮电大学 | Road topology based adaptive multi-copy routing method in vehicular ad hoc network |
| CN105393597A (en) * | 2014-05-07 | 2016-03-09 | 华为技术有限公司 | Network congestion control method and controller |
| US20170048313A1 (en) * | 2013-12-03 | 2017-02-16 | Beijing Jingdong Shangke Information Technology Co, Ltd. | Data copy storage method, terminal apparatus, and server apparatus |
| CN106789632A (en) * | 2017-02-25 | 2017-05-31 | 郑州云海信息技术有限公司 | A kind of method of the node-routing of large-scale distributed storage system |
| CN108347379A (en) * | 2018-02-12 | 2018-07-31 | 重庆邮电大学 | Based on the centrally stored content center network method for routing in region |
| CN108768852A (en) * | 2018-04-02 | 2018-11-06 | 华南理工大学 | Chance routing algorithm based on more copy Congestion Avoidances in a kind of car networking |
| CN111124762A (en) * | 2019-12-30 | 2020-05-08 | 航天科工网络信息发展有限公司 | Dynamic copy placing method based on improved particle swarm optimization |
-
2020
- 2020-12-18 CN CN202011508971.9A patent/CN114650296B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101800771A (en) * | 2010-01-29 | 2010-08-11 | 北京理工大学 | Copy selection method based on kernel density estimation |
| CN102984188A (en) * | 2011-09-06 | 2013-03-20 | 中国科学院声学研究所 | Content replica placement method and content replica placement system used in content delivery network (CDN) |
| US20170048313A1 (en) * | 2013-12-03 | 2017-02-16 | Beijing Jingdong Shangke Information Technology Co, Ltd. | Data copy storage method, terminal apparatus, and server apparatus |
| CN105393597A (en) * | 2014-05-07 | 2016-03-09 | 华为技术有限公司 | Network congestion control method and controller |
| CN105208616A (en) * | 2015-06-17 | 2015-12-30 | 重庆邮电大学 | Road topology based adaptive multi-copy routing method in vehicular ad hoc network |
| CN106789632A (en) * | 2017-02-25 | 2017-05-31 | 郑州云海信息技术有限公司 | A kind of method of the node-routing of large-scale distributed storage system |
| CN108347379A (en) * | 2018-02-12 | 2018-07-31 | 重庆邮电大学 | Based on the centrally stored content center network method for routing in region |
| CN108768852A (en) * | 2018-04-02 | 2018-11-06 | 华南理工大学 | Chance routing algorithm based on more copy Congestion Avoidances in a kind of car networking |
| CN111124762A (en) * | 2019-12-30 | 2020-05-08 | 航天科工网络信息发展有限公司 | Dynamic copy placing method based on improved particle swarm optimization |
Non-Patent Citations (2)
| Title |
|---|
| 于莉: "结构化P2P网络中基于副本的负载均衡方法研究", 《南京邮电大学学报(自然科学版)》 * |
| 徐佳等: "一种最优化期望时延的容迟网络副本分发协议", 《仪器仪表学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114650296B (en) | 2023-03-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7664876B2 (en) | System and method for directing clients to optimal servers in computer networks | |
| AU778459B2 (en) | Method for high-performance delivery of web content | |
| US6687731B1 (en) | Arrangement for load sharing in computer networks | |
| US20150039784A1 (en) | Scalable Name-Based Centralized Content Routing | |
| US20030200307A1 (en) | System and method for information object routing in computer networks | |
| US10554555B2 (en) | Hash-based overlay routing architecture for information centric networks | |
| CN103329487A (en) | Method and router for service named routing | |
| JP2003256310A (en) | Server load decentralizing system, server load decentralizing apparatus, content management apparatus and server load decentralizing program | |
| CN105162900A (en) | Multi-node collaborative domain name resolution and caching method and system | |
| US10536368B2 (en) | Network-aware routing in information centric networking | |
| WO2017071591A1 (en) | Icn based distributed resource directory for iot resource discovery and routing | |
| JP4460693B2 (en) | Network system with information retrieval function | |
| CN116866953A (en) | Data transmission system and method | |
| CN114650296B (en) | Information center network copy selection method | |
| EP1433077B1 (en) | System and method for directing clients to optimal servers in computer networks | |
| CN114500374B (en) | Message route forwarding method adopting destination address changed along with route | |
| CN108449281B (en) | Network flow cooperative unloading method and cooperative unloading controller | |
| Deepa et al. | Routing Scalability in Named Data Networking | |
| CN113660162B (en) | Semi-centralized routing method and system for proximity cache perception | |
| Dong et al. | Offloading Semantic Mashup by On-Path Routers for IoT Applications | |
| Meng et al. | Elastic caching solutions for content dissemination services elastic caching solutions for content dissemination services of ip-based internet technologies prospective | |
| CN116233147A (en) | Efficient edge caching method based on NDN | |
| ZA200206147B (en) | Method for high-performance delivery of web content. |
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 |