CN108200186B - Method and device for updating data deployment - Google Patents
Method and device for updating data deployment Download PDFInfo
- Publication number
- CN108200186B CN108200186B CN201810038853.2A CN201810038853A CN108200186B CN 108200186 B CN108200186 B CN 108200186B CN 201810038853 A CN201810038853 A CN 201810038853A CN 108200186 B CN108200186 B CN 108200186B
- Authority
- CN
- China
- Prior art keywords
- data
- data center
- user
- sequence
- requested
- 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.)
- Active
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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0813—Configuration setting characterised by the conditions triggering a change of settings
-
- 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/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
-
- 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/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method and a device for updating data deployment. A method of updating a data deployment, comprising: sequencing the data centers according to the sequence that the total consumption of the data centers is from small to large when each user accesses data of each data user in a set time period to obtain a data center sequence; when a user requests data, sequentially searching the data requested by the user from a first data center of the data center sequence; and if the data requested by the user is not found after traversing the set number of data centers, copying the data requested by the user from a database to any one of the set number of data centers of the data center sequence. By adopting the technical scheme, the overall consumption of the data center when the user requests data can be reduced.
Description
Technical Field
The invention relates to the technical field of internet, in particular to a method and a device for updating data deployment.
Background
Multimedia video companies need to provide video services to users distributed around the world, and thus the multimedia video companies need to deploy video data in data centers so that users request data from the data centers. When video data is deployed, network delay is an important measurement index, meanwhile, the problem of energy consumption is more and more concerned by the industry, and the reduction of energy consumption of a server for deploying data can also reduce the operation cost of a company. In addition, the environmental protection problem in the current society has always received public attention. On the premise of ensuring user delay and data deployment energy consumption, the method also has important significance in reducing the carbon emission of corresponding energy consumption of a server for deploying data. Based on the above consideration, when data is deployed, the data is deployed based on network delay, data center energy consumption and carbon emission corresponding to the data center energy consumption (collectively referred to as total consumption), so that an optimal data deployment effect can be achieved, and the data deployment energy consumption and the carbon emission corresponding to the energy consumption are reduced on the premise of reducing the network delay.
The process realizes the initial stage of data deployment, namely, the data is deployed to the data center according to the total consumption of the data center. However, in the process of requesting data from a data center by an actual user, the access situation to the data center is varied. For example, although the amount of data deployed to the data center with higher overall consumption is small, if the data deployed to the data center with higher overall consumption becomes hot data, at this time, if a large number of users request the data, a large number of users request the data from the data center with higher overall consumption, which undoubtedly greatly increases energy consumption for requesting the data by the users. Therefore, in the operation process after the data deployment, the data deployment of the data center should be updated based on the actual user access condition, so as to reduce the overall consumption of the data center in the process of requesting data by the user.
Disclosure of Invention
Based on the defects and shortcomings of the prior art, the invention provides a method and a device for updating data deployment, which can update the data deployment of a data center and reduce the total consumption of the data center in the process of requesting data by a user.
In order to achieve the purpose, the invention provides the following technical scheme:
a method of updating a data deployment, comprising:
sequencing the data centers according to the sequence that the total consumption of the data centers is from small to large when a user accesses data in a set time period to obtain a data center sequence;
when a user requests data, sequentially searching the data requested by the user from a first data center of the data center sequence;
and if the data requested by the user is not found after traversing the set number of data centers, copying the data requested by the user from a database to any one of the set number of data centers of the data center sequence.
Preferably, the copying the data requested by the user from the database to any one of the set number of data centers of the data center sequence includes:
and copying the data requested by the user from a database to a first data center of the data center sequence.
Preferably, the method further comprises:
respectively setting decreasing parameters for each item of data in each data center;
when any data of the data center is requested, setting the value of the decreasing parameter of the requested data as an initial value, and respectively decreasing the value of the decreasing parameter of each data except the requested data in the data center where the requested data is located by 1;
when the value of the decreasing parameter of any data in the data center where the requested data is located is 0, the data center is removed from the data center, wherein the value of the decreasing parameter is 0.
Preferably, the sorting the data centers according to the order from small to large of the total consumption of the data centers when the user accesses the data within the set time period to obtain the data center sequence includes:
and sequencing the data centers according to the sequence from small to large of the sum of the network delay, the electric energy consumption and the carbon emission of each data center when a user accesses data in a set time period to obtain a data center sequence.
Preferably, when the user accesses the data within the set time period, the data centers are sorted in the order from small to large according to the sum of the network delay, the power consumption, and the carbon emission of each data center, so as to obtain a data center sequence, where the data center sequence includes:
respectively calculating the sum of network delay, electricity consumption and carbon emission of each data center when a user accesses data in a set time period according to the following formula:
wherein λ is1，λ2And λ3Network delay of user access data and data center electricityWeight of energy consumption and carbon emissions; dkData representing a user request; u. ofiRepresenting a group of users requesting data; dcjA data center representing a user group requesting data; l (u)i,dcj,dk) Representing user groups uiRequesting data center dcjData d in (1)kNetwork delay of (2); c(s)m,dcj) Representing data centres dcjServer s inmThe capacity of (a);
representing data centres dcjCarbon emissions of (d);
denoted as data centre dcjThe consumption of electric energy of; cost (u)i,dk,nj) Representing data centres dcjThe sum of network delay, electricity cost consumption, and carbon emissions; i. j, m and k are natural numbers respectively;
and sequencing the data centers according to the sequence from small to large of the sum of the network delay, the electricity consumption and the carbon emission of each data center obtained through calculation to obtain a data center sequence.
An apparatus to update a data deployment, comprising:
the sequencing processing unit is used for sequencing the data centers according to the sequence that the total consumption of the data centers is from small to large when a user accesses data in a set time period to obtain a data center sequence;
the data searching unit is used for sequentially searching the data requested by the user from the first data center of the data center sequence when the user requests the data;
and the data copying unit is used for copying the data requested by the user from a database to any one of the data centers with the set number in the data center sequence when the data requested by the user is not found after the data centers with the set number are traversed.
Preferably, when the data replication unit replicates the data requested by the user from the database to any one of the set number of data centers of the data center sequence, the data replication unit is specifically configured to:
and copying the data requested by the user from a database to a first data center of the data center sequence.
Preferably, the apparatus further comprises:
the data deleting unit is used for respectively setting decreasing parameters for each item of data in each data center; when any data of the data center is requested, setting the value of the decreasing parameter of the requested data as an initial value, and respectively decreasing the value of the decreasing parameter of each data except the requested data in the data center where the requested data is located by 1; when the value of the decreasing parameter of any data in the data center where the requested data is located is 0, the data center is removed from the data center, wherein the value of the decreasing parameter is 0.
Preferably, the sorting processing unit sorts the data centers in order from small to large total consumption of the data centers when the user accesses the data within a set time period, and when a data center sequence is obtained, the sorting processing unit is specifically configured to:
and sequencing the data centers according to the sequence from small to large of the sum of the network delay, the electric energy consumption and the carbon emission of each data center when a user accesses data in a set time period to obtain a data center sequence.
Preferably, the sorting processing unit sorts the data centers in order from small to large according to the sum of network delay, power consumption, and carbon emission of each data center when a user accesses data within a set time period, and when a data center sequence is obtained, the sorting processing unit is specifically configured to:
respectively calculating the sum of network delay, electricity consumption and carbon emission of each data center when a user accesses data in a set time period according to the following formula:
wherein λ is1，λ2And λ3Respectively weighting network delay of user access data, power consumption of a data center and carbon emission; dkData representing a user request; u. ofiRepresenting a group of users requesting data; dcjA data center representing a user group requesting data; l (u)i,dcj,dk) Representing user groups uiRequesting data center dcjData d in (1)kNetwork delay (average); c(s)m,dcj) Representing data centres dcjServer s inmThe capacity of (a);
representing data centres dcjCarbon emissions (average);
denoted as data centre dcjElectrical energy consumption (average); cost (u)i,dk,nj) Representing data centres dcjThe sum of network delay, electricity cost consumption, and carbon emissions; i. j, m and k are natural numbers respectively;
and sequencing the data centers according to the sequence from small to large of the sum of the network delay, the electricity consumption and the carbon emission of each data center obtained through calculation to obtain a data center sequence.
When the technical scheme of the embodiment of the invention is adopted to request data, a user can request the data from the data center with small overall consumption, the data deployment of the data center is updated in the process of requesting the data by the user, and the data requested by the user is deployed to the data center with small overall consumption, so that the overall consumption of the data center when the user requests the data can be reduced.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a schematic flowchart of a method for updating data deployment according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating another method for updating data deployment according to an embodiment of the present invention;
FIG. 3 is a schematic structural diagram of an apparatus for updating data deployment according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of another apparatus for updating data deployment according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, 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 invention.
The embodiment of the invention discloses a method for updating data deployment, which is shown in figure 1 and comprises the following steps:
s101, sequencing all data centers according to a sequence that the total consumption of all the data centers is from small to large when a user accesses data in a set time period to obtain a data center sequence;
specifically, the data center is a distributed cloud data center. In the embodiment of the invention, the total consumption is the energy consumption sum calculated by integrating the access delay of the user for accessing the data of the cloud data center, the energy consumption of the servers in the cloud data center and the power generation carbon emission corresponding to the electric energy consumed by each server.
In a distributed cloud data center architecture, data required by a user is stored in servers of a plurality of different data centers. When a user requests data, the user needs to access the data center and request the required data from the server of the data center storing the required data. The above-described overall consumption occurs when a user requests data by accessing a data center server.
According to the embodiment of the invention, the total consumption of a data center is determined when each user accesses the data center within a set time period according to the historical records of the users accessing the data center. After the total consumption of each data center in the set time period is obtained through calculation, the data centers are sorted according to the total consumption of the data centers from small to large to obtain a data center sequence.
Optionally, in another embodiment of the present invention, the sorting the data centers according to a sequence that total consumption of the data centers is from small to large when a user accesses data within a set time period to obtain a data center sequence includes:
and sequencing the data centers according to the sequence from small to large of the sum of the network delay, the electric energy consumption and the carbon emission of each data center when each user accesses each data user access data in a set time period to obtain a data center sequence.
Specifically, the embodiment of the invention provides specific factors for calculating the overall consumption of the data center, namely calculating the overall consumption of the data center according to the network delay, the electric energy consumption and the carbon emission of the data center. And summing the network delay, the electric energy consumption and the carbon emission of the data center to obtain the total consumption of the data center. The summation of the network delay, the power consumption, and the carbon emission of the data center is not limited to a simple direct addition, and may be performed by summing the network delay, the power consumption, and the carbon emission of the data center according to a weight. After the total consumption of the data centers is obtained, the data centers are sequenced according to the sequence of the total consumption of the data centers from small to large, and then the data center sequence is obtained.
The network delay is the network delay of a user for accessing the data center to request data; the power consumption is power consumed when the data center server runs after data is deployed; the carbon emission is carbon emission caused by electric energy used in the data center. In some regions, the electric energy used is generated by hydroelectric power generation, and in some regions, the electric energy is generated by coal-fired power generation, so that the carbon emission amount of each data center of the distributed data center may be different. The invention respectively calculates the network delay, the electric energy consumption and the carbon emission aiming at each data center to obtain the total consumption of each data center.
Optionally, in another embodiment of the present invention, as shown in fig. 2, when the user accesses data within a set time period, the data centers are sorted according to a descending order of a sum of network delay, power consumption, and carbon emission of each data center, so as to obtain a data center sequence, where the data center sequence specifically includes:
s201, respectively calculating the sum of network delay, electricity consumption and carbon emission of each data center when a user accesses data in a set time period according to the following formula:
wherein λ is1，λ2And λ3Respectively weighting network delay of user access data, power consumption of a data center and carbon emission; dkData representing a user request; u. ofiThe user group requesting data is represented, and for a data center, a plurality of users requesting certain data at the same time can be represented by the user group; dcjA data center representing a user group requesting data; l (u)i,dcj,dk) Representing user groups uiRequesting data center dcjData d in (1)kNetwork delay (average); c(s)m,dcj) Representing data centres dcjServer s inmThe capacity of (a);
representing data centres dcjCarbon emissions (average);
denoted as data centre dcjElectrical energy consumption (average); cost (u)i,dk,nj) Representing data centres dcjThe sum of network delay, electricity cost consumption, and carbon emissions; in the formula, i, j, m and k are natural numbers respectively, and the size of the technical scheme can be set according to the actual situation when the technical scheme of the embodiment of the invention is actually implemented, wherein lambda is1，λ2And λ3The value of (2) can also be flexibly set according to actual requirements. The network delay, the data center power consumption and the carbon emission in the above formula are determined in advance according to a large amount of data summary measurement.
Specifically, the calculation formula provided in the embodiment of the present invention is a comprehensive calculation formula that combines all data requested by the user, all user groups requesting data, and a data center for each user group requesting data. And when the i, the j and the k respectively take different values, the sum of network delay, electricity consumption and carbon emission of different data requested by different data centers respectively represents different user groups. Wherein the sum of the above-mentioned network delay, electricity consumption, and carbon emission amount is calculated as an average value, respectively.
For each data center, the total consumption of each user group for requesting each data can be calculated according to the above calculation formula.
It should be noted that, since the user request data is continuously performed, the above calculation formula is a calculation formula applied to the set time period, that is, a value of the above formula in the set time period is calculated.
S202, sequencing the data centers according to the sequence from small to large of the sum of the network delay, the electricity consumption and the carbon emission of the data centers obtained through calculation, and obtaining a data center sequence.
Specifically, after the total consumption of each data center in the set time period is calculated, the data centers are further sorted according to the sequence of the total consumption of the data centers from small to large to obtain a data center sequence.
It should be noted that steps S203 to S204 in the embodiment shown in fig. 2 correspond to steps S102 to S103 in the method embodiment shown in fig. 1, and for specific content, please refer to the content of the method embodiment shown in fig. 1, which is not described herein again.
When a user requests data, executing step S102, and sequentially searching the data requested by the user from the first data center of the data center sequence;
when a user requests data, a data request is initiated to a data center, and at this time, the embodiment of the present invention starts from the first data center of the data center sequence, sequentially traverses each data center of the data center sequence, and searches for the data requested by the user.
And if the server of the traversed current data center does not have the data requested by the user, continuously traversing the next data center of the data center sequence, searching the server for the data requested by the user, and the like.
If the data requested by the user is not found after traversing the set number of data centers, step S103 is executed to copy the data requested by the user from the database to any one of the set number of data centers of the data center sequence.
In particular, as the traversed data centers become more and more located back in the data center sequence, the overall consumption of the traversed data centers increases. When the data centers with the set number are traversed, the data requested by the user still cannot be found, the embodiment of the invention does not continue to traverse the data centers in the data center sequence, because the later traversal, the higher the overall consumption of the data centers. Even if the data requested by the user is found, the total consumption of the data requested from the data center is high, and the requirements of reducing the time delay of the data requested by the user and the energy consumption of the data center cannot be met.
In this case, the embodiment of the present invention does not continue to traverse the data sequence in the data center sequence, but copies the data requested by the user from the database to any one of the data centers in the data center sequence that have been traversed.
Since the overall consumption of data centers in a data center sequence is ordered from small to large, the overall consumption of a set number of data centers that have been traversed is lower relative to the overall consumption of data centers that have not been traversed. The embodiment of the invention copies the data requested by the user to any data center which has already been traversed and has relatively low overall consumption, and enables the user to request the data from the data center, and the overall consumption of the data requested by the user can be reduced compared with the situation that the data center is continuously traversed and the data center with larger overall consumption is subsequently requested.
It should be noted that the set number can be flexibly set according to the efficiency requirement of the user for requesting data and the speed of traversing the data center. Theoretically, the smaller the set number is, the more beneficial the traversal time is and the overall consumption of the data center caused by the data request of the user is, but the load of the data center is also increased by copying a large amount of data to a small number of data centers, so the set number is set by considering the actual requirement and the processing capacity of the data center comprehensively.
Optionally, in another embodiment of the present invention, when the data requested by the user is copied from the database to any one of the set number of data centers of the data center sequence, the data requested by the user is specifically copied from the database to the first data center of the data center sequence.
Specifically, since the data centers in the data center sequence are arranged in the order of overall consumption from small to large, the first data center in the data center sequence is the data center with the smallest overall consumption. In the embodiment of the invention, the data requested by the user is copied from the database to the first data center of the data center sequence, so that when the user requests the data, the data requested by the user can be searched when traversing to the first data center of the data center sequence, the time for traversing the data center sequence can be greatly saved, and the overall consumption of the user for requesting the data from the data center is minimized.
Optionally, in another embodiment of the present invention, after the total consumption of each data center is obtained through calculation and the data center sequences are obtained according to the sequence from small to large of the total consumption, decreasing parameters are further respectively set for each item of data in each data center in the data center sequences;
when any data of the data center is requested, setting the value of the decreasing parameter of the requested data as an initial value, and respectively decreasing the value of the decreasing parameter of each data except the requested data in the data center where the requested data is located by 1;
when the value of the decreasing parameter of any data in the data center where the requested data is located is 0, the data center is removed from the data center, wherein the value of the decreasing parameter is 0.
Specifically, for a certain data center, when a user requests any certain data from the data center, the value of the decreasing parameter of the data is set as an initial value, and the value of the decreasing parameter of each of the other data of the data center is respectively decreased by 1. When the decreasing parameter of a certain item of data in the data center is reduced to 0, the data is removed from the data center.
Based on the setting, in the user data requests of the times represented by the initial value of the decreasing parameter, if no data item of the data center is requested, the decreasing parameter of the data is decreased to 0, which indicates that the data is not frequently requested by the user, and the data is removed from the data center, so as to reduce the load of data deployment of the data center. When the user requests the removed data, the data is copied from the database to a certain data center. The data requested in the user data request of the number of times represented by the initial value of the decreasing parameter can be regarded as data frequently requested by the user, and the decreasing parameter is reset, so that the data is not reduced to 0, and the data is not removed from the data center.
According to the technical scheme, the data deployed in the data center can be guaranteed to be the data frequently requested by the user, and for the data not frequently requested by the user, when the user requests, the data is temporarily copied to the data center according to the processing of the step S103 in the embodiment. This can reduce the load and energy consumption of data center deployment data.
It can be seen from the above description that, when the technical solution of the embodiment of the present invention is adopted to request data, a user is controlled to request from a data center with small overall consumption, and in the process of requesting data by the user, the data deployment of the data center is updated, and the data is deployed to the data center with small overall consumption, so that the overall consumption of the data center when the user requests data can be reduced.
The embodiment of the present invention also discloses a device for updating data deployment, as shown in fig. 3, the device includes:
the sequencing processing unit 100 is configured to sequence the data centers in a descending order of total consumption of the data centers when a user accesses data within a set time period to obtain a data center sequence;
the data searching unit 110 is configured to, when a user requests data, sequentially search for the data requested by the user from a first data center of the data center sequence;
the data copying unit 120 is configured to copy the data requested by the user from the database to any one of the data centers in the set number of data centers of the data center sequence when the data requested by the user is not found after a set number of data centers are traversed.
Specifically, please refer to the contents of the above method embodiments for the specific working contents of each unit in this embodiment, which are not described herein again.
Optionally, in another embodiment of the present invention, when the data copying unit 120 copies the data requested by the user from the database to any one of the set number of data centers of the data center sequence, the data copying unit is specifically configured to:
and copying the data requested by the user from a database to a first data center of the data center sequence.
Specifically, please refer to the contents of the above method embodiments for the specific working contents of the data copying unit 120 in this embodiment, which are not described herein again.
Optionally, in another embodiment of the present invention, referring to fig. 4, the apparatus further includes:
a data deletion unit 130 for setting a decreasing parameter for each item of data in the respective data centers, respectively; when any data of the data center is requested, setting the value of the decreasing parameter of the requested data as an initial value, and respectively decreasing the value of the decreasing parameter of each data except the requested data in the data center where the requested data is located by 1; when the value of the decreasing parameter of any data in the data center where the requested data is located is 0, the data center is removed from the data center, wherein the value of the decreasing parameter is 0.
Specifically, please refer to the contents of the method embodiments in detail for the specific working contents of the data deleting unit 130 in this embodiment, which is not described herein again.
Optionally, in another embodiment of the present invention, when the sorting processing unit 100 sorts the data centers in order that the total consumption of the data centers is from small to large when the user accesses the data within a set time period, and obtains a data center sequence, the method is specifically configured to:
and sequencing the data centers according to the sequence from small to large of the sum of the network delay, the electric energy consumption and the carbon emission of each data center when a user accesses data in a set time period to obtain a data center sequence.
Specifically, please refer to the contents of the above method embodiments for the specific working contents of the sorting processing unit 100 in this embodiment, which are not described herein again.
Optionally, in another embodiment of the present invention, when the sorting processing unit 100 sorts the data centers according to a descending order of the sum of network delay, power consumption, and carbon emission of each data center when a user accesses data within a set time period, and when a data center sequence is obtained, the data center sequence is specifically configured to:
respectively calculating the sum of network delay, electricity consumption and carbon emission of each data center when a user accesses data in a set time period according to the following formula:
wherein λ is1，λ2And λ3Respectively weighting network delay of user access data, power consumption of a data center and carbon emission; dkData representing a user request; u. ofiRepresenting a group of users requesting data; dcjA data center representing a user group requesting data; l (u)i,dcj,dk) Representing user groups uiRequesting data center dcjData d in (1)kNetwork delay (average); c(s)m,dcj) Representing data centres dcjServer s inmThe capacity of (a);
representing data centres dcjCarbon emissions (average);
denoted as data centre dcjElectrical energy consumption (average); cost (u)i,dk,nj) Representing data centres dcjThe sum of network delay, electricity cost consumption, and carbon emissions; i. j, m and k are natural numbers respectively;
and sequencing the data centers according to the sequence from small to large of the sum of the network delay, the electricity consumption and the carbon emission of each data center obtained through calculation to obtain a data center sequence.
Specifically, please refer to the contents of the above method embodiments for the specific working contents of the sorting processing unit 100 in this embodiment, which are not described herein again.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A method of updating a data deployment, comprising:
sequencing the data centers according to the sequence that the total consumption of the data centers is from small to large when a user accesses data in a set time period to obtain a data center sequence;
when a user requests data, sequentially searching the data requested by the user from a first data center of the data center sequence;
and if the data requested by the user is not found after traversing the set number of data centers, copying the data requested by the user from a database to any one of the set number of data centers of the data center sequence.
2. The method of claim 1, wherein the copying the user-requested data from a database to any one of the set number of data centers of the sequence of data centers comprises:
and copying the data requested by the user from a database to a first data center of the data center sequence.
3. The method of claim 1, further comprising:
respectively setting decreasing parameters for each item of data in each data center;
when any data of the data center is requested, setting the value of the decreasing parameter of the requested data as an initial value, and respectively decreasing the value of the decreasing parameter of each data except the requested data in the data center where the requested data is located by 1;
when the value of the decreasing parameter of any data in the data center where the requested data is located is 0, the data center is removed from the data center, wherein the value of the decreasing parameter is 0.
4. The method according to claim 1, wherein the sorting the data centers in order of the total consumption of the data centers from small to large when the user accesses the data within a set time period to obtain a data center sequence comprises:
and sequencing the data centers according to the sequence from small to large of the sum of the network delay, the electric energy consumption and the carbon emission of each data center when a user accesses data in a set time period to obtain a data center sequence.
5. The method according to claim 4, wherein the sorting of the data centers according to the descending order of the sum of network delay, power consumption and carbon emission of the data centers when a user accesses data within a set time period to obtain a data center sequence comprises:
respectively calculating the sum of network delay, electricity consumption and carbon emission of each data center when a user accesses data in a set time period according to the following formula:
wherein λ is1，λ2And λ3Respectively weighting network delay of user access data, power consumption of a data center and carbon emission; dkFor indicatingData requested by the user; u. ofiRepresenting a group of users requesting data; dcjA data center representing a user group requesting data; l (u)i,dcj,dk) Representing user groups uiRequesting data center dcjData d in (1)kNetwork delay of (2); c(s)m,dcj) Representing data centres dcjServer s inmThe capacity of (a);
representing data centres dcjCarbon emissions of (d);
denoted as data centre dcjThe consumption of electric energy of; cost (u)i,dk,nj) Representing data centres dcjThe sum of network delay, electricity cost consumption, and carbon emissions; i. j, m and k are natural numbers respectively;
and sequencing the data centers according to the sequence from small to large of the sum of the network delay, the electricity consumption and the carbon emission of each data center obtained through calculation to obtain a data center sequence.
6. An apparatus for updating a data deployment, comprising:
the sequencing processing unit is used for sequencing the data centers according to the sequence that the total consumption of the data centers is from small to large when a user accesses data in a set time period to obtain a data center sequence;
the data searching unit is used for sequentially searching the data requested by the user from the first data center of the data center sequence when the user requests the data;
and the data copying unit is used for copying the data requested by the user from a database to any one of the data centers with the set number in the data center sequence when the data requested by the user is not found after the data centers with the set number are traversed.
7. The apparatus according to claim 6, wherein the data replication unit, when replicating the data requested by the user from the database to any one of the set number of data centers of the data center sequence, is specifically configured to:
and copying the data requested by the user from a database to a first data center of the data center sequence.
8. The apparatus of claim 6, further comprising:
the data deleting unit is used for respectively setting decreasing parameters for each item of data in each data center; when any data of the data center is requested, setting the value of the decreasing parameter of the requested data as an initial value, and respectively decreasing the value of the decreasing parameter of each data except the requested data in the data center where the requested data is located by 1; when the value of the decreasing parameter of any data in the data center where the requested data is located is 0, the data center is removed from the data center, wherein the value of the decreasing parameter is 0.
9. The apparatus according to claim 6, wherein the sorting processing unit sorts the data centers in order from small to large according to total consumption of the data centers when a user accesses data within a set time period, and when obtaining the data center sequence, is specifically configured to:
and sequencing the data centers according to the sequence from small to large of the sum of the network delay, the electric energy consumption and the carbon emission of each data center when a user accesses data in a set time period to obtain a data center sequence.
10. The apparatus according to claim 9, wherein the sorting processing unit sorts the data centers in order from small to large according to a sum of network delay, power consumption, and carbon emission of the data centers when a user accesses data within a set time period, and when obtaining a data center sequence, is specifically configured to:
respectively calculating the sum of network delay, electricity consumption and carbon emission of each data center when a user accesses data in a set time period according to the following formula:
wherein λ is1，λ2And λ3Respectively weighting network delay of user access data, power consumption of a data center and carbon emission; dkData representing a user request; u. ofiRepresenting a group of users requesting data; dcjA data center representing a user group requesting data; l (u)i,dcj,dk) Representing user groups uiRequesting data center dcjData d in (1)kNetwork delay of (2); c(s)m,dcj) Representing data centres dcjServer s inmThe capacity of (a);
representing data centres dcjCarbon emissions of (d);
denoted as data centre dcjThe consumption of electric energy of; cost (u)i,dk,nj) Representing data centres dcjThe sum of network delay, electricity cost consumption, and carbon emissions; i. j, m and k are natural numbers respectively;
and sequencing the data centers according to the sequence from small to large of the sum of the network delay, the electricity consumption and the carbon emission of each data center obtained through calculation to obtain a data center sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810038853.2A CN108200186B (en) | 2018-01-16 | 2018-01-16 | Method and device for updating data deployment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810038853.2A CN108200186B (en) | 2018-01-16 | 2018-01-16 | Method and device for updating data deployment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108200186A CN108200186A (en) | 2018-06-22 |
| CN108200186B true CN108200186B (en) | 2020-05-22 |
Family
ID=62589179
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810038853.2A Active CN108200186B (en) | 2018-01-16 | 2018-01-16 | Method and device for updating data deployment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108200186B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111787046B (en) * | 2020-03-02 | 2022-09-30 | 北京沃东天骏信息技术有限公司 | Data center routing method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102404412A (en) * | 2011-12-28 | 2012-04-04 | 北京邮电大学 | Energy-saving method and system for cloud computing data center |
| CN103516792A (en) * | 2013-09-16 | 2014-01-15 | 合肥工业大学 | Data deploying method based on network delay, network transmission energy consumption and server energy consumption |
| CN106331039A (en) * | 2015-07-01 | 2017-01-11 | 中国电力科学研究院 | Realization method for content connection in data center network |
| CN106603300A (en) * | 2016-12-29 | 2017-04-26 | 北京奇艺世纪科技有限公司 | Data deployment method and device |
| CN107329811A (en) * | 2017-06-09 | 2017-11-07 | 北京云集智造科技有限公司 | A kind of power consumption of data center adjusting method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10122653B2 (en) * | 2011-04-28 | 2018-11-06 | International Business Machines Corporation | Energy management system for a data center network |
-
2018
- 2018-01-16 CN CN201810038853.2A patent/CN108200186B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102404412A (en) * | 2011-12-28 | 2012-04-04 | 北京邮电大学 | Energy-saving method and system for cloud computing data center |
| CN103516792A (en) * | 2013-09-16 | 2014-01-15 | 合肥工业大学 | Data deploying method based on network delay, network transmission energy consumption and server energy consumption |
| CN106331039A (en) * | 2015-07-01 | 2017-01-11 | 中国电力科学研究院 | Realization method for content connection in data center network |
| CN106603300A (en) * | 2016-12-29 | 2017-04-26 | 北京奇艺世纪科技有限公司 | Data deployment method and device |
| CN107329811A (en) * | 2017-06-09 | 2017-11-07 | 北京云集智造科技有限公司 | A kind of power consumption of data center adjusting method and device |
Non-Patent Citations (1)
| Title |
|---|
| 面向延迟及能耗优化的云计算数据部署研究;丁洪利;《中国优秀硕士学位论文全文数据库 信息科技辑》;20160615(第06期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108200186A (en) | 2018-06-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109582758B (en) | Optimization method for Elasticissearch index shards | |
| CN102906751B (en) | A kind of method of data storage, data query and device | |
| Korupolu et al. | Placement algorithms for hierarchical cooperative caching | |
| Yu et al. | Location-aware associated data placement for geo-distributed data-intensive applications | |
| US8489612B2 (en) | Identifying similar files in an environment having multiple client computers | |
| Kolobov et al. | Optimal freshness crawl under politeness constraints | |
| CN111475108A (en) | Distributed storage method, computer equipment and computer readable storage medium | |
| CN108200186B (en) | Method and device for updating data deployment | |
| CN109325001B (en) | Method, device and equipment for deleting small files based on metadata server | |
| CN113535803A (en) | Block chain efficient retrieval and reliability verification method based on keyword index | |
| CN102609508A (en) | High-speed access method of files in network storage | |
| CN117033071A (en) | Disaster recovery data high-value quick and orderly recovery method based on file heat and multi-objective optimization | |
| CN112631612A (en) | Optimization method for kubernetes cloud platform configuration based on genetic algorithm | |
| Liu et al. | Supporting efficient keyword-based file search in peer-to-peer file sharing systems | |
| Charrada et al. | Dynamic period vs static period in data grid replication | |
| Rasool et al. | Replica placement in multi-tier data grid | |
| CN110795204B (en) | Virtual machine deployment method and device | |
| Takahashi et al. | Efficient In-advance Shared Content Deployment Method Using Popularity Prediction in Hybrid Peer-to-Peer Network with Cloud Storage | |
| Sun et al. | Replica placement algorithms in content distribution networks | |
| Li | Dynamic Load Balancing Method for Urban Surveillance Video Big Data Storage Based on HDFS | |
| Haoran et al. | A data deduplication method in the cloud storage based on FP-tree | |
| CN116069448B (en) | Sub-service resource scheduling method and system for cloud migration | |
| CN115941706A (en) | Method and device for realizing distributed file system and storage medium | |
| US20160098486A1 (en) | Searching system, method and p2p device for p2p device community | |
| Elwaer et al. | Preference driven server selection in peer-2-peer data sharing systems |
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 |