CN106055425A - Method for cloud disaster recovery data backup based on game theory - Google Patents

Method for cloud disaster recovery data backup based on game theory Download PDF

Info

Publication number
CN106055425A
CN106055425A CN201610340271.0A CN201610340271A CN106055425A CN 106055425 A CN106055425 A CN 106055425A CN 201610340271 A CN201610340271 A CN 201610340271A CN 106055425 A CN106055425 A CN 106055425A
Authority
CN
China
Prior art keywords
formula
cloud provider
dcp
provider
nodej
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
Application number
CN201610340271.0A
Other languages
Chinese (zh)
Other versions
CN106055425B (en
Inventor
李锦青
底晓强
祁晖
任维武
刘旭
赵建平
宋小龙
管红梅
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Changchun University of Science and Technology
Original Assignee
Changchun University of Science and Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Changchun University of Science and Technology filed Critical Changchun University of Science and Technology
Priority to CN201610340271.0A priority Critical patent/CN106055425B/en
Publication of CN106055425A publication Critical patent/CN106055425A/en
Application granted granted Critical
Publication of CN106055425B publication Critical patent/CN106055425B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14Error detection or correction of the data by redundancy in operation
    • G06F11/1402Saving, restoring, recovering or retrying
    • G06F11/1446Point-in-time backing up or restoration of persistent data
    • G06F11/1448Management of the data involved in backup or backup restore
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14Error detection or correction of the data by redundancy in operation
    • G06F11/1402Saving, restoring, recovering or retrying
    • G06F11/1446Point-in-time backing up or restoration of persistent data
    • G06F11/1458Management of the backup or restore process
    • G06F11/1464Management of the backup or restore process for networked environments

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

A method for cloud disaster recovery data backup based on a game theory relates to the technical field of data backup disaster recovery, and solves the problems in an existing data backup method that the resource cost is high, the storage cost is high, and influences of behaviors of source end cloud suppliers on a target end cloud supplier are neglected. The method for optimal data backup in a cloud disaster recovery environment based on the game theory provided by the invention is characterized in that interaction between the source end cloud supplier and the target end cloud supplier is simulated into a storage resource pricing model; and storage resource leading courses among backup nodes of the target end cloud supplier are modeled into a gaming course which pursues maximum benefits. The invention also provides a method for quantitative computation of optimal solutions of a storage resource quantity and a storage resource price, so that benefits of both gaming parties, namely the source end cloud supplier and the target end cloud supplier can be maximized simultaneously.

Description

Based on game theoretic cloud disaster tolerance data back up method
Technical field
The present invention relates to data backup disaster tolerance technology field, be specifically related to a kind of based on the optimum under game theoretic cloud environment Data back up method.
Background technology
Along with the development of information technology, the value of data is continuously increased, and people gradually strengthen for the dependence of network data, Especially finance or official's data, even the machine of delaying of the data degradation of fraction or short time all may be to the people Lives and properties cause harm greatly.Therefore, Data Disaster-Tolerance Technology receives and studies widely and pay close attention to.People would generally be not Same geographical position Backup Data copy is to reach data reliability requirement.But, traditional data store arranging method resource Spend huge.And the low cost of cloud storage, on-demand purchase and dynamic make it progressively become the optimum selection of data backup.
In recent years, cloud storage is widely used in data disaster tolerance with the pricing model of a kind of on-demand purchase.Working as Before data back up method in, lay particular emphasis on the parameter paying close attention to destination node more, such as storage cost and data recovery times etc. and right Memory capacity, minimum bandwidth and copy amount have carried out strict restriction, and have ignored the behavior of source cloud provider to purpose The impact of Duan Yun provider.
Game theory is the decision-making when behavior generation direct interaction of research decision-maker and this decision-making equal Weighing apparatus problem, has struggle or the mathematical theory of competition character phenomenon and method.Game theory considers prediction behavior individual in game And agenda, and study their optimisation strategy.In biology, economics, international relations, computer science, political science, army Thing strategy and other a lot of subjects are all widely used.
Summary of the invention
The present invention solves that available data backup method exists that resource expenditure is relatively big and carrying cost high, have ignored source simultaneously The behavior of the Duan Yun provider problem on the impact of destination cloud provider, it is provided that a kind of standby based on game theoretic cloud disaster tolerance data Part method.
Based on game theoretic cloud disaster tolerance data back up method, the method is realized by following steps:
Data are backed up on i source cloud provider SCPi by step one, user respectively, described source cloud provider SCP By the user data backup that self stores in destination cloud service provider DCP, described destination cloud service provider DCP bag Purpose memory node D_nodej containing j storage price change;I is the number of source cloud provider, holds cloud to provide for the purpose of j The number of the memory node of business;
Step 2, utility function U of calculating source cloud provider SCPscpiUtility function with destination cloud provider DCP Udcp;Specifically it is expressed as with following formula:
Formula one,
In formula, UscpiRepresent the utility function of i-th source cloud provider SCPi, BijFor SCPi in destination cloud provider Interests acquired after storing resource on the jth purpose memory node D_nodej of DCP, described BijIt is expressed as with formula two:
Formula two,
In formula, biFor positive parameter, it is used for distinguishing each source cloud provider, tjFor the positive parameter more than 1, it is used for distinguishing mesh The different purpose memory nodes of Duan Yun provider;xijStrategy for source cloud provider;CijFor i-th source cloud provider SCPi rents the cost that storage resource is spent from the jth purpose memory node D_nodej of destination cloud provider DCP, It is expressed as with formula three:
Formula three, Cij=pj·xij
In formula, pjFor the purpose of the strategy of Duan Yun provider memory node, it may be assumed that j the purpose of destination cloud provider DCP is deposited The unit price of the storage resource on storage node D_nodej;
Described NijFor Network Load Balance, it is expressed as with formula four:
Formula four,
In formula, LjRepresent that the maximum load on the jth purpose memory node D_nodej of destination cloud provider DCP is equal Weighing apparatus;
Formula two, formula three, formula four are substituted into formula one, it is thus achieved that formula five:
Formula five,
In formula, m is the positive integer more than j, and n is the positive integer more than i;
The utility function formula six of described destination cloud provider DCP is expressed as:
Formula six,
In formula, UdcpThe utility function of the destination cloud provider DCP by being chosen, BjDuan Yun provider DCP for the purpose of ' Jth purpose memory node D_nodej storage resource is leased to the income acquired in source cloud provider, with formula seven table Show:
Formula seven,
Described CjFor the purpose of ', the consuming cost of the jth purpose memory node D_nodej of Duan Yun provider DCP, uses formula Eight are expressed as:
Formula eight,
In formula, pj' represent the storage resource list on the jth purpose memory node D_nodej of destination cloud provider DCP Position consuming cost, described pj' < pj
By formula seven, formula eight substitutes into formula six, it is thus achieved that formula nine:
Formula nine,
Formula five and formula nine is used to calculate utility function U obtaining described source cloud provider SCPscpiInitial value and institute State utility function U of destination cloud provider DCPdcpInitial value;
Step 3, employing iterative algorithm realize Nash Equilibrium;
Particularly as follows: use iterative algorithm to calculate the tactful x of source cloud providerij;It is expressed as with formula ten:
Formula ten,
In formula,xij1) it is τ1I-th source cloud after secondary iteration Provider SCPi plan is stored in the resource quantity of the jth purpose memory node D_nodej of destination cloud provider DCP, τ1 Represent the iterations of source cloud provider, xij1+ 1) x is representedij1) next iteration result;δ is i-th source cloud Provider SCPi carries out step factor during resource quantity iteration;
Step 4, source cloud provider SCP revise self storage resource quantity, j the storage of destination cloud provider DCP Node D_nodej then constantly adjusts the list of storage resource according to the change of i source cloud provider SCPi storage resource quantity Position price pj, method of adjustment formula 11 is expressed as:
Formula 11,
In formula,τ2For the iterations of source cloud provider, pj2) it is τ2Destination cloud after secondary iteration The storage resource units price of the jth memory node D_nodej of provider DCP, pj2+ 1) p is representedj2) change next time For result;When for the purpose of θ, the jth memory node D_nodej of Duan Yun provider DSP carries out resource storage cell price iteration Step factor;
Step 5, the tactful x of the source cloud provider obtained according to step 3ijThe destination cloud obtained with step 4 provides The tactful p of business's memory nodej, use formula nine to calculate utility function U of destination cloud provider DCPdcpNew iteration knot Really, and judge UdcpWhether it is maximum, if it is not, then return step 4;If it is, execution step 6;
Step 6, calculate utility function U of i-th source cloud provider SCPi according to formula fivescpi, and judge UscpiIt is No for maximum, perform step 3 if it is not, then return, if it is, source cloud provider SCP and destination cloud provider DCP Reach Nash Equilibrium, it is thus achieved that optimum xij and pj value, it is achieved final Nash Equilibrium.
Beneficial effects of the present invention: of the present invention based on optimal data backup side under game theoretic cloud disaster tolerance environment Method, is modeled as a storage resource pricing model by the interaction between source cloud provider and destination cloud provider, and Storage resource lease process model building between destination cloud provider backup node is become a game seeking maximum return Journey.The present invention gives storage resource quantity and the method for storage resource price optimal solution quantitative Analysis simultaneously so that game is double Side, i.e. source cloud provider and destination cloud provider interests reach maximum simultaneously.
Accompanying drawing explanation
Fig. 1 is theory diagram based on game theoretic cloud disaster tolerance data back up method of the present invention;
Fig. 2 is flow chart based on game theoretic cloud disaster tolerance data back up method of the present invention;
Fig. 3 is of the present invention based in game theoretic cloud disaster tolerance data back up method three of destination cloud provider Memory node storage resource quantity change schematic diagram;
Fig. 4 is of the present invention based in game theoretic cloud disaster tolerance data back up method three of destination cloud provider Memory node storage resource price change schematic diagram;
Fig. 5 be of the present invention based on five source cloud providers in game theoretic cloud disaster tolerance data back up method respectively It is stored in the resource quantity distribution schematic diagram of three memory nodes of destination cloud provider;
Fig. 6 is of the present invention based on five source cloud provider effectiveness in game theoretic cloud disaster tolerance data back up method Function variation tendency schematic diagram;
Fig. 7 is of the present invention based on the effect of source cloud provider SCP1 in game theoretic cloud disaster tolerance data back up method With function variation tendency schematic diagram;
Fig. 8 is of the present invention to deposit based on destination cloud provider three in game theoretic cloud disaster tolerance data back up method Storage node utility function variation tendency schematic diagram;
Fig. 9 is of the present invention to deposit based on destination cloud provider three in game theoretic cloud disaster tolerance data back up method Storage node total utility function variation tendency schematic diagram.
Detailed description of the invention
Detailed description of the invention one, combine Fig. 1 and Fig. 2 and present embodiment is described, based on game theoretic cloud disaster tolerance data backup Method, the method is realized by following steps:
Data are backed up on different source cloud provider SCPi by A, user respectively, i=1, and 2 ... n, n represent available Source cloud provider quantity;For the safety and integrity demand of data and the consideration to economic factor, source cloud carries The user data backup self need to being had for business SCP to another cloud service provider, i.e. destination cloud provider DCP.Mesh Duan Yun provider DCP comprise the variable purpose memory node D_nodej of multiple storage price (j=1,2 ..., m, m represent mesh The available memory node quantity that comprised of Duan Yun provider DCP).Purpose memory node D_nodej is according to source cloud provider The size of the data volume that SCP is backed up dynamically adjusts storage price, constantly adjusts resource price and the number of resources of Backup Data Amount makes common interest maximize.
B, dynamic by between the purpose memory node D_nodej of source cloud provider SCP and destination cloud provider DCP Interaction is modeled as storing resource pricing model, and detailed process is as follows:
Source cloud provider SCP rents storage resource on the purpose memory node D_nodej of destination cloud provider DCP Time, it is desirable to obtain maximum interests: include the unit storage price lower than D_nodej present bidding, and higher network Load balancing.
The utility function formula one calculating described source cloud provider SCP is expressed as:
Formula one,
U in formulascpiRepresent the utility function of i-th source cloud provider SCPi.BijRepresent that SCPi wishes at destination cloud Interests acquired after storing resource on the jth purpose memory node D_nodej of provider DCP, i.e. it is standby that SCPi completes data The expense that after Fen, user is paid, is expressed as with formula two:
Formula two,
B in formulaiIt is a positive parameter, in order to distinguish each source cloud provider.tjIt is a positive parameter more than 1, uses To distinguish the different purpose memory nodes of destination cloud provider.xijRepresent the strategy of source cloud provider, i.e. i-th source cloud The storage resource that provider SCPi wants to rent on the jth purpose memory node D_nodej of destination cloud provider DCP Quantity.
CijRepresent the i-th source cloud provider SCPi jth purpose memory node D_ from destination cloud provider DCP Rent the cost that storage resource is spent on nodej, be expressed as with formula three:
Formula three, Cij=pj·xij(i=1,2,3,4,5 j=1,2,3)
P in formulajRepresent the strategy of purpose memory node, i.e. the jth purpose memory node D_ of destination cloud provider DCP Storage resource units price on nodej.
N in formula oneijRepresent Network Load Balance, formula four represent:
Formula four,
L in formulajRepresent that the maximum load on the jth purpose memory node D_nodej of destination cloud provider DCP is equal Weighing apparatus, i.e. maximum storage capacity.
Formula two, formula three, formula four substitute into formula one can get formula five and be expressed as:
Formula five,
In present embodiment, the utility function formula six calculating described destination cloud provider DCP is expressed as:
Formula six,
U in formuladcpThe utility function of the destination cloud provider DCP that expression is chosen, i.e. the maximum return that DCP is obtained, Including hiring out storage resource to the interests acquired in source cloud provider SCP and the cost spent.Bj' represent that destination cloud carries Storage resource is leased to the income acquired in source cloud provider by the jth purpose memory node D_nodej for business DCP, uses Formula seven represents:
Formula seven,
C in formula sixj' represent that the consumption of the jth purpose memory node D_nodej of destination cloud provider DCP becomes This, including maintenance cost, power consumption.Represent with formula eight:
Formula eight,
P in formulaj' represent the storage resource list on the jth purpose memory node D_nodej of destination cloud provider DCP Position consuming cost, pj' < pj
By formula seven, formula eight substitutes into formula six can obtain formula nine, as follows:
Formula nine
Utility function U of described source cloud provider SCP is calculated respectively with formula five and formula ninescpiInitial value and described Utility function U of destination cloud provider DCPdcpInitial value.
C, use iterative algorithm realize Nash Equilibrium.
τ1Representing the iterations of source cloud provider, i-th source cloud provider SCPi uses the method for formula ten repeatedly Generation calculates wants to be stored in the resource quantity of the jth purpose memory node D_nodej of destination cloud provider DCP.
Formula ten,
In formulaxij1) represent τ1I-th source after secondary iteration Cloud provider SCPi plan is stored in the resource quantity of the jth purpose memory node D_nodej of destination cloud provider DCP, xij1+ 1) x is representedij1) next iteration result.δ > 0, is a constant, represents that i-th source cloud provider SCPi enters Step factor during row resource quantity iteration.
D, while source cloud provider SCP constantly revises self storage resource quantity, destination cloud provider each Memory node D_nodej then constantly adjusts according to the change of all source cloud provider SCPi storage resource quantity and himself deposits The unit price of storage resource.Method of adjustment is carried out with the form iteration of formula 11.
Formula 11,
In formulaτ2Represent the iterations of source cloud provider.
pj2) represent τ2The storage money of the jth memory node D_nodej of destination cloud provider DCP after secondary iteration Source unit price, pj2+ 1) p is representedj2) next iteration result.θ > 0, is a constant, represents destination cloud provider The jth memory node D_nodej of DSP carries out step factor during resource storage cell price iteration.
E, it is stored in destination cloud provider according to the source cloud provider SCPi plan calculated in above-mentioned steps C Resource quantity x of the jth purpose memory node D_nodej of DCPijAnd the destination cloud provider calculated in step D Storage resource units price p of the jth memory node D_nodej of DCPj, use method described in formula nine to calculate destination cloud Utility function U of provider DCPdcpNew iteration result.Judge UdcpWhether it is maximum, if it is, continue executing with step Rapid F, returns if not and performs step D;
F, calculate utility function U of i-th source cloud provider SCPi according to formula fivescpi, and judge UscpiIt is whether Big value, performs step C if it is not, then return;If it is, be final Nash Equilibrium so that game participant both sides: source The benefit of cloud provider SCP and destination cloud provider DCP.
The data of xij size are backed up to depositing of destination cloud provider with price pj by G, source cloud provider SCPi respectively In storage node D_nodej.
Detailed description of the invention two, combining Fig. 1 to Fig. 9 present embodiment is described, present embodiment is detailed description of the invention one Described embodiment based on game theoretic cloud disaster tolerance data back up method:
Data are backed up to different source cloud provider SCP1 by a, user respectively, on SCP2, SCP3, SCP4, SCP5.In conjunction with Fig. 1, each source cloud provider SCP1, the user data backup that self need to be had by SCP2, SCP3, SCP4, SCP5 is to another Cloud service provider, i.e. destination cloud provider DCP.DCP comprises three variable purpose memory node D_ of storage price Node1, D_node2 and D_node3.Purpose memory node D_node1, D_node2, D_node3 are according to source cloud provider The size of the data volume that SCP1, SCP2, SCP3, SCP4, SCP5 are backed up dynamically adjusts storage price.
B, by source cloud provider SCP1, the purpose storage of SCP2, SCP3, SCP4, SCP5 and destination cloud provider DCP Node D_node1, the dynamic interaction process model building between D_node2, D_node3 is storage resource pricing model, detailed process As follows:
One, the utility function of described source cloud provider SCP is calculated:
U s c p i = Σ j = 1 3 ( B i j - C i j - N i j ) i = 1 , 2 , 3 , 4 , 5 j = 1 , 2 , 3 - - - ( 1 )
U in formulascpiRepresent the utility function of i-th source cloud provider SCPi.BijRepresent that SCPi wishes at destination cloud Interests acquired after storing resource on the jth purpose memory node D_nodej of provider DCP, i.e. it is standby that SCPi completes data The expense that after Fen, user is paid:
B i j = b i · ( 1 + x i j ) 1 t j i = 1 , 2 , 3 , 4 , 5 j = 1 , 2 , 3 - - - ( 2 )
B in formula (2)iIt is a positive parameter, in order to distinguish each source cloud provider, b in the present embodiment1=2.5, b2=2.6, b3=2.7, b4=2.8, b5=2.9.tjIt is a positive parameter more than 1, in order to distinguish destination cloud provider Different purpose memory nodes, t in the present embodiment1=4, t2=3, t3=2.xijRepresent the strategy of source cloud provider, i.e. i-th Individual source cloud provider SCPi wants that rents on the jth purpose memory node D_nodej of destination cloud provider DCP to deposit The quantity of storage resource, initial value is 0.
CijRepresent the i-th source cloud provider SCPi jth purpose memory node D_ from destination cloud provider DCP Rent on nodej and store the cost that resource is spent:
Cij=pj·xij(i=1,2,3,4,5 j=1,2,3) (3)
P in formula (3)jRepresent the strategy of purpose memory node, i.e. the jth purpose storage joint of destination cloud provider DCP Storage resource units price on some D_nodej, the most respectively p1=0.1, p2=0.2, p3=0.3.
N in formula (1)ijExpression Network Load Balance:
N i j = 1 L j - Σ i = 1 5 x i j i = 1 , 2 , 3 , 4 , 5 j = 1 , 2 , 3 - - - ( 4 )
LjRepresent the maximum load equilibrium on the jth purpose memory node D_nodej of destination cloud provider DCP, i.e. Maximum storage capacity, the most respectively L1=35, L2=20, L3=11.
Formula (2), formula (3), formula (4) are substituted into formula (1) and can obtain:
U s c p i = Σ j = 1 3 ( b i · ( 1 + x i j ) 1 t j - p j · x i j - 1 L j - Σ i = 1 5 x i j ) i = 1 , 2 , 3 , 4 , 5 j = 1 , 2 , 3 - - - ( 5 )
Two, the utility function of described destination cloud provider DCP is calculated:
U d c p = Σ j = 1 3 ( B j ′ - C j ′ ) ( j = 1 , 2 , 3 ) - - - ( 6 )
U in formula (6)dcpRepresent the utility function of the destination cloud provider DCP chosen, i.e. the maximum receipts that DCP is obtained Benefit, including hiring out storage resource to the interests acquired in source cloud provider SCP and the cost spent.
Bj' represent that storage resource is leased to source by the jth purpose memory node D_nodej of destination cloud provider DCP Income acquired in Duan Yun provider:
B j ′ = Σ i = 1 5 p j · x i j i = 1 , 2 , 3 , 4 , 5 j = 1 , 2 , 3 - - - ( 7 )
C in formula (6)j' represent the consuming cost of jth purpose memory node D_nodej of destination cloud provider DCP, Including maintenance cost, power consumption, as shown in formula (8):
C j ′ = Σ i = 1 5 p j ′ · x i j i = 1 , 2 , 3 , 4 , 5 j = 1 , 2 , 3 - - - ( 8 )
P in formula (8)j' represent the storage resource on the jth purpose memory node D_nodej of destination cloud provider DCP Unit consumption cost, pj' < pj, p in the present embodimentj'=0.7pj
By formula (7), formula (8) substitutes into formula (6) and can obtain:
U d c p = Σ j 3 Σ i = 1 5 ( p j · x i j - p j ′ · x i j ) = Σ j 3 Σ i = 1 5 [ ( p j - p j ′ ) · x i j ] i = 1 , 2 , 3 , 4 , 5 j = 1 , 2 , 3 - - - ( 9 )
Utility function U of described source cloud provider SCP is calculated respectively by formula (5) and formula (9)scpiInitial value and described mesh Utility function U of Duan Yun provider DCPdcpInitial value.
C, use iterative algorithm realize Nash Equilibrium.τ1Representing the iterations of source cloud provider, i-th source cloud carries Want to be stored in the jth purpose memory node of destination cloud provider DCP with formula (10) method iterative computation for business SCPi The resource quantity of D_nodej.
x i j ( τ 1 + 1 ) = x i j ( τ 1 ) + δ · [ ∂ U s c p i ∂ x i j ] i = 1 , 2 , 3 , 4 , 5 j = 1 , 2 , 3 - - - ( 10 )
In formula
xij1) represent τ1After secondary iteration, i-th source cloud provider SCPi plan is stored in destination cloud provider The resource quantity of the jth purpose memory node D_nodej of DCP, xij1+ 1) x is representedij1) next iteration result.δ > 0, is a constant, and expression i-th source cloud provider SCPi carries out step factor during resource quantity iteration, at the present embodiment Middle δ=0.1.
D, while self storage resource quantity is constantly revised by source cloud provider, each storage of destination cloud provider Node D_nodej (j=1,2,3) is then according to the change of all sources cloud provider SCPi (i=1,2,3,4,5) storage resource quantity Change the unit price constantly adjusting himself storage resource.
p j ( τ 2 + 1 ) = p j ( τ 2 ) + θ · [ ∂ U d c p ∂ p j ] ( j = 1 , 2 , 3 ) - - - ( 11 )
In formula (11)τ2Represent the iterations of source cloud provider.
pj2) represent τ2The storage money of the jth memory node D_nodej of destination cloud provider DCP after secondary iteration Source unit price, pj2+ 1) p is representedj2) next iteration result.θ > 0, is a constant, represents destination cloud provider The jth memory node D_nodej of DSP carries out step factor during resource storage cell price iteration, in the present embodiment θ= 0.001。
E, it is stored in destination cloud provider according to the source cloud provider SCPi plan calculated in above-mentioned steps three Resource quantity x of the jth purpose memory node D_nodej of DCPij, and the destination cloud provider calculated in step 4 Storage resource units price p of the jth memory node D_nodej of DCPj, use method described in formula nine to calculate destination cloud Utility function U of provider DCPdcpNew iteration result.Judge UdcpWhether it is maximum, returns step d if not, if It is then to continue executing with step f.
F, it is stored in destination cloud provider according to the source cloud provider SCPi plan calculated in above-mentioned steps c Resource quantity x of the jth purpose memory node D_nodej of DCPijAnd the destination cloud provider calculated in step d Storage resource units price p of the jth memory node D_nodej of DCPj, calculate i-th source cloud provider according to formula five Utility function U of SCPiscpi, and judge UscpiWhether it is maximum, if it is not, then return step c, if it is, combine Fig. 3 To Fig. 9, USCPiAnd UdcpReaching maximum, game both sides reach Nash Equilibrium, it is thus achieved that optimum xij and pj value, are final receiving Assorted equilibrium so that game participant both sides: the benefit of source cloud provider SCP and destination cloud provider DCP.
The data of xij size are backed up by g, source cloud provider SCP1, SCP2, SCP3, SCP4, SCP5 respectively with price pj To memory node D_node1, D_node2, D_node3 of destination cloud provider.

Claims (3)

1. based on game theoretic cloud disaster tolerance data back up method, it is characterized in that, the method is realized by following steps:
Data are backed up on i source cloud provider SCPi by step one, user respectively, and described source cloud provider SCP will be from The user data backup of body storage is in destination cloud service provider DCP, and described destination cloud service provider DCP comprises j The purpose memory node D_nodej of individual storage price change;I is the number of source cloud provider, Duan Yun provider for the purpose of j The number of memory node;
Step 2, utility function U of calculating source cloud provider SCPscpiUtility function U with destination cloud provider DCPdcp; Specifically it is expressed as with following formula:
Formula one,
In formula, UscpiRepresent the utility function of i-th source cloud provider SCPi, BijFor SCPi at destination cloud provider DCP Jth purpose memory node D_nodej on store interests acquired after resource, described BijIt is expressed as with formula two:
Formula two,
In formula, biFor positive parameter, it is used for distinguishing each source cloud provider, tjFor the positive parameter more than 1, it is used for distinguishing destination The different purpose memory nodes of cloud provider;xijStrategy for source cloud provider;CijFor i-th source cloud provider SCPi The cost that storage resource is spent is rented, by public affairs from the jth purpose memory node D_nodej of destination cloud provider DCP Formula three is expressed as:
Formula three, Cij=pj·xij
In formula, pjFor the purpose of the strategy of Duan Yun provider memory node, it may be assumed that j the purpose storage joint of destination cloud provider DCP The unit price of the storage resource on some D_nodej;
Described NijFor Network Load Balance, it is expressed as with formula four:
Formula four,
In formula, LjRepresent the maximum load equilibrium on the jth purpose memory node D_nodej of destination cloud provider DCP;
Formula two, formula three, formula four are substituted into formula one, it is thus achieved that formula five:
Formula five,
In formula, m is the positive integer more than j, and n is the positive integer more than i;
The utility function formula six of described destination cloud provider DCP is expressed as:
Formula six,
In formula, UdcpThe utility function of the destination cloud provider DCP by being chosen, BjThe jth of Duan Yun provider DCP for the purpose of ' Storage resource is leased to the income acquired in source cloud provider by individual purpose memory node D_nodej, represents with formula seven:
Formula seven,
Described CjThe consuming cost of the jth purpose memory node D_nodej of Duan Yun provider DCP for the purpose of ', with formula eight table It is shown as:
Formula eight,
In formula, pj' represent that the storage resource units on the jth purpose memory node D_nodej of destination cloud provider DCP disappears Consumption cost, described pj' < pj
By formula seven, formula eight substitutes into formula six, it is thus achieved that formula nine:
Formula nine,
Formula five and formula nine is used to calculate utility function U obtaining described source cloud provider SCPscpiInitial value and described mesh Utility function U of Duan Yun provider DCPdcpInitial value;
Step 3, employing iterative algorithm realize Nash Equilibrium;
Particularly as follows: use iterative algorithm to calculate the tactful x of source cloud providerij;It is expressed as with formula ten:
Formula ten,
In formula,xij1) it is τ1I-th source cloud provider after secondary iteration SCPi plan is stored in the resource quantity of the jth purpose memory node D_nodej of destination cloud provider DCP, τ1Expression source The iterations of Duan Yun provider, xij1+ 1) x is representedij1) next iteration result;δ is i-th source cloud provider SCPi carries out step factor during resource quantity iteration;
Step 4, source cloud provider SCP revise self storage resource quantity, j the memory node of destination cloud provider DCP D_nodej then constantly adjusts the unit valency of storage resource according to the change of i source cloud provider SCPi storage resource quantity Lattice pj, method of adjustment formula 11 is expressed as:
Formula 11,
In formula,τ2For the iterations of source cloud provider, pj2) it is τ2After secondary iteration, destination cloud provides The storage resource units price of the jth memory node D_nodej of business DCP, pj2+ 1) p is representedj2) next iteration knot Really;Step-length when the jth memory node D_nodej of Duan Yun provider DSP carries out resource storage cell price iteration for the purpose of θ The factor;
Step 5, the tactful x of the source cloud provider obtained according to step 3ijThe destination cloud provider obtained with step 4 deposits The tactful p of storage nodej, use formula nine to calculate utility function U of destination cloud provider DCPdcpNew iteration result, and Judge UdcpWhether it is maximum, if it is not, then return step 4;If it is, execution step 6;
Step 6, calculate utility function U of i-th source cloud provider SCPi according to formula fivescpi, and judge UscpiIt is whether Maximum, performs step 3 if it is not, then return, if it is, source cloud provider SCP reaches with destination cloud provider DCP Nash Equilibrium, it is thus achieved that optimum xij value and pj value, it is achieved final Nash Equilibrium.
The most according to claim 1 based on game theoretic cloud disaster tolerance data back up method, it is characterised in that described purpose is deposited The size of the data volume that storage node D_nodej is backed up according to source cloud provider SCP dynamically adjusts storage price, by not The disconnected resource price adjusting Backup Data and resource quantity make source cloud provider SCP and destination cloud service provider DCP Benefit.
The most according to claim 1 and 2 based on game theoretic cloud disaster tolerance data back up method, it is characterised in that also to include Step 7, described source cloud provider SCP respectively by the data of the tactful xij of source cloud provider according to destination cloud provider The tactful pj of memory node backs up in the memory node D_nodej of destination cloud provider.
CN201610340271.0A 2016-05-20 2016-05-20 Cloud disaster tolerance data back up method based on game theory Active CN106055425B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610340271.0A CN106055425B (en) 2016-05-20 2016-05-20 Cloud disaster tolerance data back up method based on game theory

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610340271.0A CN106055425B (en) 2016-05-20 2016-05-20 Cloud disaster tolerance data back up method based on game theory

Publications (2)

Publication Number Publication Date
CN106055425A true CN106055425A (en) 2016-10-26
CN106055425B CN106055425B (en) 2018-09-18

Family

ID=57176570

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610340271.0A Active CN106055425B (en) 2016-05-20 2016-05-20 Cloud disaster tolerance data back up method based on game theory

Country Status (1)

Country Link
CN (1) CN106055425B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113630176A (en) * 2021-09-18 2021-11-09 长春理工大学 Game cache multi-path transmission method for earth observation of LEO satellite data

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102984249A (en) * 2012-11-22 2013-03-20 北京邮电大学 Distributed resource allocation method in horizontal dynamic cloud alliance
CN104318486A (en) * 2014-10-08 2015-01-28 华北电力大学(保定) Cloud computing-based power dispatching data disaster recovery method
CN104407944A (en) * 2014-12-24 2015-03-11 浪潮(北京)电子信息产业有限公司 Disaster recovery backup method and disaster recovery backup system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102984249A (en) * 2012-11-22 2013-03-20 北京邮电大学 Distributed resource allocation method in horizontal dynamic cloud alliance
CN104318486A (en) * 2014-10-08 2015-01-28 华北电力大学(保定) Cloud computing-based power dispatching data disaster recovery method
CN104407944A (en) * 2014-12-24 2015-03-11 浪潮(北京)电子信息产业有限公司 Disaster recovery backup method and disaster recovery backup system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
严晔: "基于Swiftstack的云存储关键技术研究", 《长春理工大学学报》 *
王春才: "基于iSCSI的网络数据存储技术研究", 《吉林师范大学学报》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113630176A (en) * 2021-09-18 2021-11-09 长春理工大学 Game cache multi-path transmission method for earth observation of LEO satellite data
CN113630176B (en) * 2021-09-18 2022-07-15 长春理工大学 Game cache multi-path transmission method for earth observation of LEO satellite data

Also Published As

Publication number Publication date
CN106055425B (en) 2018-09-18

Similar Documents

Publication Publication Date Title
Raviv et al. Optimal inventory management of a bike-sharing station
Gatti et al. Monetary policy experiments in an agent-based model with financial frictions
Banerjee et al. Dynamic clearing and contagion in financial networks
Arrow Workshop on the economy as an evolving complex system: summary
Wan et al. Possibility linear programming with trapezoidal fuzzy numbers
Eboli A flow network analysis of direct balance-sheet contagion in financial networks
Löhndorf et al. Gas storage valuation in incomplete markets
Chitiyo et al. Forging inclusive economic growth in Zimbabwe
CN109003114A (en) A kind of marketing strategy prediction technique, system, computer equipment and storage medium
Zeng et al. Derivation of operation rules for reservoirs in parallel with joint water demand
CN106506607A (en) Cloud computing resources distribution method based on fair credible two way auction mechanism
Chipango Reinterpreting energy poverty in Zimbabwe: a scalar perspective
CN106055425A (en) Method for cloud disaster recovery data backup based on game theory
Benk et al. Money velocity in an endogenous growth business cycle with credit shocks
CN108985595A (en) The move transaction service evaluation method and device mutually commented based on counterparty
Clempner A dynamic mechanism design for controllable and ergodic markov games
CN102622706B (en) A kind of risk mitigation distribution method
CN109523246A (en) Subscriber payment channel method and device for planning
Muñoz-Álvarez et al. Financial storage rights: Definition and basic properties
Oosterhaven et al. The impact of production and infrastructure shocks: A non-linear input-output programming approach, tested on an hypothetical economy
Carlson et al. Infinite horizon concave games with coupled constraints
Jiang et al. Economic crisis impact on low carbon transition in economy-ecosystem
Wardana et al. A Game Theory Model of Salt Price Stabilization Using Warehouse Receipt System
CN117635189A (en) Virtual power plant master-slave multi-chain resource interactive matching method based on improved consensus algorithm
Van Der Walt State of Municipalities' Audit Reports-2010/2011 and the road to Operation Clean Audit 2014

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant