CN101505473A - Method and apparatus for telecommunication network user data storage management - Google Patents
Method and apparatus for telecommunication network user data storage management Download PDFInfo
- Publication number
- CN101505473A CN101505473A CNA200810082876XA CN200810082876A CN101505473A CN 101505473 A CN101505473 A CN 101505473A CN A200810082876X A CNA200810082876X A CN A200810082876XA CN 200810082876 A CN200810082876 A CN 200810082876A CN 101505473 A CN101505473 A CN 101505473A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- dht
- user data
- key value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000007726 management method Methods 0.000 title description 6
- 238000013500 data storage Methods 0.000 title description 5
- 238000004891 communication Methods 0.000 claims abstract description 37
- 238000011084 recovery Methods 0.000 claims abstract description 11
- 238000000151 deposition Methods 0.000 claims description 20
- 230000005540 biological transmission Effects 0.000 claims description 12
- JEIPFZHSYJVQDO-UHFFFAOYSA-N ferric oxide Chemical compound O=[Fe]O[Fe]=O JEIPFZHSYJVQDO-UHFFFAOYSA-N 0.000 claims description 10
- 238000011144 upstream manufacturing Methods 0.000 claims description 8
- 238000000638 solvent extraction Methods 0.000 claims description 4
- 238000005516 engineering process Methods 0.000 abstract description 8
- 238000013523 data management Methods 0.000 abstract description 6
- 230000007547 defect Effects 0.000 abstract 1
- 241001269238 Data Species 0.000 description 18
- 238000010586 diagram Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 4
- 238000012423 maintenance Methods 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 230000002950 deficient Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000004321 preservation Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for storing user data of a communication network based on a DHT. To overcome the defects caused by centralized user data management in a telecommunication network, the invention realizes a high-efficiency distributed data management system of the communication network by improving distributed hash table (DHT) technology and applying the distributed hash table technology in user data management of the communication network, and overcomes the disadvantages of the prior centralized data management. The method for storing the user data of the communication network based on the DHT is characterized in that the method comprises the following steps that: a first node in a DHT overlay network receives user data to be stored; the user data to be stored is taken as backup data and is segmented into L/K portions, and the L is more than or equal to the ratio of downlink bandwidth to uplink bandwidth (used for data recovery) of a second node in the DHT overlay network; the K is the total portions of the backup data, and is an integer more than 0; and the user data to be stored is taken as main data, and the main data and K*L/K portions of segmented backup data are stored on 1+K*L/K DHT nodes respectively.
Description
Technical field
The present invention relates to the telecommunication network technology field, relate in particular to a kind of method and device of telecommunication network user data storage management.
Background technology
Communication network provides telecommunications service for the user of magnanimity, user data is the critical data of communication network, store and manage by special telecommunication apparatus, HLR (HomeLocation Register as the mobile communication network kind, the ownership place register) or HSS (Home Subscriber Server, user attaching server) with regard to centralized stores following user profile: CAMEL-Subscription-Information, positional information, traffic limits information, supplementary service and relevant parameter etc.
Because HLR/HSS is in key position in communication network, and be to adopt centralized user data management pattern in the present communication network, therefore very harsh to the requirement of its reliability, in order to satisfy the requirement that runs without interruption, generally adopted local Hot Spare/local redundancy to add very high system configuration such as disaster-tolerant backup.But, even like this, to more and more being tending towards the user data of magnanimity, the maintenance cost of system significantly rises, and expandability is obviously not enough, and the load of network is unbalanced, and existing centralized scheme can not meet the demands.
Summary of the invention
In order to solve the defective that centralized user data management brings in the communication network, embodiments of the invention provide a kind of method and device that can alleviate the user data storage management of storage of subscriber data pressure.
A kind of method of depositing the communication network user data based on DHT comprises:
First node in the DHT overlay network receives user data to be deposited;
User data described to be deposited is divided into L/K part as Backup Data, and described L is more than or equal to the downlink bandwidth of the Section Point in the described DHT overlay network and the ratio of the upstream bandwidth that can be used for the data recovery; Described K is total umber of Backup Data, and K is the integer greater than zero;
With user data described to be deposited as master data, with described master data and the Backup Data after K * L/K part cuts apart send to 1+K * L/K DHT node respectively.
A kind of method of the inquiry communication network user data based on DHT comprises:
First node in the DHT overlay network receives the request of inquiring user data;
According to described request, obtain the key value, be worth the DHT nodal information of the described user data of storage according to described key;
According to described DHT nodal information, find and described key value corresponding user data.
A kind of method of the renewal communication network user data based on DHT comprises:
First node in the DHT overlay network receives the request of updating user data;
According to described request, obtain the key value, be worth the DHT nodal information of the described user data of storage according to described key;
According to described DHT nodal information, upgrade and described key value corresponding user data.
A kind of device of depositing the communication network user data based on DHT comprises:
Receiving element receives user data to be deposited;
Data partitioning unit is divided into L/K part with user data described to be deposited as Backup Data, and described L is greater than the downlink bandwidth of the Section Point in the described DHT overlay network and the ratio of the upstream bandwidth that can be used for the data recovery; Described K is total umber of Backup Data, and K is the integer greater than zero;
The deposit data unit, with user data described to be deposited as master data, with described master data and the Backup Data after K * L/K part cuts apart send to 1+K * L/K DHT node respectively.
A kind of device of the inquiry communication network user data based on DHT comprises:
Receiving element receives the request of inquiring user data;
Computing unit according to described request, obtains the key value, is worth the DHT nodal information of the described user data of storage according to described key;
Query unit according to described DHT nodal information, finds and described key value corresponding user data.
A kind of device of the renewal communication network user data based on DHT comprises:
Receiving element receives the request of updating user data;
Computing unit according to described request, obtains the key value, is worth the DHT nodal information of the described user data of storage according to described key;
Updating block according to described DHT nodal information, upgrades and described key value corresponding user data.
These three devices can join in the DHT overlay network as a node separately, also can be arbitrarily made with a node and join in the DHT overlay network, and promptly the node of DHT overlay network can provide the combination in any of the function of above-mentioned three devices.
Deposit data provided by the invention, inquiry and method for updating and device, can realize the distributed storage of telecommunication user data, significantly promoted the degree of concurrence that node recovers in the DHT stacking network, reduced the system resource of keeping for the maintenance work of DHT stacking network, improve the robustness of whole storage of subscriber data system, reduced in the DHT stacking network unnecessary messages expense between each node.
Description of drawings
Fig. 1 is the traditional approach schematic diagram of order backup;
Fig. 2 is a new improved order backup mode schematic diagram in the embodiment of the invention;
Fig. 3 is the traditional approach schematic diagram of five equilibrium Hash space (constant offset) backup;
Fig. 4 is new improved five equilibrium Hash space (constant offset) backup mode schematic diagram in the embodiment of the invention;
Fig. 5 is a deposit data method flow diagram in the embodiment of the invention;
Fig. 6 is a data enquire method flow chart in the embodiment of the invention;
Fig. 7 is a data-updating method flow chart in the embodiment of the invention;
Fig. 8 is the device schematic diagram of deposit data in the embodiment of the invention;
Fig. 9 is the device schematic diagram of data query in the embodiment of the invention;
Figure 10 is the device schematic diagram of Data Update in the embodiment of the invention;
Specific embodiment:
Same Internet in the face of mass data, that a lot of Internet service providers have taked is distributed, self-organizing, the P2P technology of management certainly, made up a kind of network system of self-organizing form, in the P2P network, there is not the central server node, each node both can be used as server provides service for other nodes, the service that is provided in the time of can enjoying other nodes as server simultaneously again.Therefore, in the P2P network, each Peer node is in reciprocity status, claims that each node is a peer-to-peer.
The present invention improves existing P 2P technology by leaving the characteristics of the user data of HLR/HSS in the research telecommunications network in, has realized the storage and the management of high-efficiency reliable user data.User data described in the present invention also comprises the index information of these user profile except the relevant information that comprises the telecommunication user described in the background technology.
Described user data is the relevant information of telecommunication user, can be user's CAMEL-Subscription-Information, positional information, traffic limits information, supplementary service and relevant parameter etc.; It also can be the index information of user's CAMEL-Subscription-Information, positional information, traffic limits information, supplementary service and relevant parameter etc.; It also can be the address information of the dedicated memory space of telecommunication user.
Describe in further detail below in conjunction with the technical scheme of accompanying drawing the embodiment of the invention.
According to the characteristics of the user data of communication network, be proper technology at present based on the storage administration scheme of the Key-Value (key assignments-data) of DHT (Distributed HashTable, distributed hashtable) at present.
To the user data of communication network, the key in the DHT stacking network calculates by hash function according to one or more user profile, and described user profile can be (1) user's telephone number; The perhaps numbering of (2) user's SIM card; Perhaps (3) user's oneself private number (as identity card); Perhaps (4) user's IP address or the like.
Consider the requirement to the user data high reliability, need carry out redundancy backup to user data the communication network merchant, adopt a node as main memory, a plurality of nodes are deposited a form as backup respectively.For the convenience of technical scheme narration, following technical scheme content will with one main add two backups altogether three piece of data be that example is narrated, related art scheme is suitable equally to other a main situation of adding backup.
One, the placement of data
One main add two backups altogether three piece of data how to place, the mode (as shown in Figure 1) of can employing preserving in proper order, promptly each node also will be successively placed on other two parts of secondary data on own with the own adjacent node except preserving a one's own master data on the Hash space.
Also can place (as Fig. 3) according to the mode in five equilibrium Hash space, the node of depositing Backup Data lays respectively on adjacent 1/ (K+1) Hash space with the node of depositing master data, K is total umber of the outer Backup Data of master data, for example: during K=2, two parts of secondary data leave in respectively on the node in node skew 1/3rd and 2/3rds Hash spaces, master data place.
Deposit and be example with order, as shown in Figure 1, the index that A preserved need back up on follow-up B and C, and so in the time of the A fault, new node can only begin to download partial data from B and C to be backed up in proper order.Under traditional order preservation mechanism, in the time of the A fault, the load that A bore is born by B in addition.
Traditional location mode in five equilibrium Hash space as shown in Figure 3, with the zone that Peer A was preserved is [Da～Dz], a same main second mate, should understand the position that translation is placed on [1/3*HashSpace+Da～1/3*HashSpace+Dz] and [2/3*HashSpace+Da～2/3*HashSpace+Dz] in the zone so, suppose the words that Peer is evenly distributed, these two positions also are each Peer so, are assumed to be B and C.
The present invention proposes following new L data and cuts apart laying method, and embodiments of the invention also propose the method that a kind of data are cut apart placement.The data that each Peer preserved are divided into L/K part according to Key, and wherein K is total umber of Backup Data, and L is the downlink bandwidth of node and the ratio that node can be used for the upstream bandwidth of data recovery.
With each piece of data is that the unit carries out order or five equilibrium interval reproduction replica, like this, although total umber of copy is constant, in data recovery procedure, can make full use of L platform machine and carry out parallel recovery, each machine as long as reserve the bandwidth surplus of 1/L～2/L more simultaneously.Fig. 2 and Fig. 4 have provided corresponding K=2, back up the improved form with the backup of five equilibrium Hash space in the time of L=6 in proper order.
Cut apart laying method based on above-mentioned L data, we can further set up rule-based index mechanism, finish data storage method.
Under the mechanism of order backup, suppose that certain node is responsible for safeguarding the data (this node be called master data place node) of key from 1-6000, K=2, L=6, then the rule of storage is:
1, to the 1st part of Backup Data, is divided into L/K=3 part; The 1st adjacent node of master data place node in the current node that is in line states, this node is deposited the data that key is 1-2000; The 2nd adjacent node of master data place node deposited the data that key is 2001-4000 in the current node that is in line states; The 3rd adjacent node of master data place node deposited the data that key is 4001-6000 in the current node that is in line states.Here the implication of " adjacent " is determined according to different DHT, is example with Chord, then is meant from this node to begin the 1st, the 2nd and the 3rd node on the clockwise ring.
2, to the 2nd part of Backup Data, be divided into L/K=3 part; The 4th adjacent node of master data place node in the current node that is in line states, this node is deposited the data that key is 1-2000; The 5th adjacent node of master data place node deposited the data that key is 2001-4000 in the current node that is in line states; The 6th adjacent node of master data place node deposited the data that key is 4001-6000 in the current node that is in line states.Here the implication of " adjacent " is determined according to different DHT, is example with Chord, then is meant from this node to begin the 4th, the 5th and the 6th node on the clockwise ring.
3, sum up top rule: (i is an integer to i part Backup Data, 1≤i≤K) is divided into L/K part, wherein (j is an integer, and 1≤j≤L/K) selects to leave in the i * j adjacent node of master data place node in the current node that is in line states for j data slice.Perhaps Backup Data place node i d is whole again on the basis of above-mentioned rule increases a side-play amount N, promptly leaves on the i * j+N adjacent node of master data place node in the current node that is in line states, and N is greater than zero integer.
Under the mechanism of five equilibrium Hash space backup, suppose that certain node is responsible for safeguarding the data (this node be called master data place node) of key from 1-6000, K=2, L=6, then the default rule of storage is:
1, to the 1st part of Backup Data, is divided into L/K=3 part; The 1st node of selecting be in the current node that is in line states node i d near " key=[1-2000]+size in Hash space/(K * L+1) " node, this node is deposited the data that key is 1-2000; The 2nd node of selecting be in the current node that is in line states node i d near " key=[2001-4000]+size in 2 * Hash space/(K * L+1) " node, deposit the data that key is 2001-4000; The 3rd node of selecting be in the current node that is in line states node i d near " key=[4001-6000]+size in 3 * Hash space/(K * L+1) " node, deposit the data that key is 4001-6000.
2, to the 2nd part of Backup Data, the 4th node of selection be in the current node that is in line states node i d near " id=key=[1-2000]+size in 4 * Hash space/(K * L+1) " node, this node is deposited the data that key is 1-2000; The 5th node of selecting be in the current node that is in line states node i d near " key=[2001-4000]+size in 5 * Hash space/(K * L+1) " node, deposit the data that key is 2001-4000; The 6th node of selecting be in the current node that is in line states node i d near " key=[2001-4000]+size in 6 * Hash space/(K * L+1) " node, deposit the data that key is 4001-6000.
3, sum up top rule: (i is an integer to i part Backup Data, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], wherein (j is an integer to j data slice, 1≤j≤L/K), select to leave in node i d in the current node that is in line states near " key=[Dj1～Djh]+size in i * j * Hash space/(K * L+1) " node on.Perhaps the key scope of Backup Data is whole again on the basis of above-mentioned rule increases a side-play amount N, promptly leave in node i d in the current node that is in line states near " key=[Dj1～Djh]+size in N+i * j * Hash space/(K * L+1) " node on, N is the integer greater than zero.
Above-mentioned rule has just constituted the implicit index in our system, this implicit index is the corresponding relation between key value and the node i d, use any one key value just can draw the id of the master data place node at this key value corresponding user data place, and then further obtain out the id of the node at all copy data places, in addition, system also can safeguard the concordance list of a demonstration if desired.
Two, data write process and consistency guarantee
Adopt one-main-multi-auxiliary in the embodiments of the invention and carried out the storage mode of five equilibrium, because the existence of rule-based implicit index, any one node that has this key Value Data all can serve as Coordinator, and (coordinator node in the Peer node is responsible for coordinating other ordinary node and is finished inter-related task jointly.) role, if that is to say a node has received the key value operation requests of the user data in the memory range to one's name, no matter this user data is master data or Backup Data, this node can calculate the node i d that other a few piece of data is deposited, and the role who serves as Coordinator coordinates two other node and finishes relevant data manipulation.
In an embodiment of the present invention, use the mechanism of this " the common coordination " to guarantee data consistency, its concrete mechanism is:
The tentation data number of copies is K, defines two configurable parameter R and W, and R represents to realize the required minimum number of copies of query requests success, and W represents the required minimum number of copies of update request success.Wherein R and W are integers, satisfy R+W〉K+1, and 1≤R≤K+1,1≤W≤K+1.
When first node receives update request, serve as the Coordinator node automatically, at first data are stamped up-to-date version flag, and preserved in this locality, send the data to K node in the interdependent node tabulation (preference list) then.After receiving W response at least, think to upgrade and operate successfully.
Same, when first node receives query requests, automatically serve as the Coordinator node query requests is transmitted to N node in the interdependent node tabulation (preference list), after receiving R the data of returning, analyze up-to-date version, the latest edition data are returned to the client of sending query requests.
Embodiments of the invention provide a kind of method of depositing the communication network user data, and as shown in Figure 5, this method comprises:
Described step 23 obtains the key value according to user data described to be deposited, and obtains and the immediate DHT node i of described key value d, and this node is selected as depositing the master data of described key value corresponding user data;
Described step 23, the DHT node of depositing of the Backup Data after cutting apart is selected according to rule one or rule two or regular three or regular four, wherein,
One: the i part Backup Data of rule (i is an integer, and 1≤i≤K) is divided into L/K part, wherein j data slice (j is an integer, 1≤j≤L/K), selection is left on the i * j adjacent node of master data place node in the current node that is in line states.
(i is an integer to two: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, and wherein (j is an integer, 1≤j≤L/K) for j data slice, selection is left on the i * j+N adjacent node of master data place node in the current node that is in line states, and N is the integer greater than zero.
(i is an integer to three: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], wherein (j is an integer to j data slice, 1≤j≤L/K), select to leave in node i d in the current node that is in line states near " key=[Dj1～Djh]+size in i * j * Hash space/(K * L+1) " node on.
(i is an integer to four: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], wherein (j is an integer to j data slice, 1≤j≤L/K), select to leave in node i d in the current node that is in line states near " key=[Dj1～Djh]+size in N+i * j * Hash space/(K * L+1) " node on, N be greater than zero integer.
Described step 23 specifically comprises:
Step 231: master data is left on the node of depositing master data of aforementioned selection, and the Backup Data sheet after K * L/K cut apart is respectively to K * L/K DHT node transmission;
Step 232: receive the return information of the DHT node of described reception Backup Data sheet,, then deposit success when the number of the return information that receives during greater than W.Described W is an integer, 1≤W≤L.
Embodiments of the invention also provide a kind of method of inquiring about the communication network user data, and as shown in Figure 6, this method comprises:
Step 31, the first node in the DHT overlay network receives the request of inquiring user data;
Step 32 according to described request, obtains the key value, is worth the DHT nodal information of the described user data of storage according to described key;
Step 33 according to described DHT nodal information, finds and described key value corresponding user data.
Described step 32 specifically comprises:
Step 321: obtain and the immediate DHT node i of described key value d, deposited the master data of described key value corresponding user data on this node;
Step 322: according to described master data place DHT node i d, obtain Backup Data place DHT node i d according to rule one or rule two or regular three or regular four, wherein,
One: the i part Backup Data of rule (i is an integer, 1≤i≤K) be divided into L/K part, and (j is an integer, 1≤j≤L/K) to deposit wherein j data slice of i Backup Data on the i * j adjacent node of master data place node.
(i is an integer to two: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer, and 1≤j≤L/K), N is the integer greater than zero to deposit wherein j data slice of i Backup Data on the i * j+N adjacent node of master data place node.
(i is an integer to three: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], in the current DHT overlay network node i d near " key=[Dj1～Djh]+size in i * j * Hash space/(K * L+1) " node on deposit wherein j data slice of i Backup Data (j be an integer, 1≤j≤L/K).
(i is an integer to four: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], in the current DHT overlay network node i d near " key=[Dj1～Djh]+size in N+i * j * Hash space/(K * L+1) " node on deposit wherein j data slice of i Backup Data (j be an integer, 1≤j≤L/K), N is the integer greater than zero.
Described step 33 specifically comprises:
Step 331: select x node from master data place node and Backup Data place node, (x is an integer, 1≤x≤K+1) to the request of this x node transmission inquiring user data.
Step 332: receive the return information of DHT node of the request of described reception inquiring user data, when the number of the return information that receives during greater than R, successful inquiring then.Described R is an integer, 1≤R≤K+1.
Step 333: the user data in a plurality of return informations that comparison query obtains, return up-to-date data as Query Result.
In the described step 33, described nodal information comprises the nodal information at master data and Backup Data place.
In the described step 33, described user data query can be finished by described first node; Perhaps can notify described master data place node, finish by master data place node by described first node; Perhaps can notify described Backup Data place node, finish by Backup Data place node by described first node.
Embodiments of the invention also provide a kind of method of upgrading the communication network user data, and as shown in Figure 7, this method comprises:
Described step 42 specifically comprises:
Step 421: obtain the DHT node i d of the most approaching described key value, deposited the master data of the user data of described key value on this node;
Step 422: according to described master data place DHT node i d, obtain data place DHT node i d fully according to rule one or rule two or regular three or regular four, wherein,
One: the i part Backup Data of rule (i is an integer, 1≤i≤K) be divided into L/K part, and (j is an integer, 1≤j≤L/K) to deposit wherein j data slice of i Backup Data on the i * j adjacent node of master data place node.
(i is an integer to two: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer, and 1≤j≤L/K), N is the integer greater than zero to deposit wherein j data slice of i Backup Data on the i * j+N adjacent node of master data place node.
(i is an integer to three: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], in the current DHT overlay network node i d near " key=[Dj1～Djh]+size in i * j * Hash space/(K * L+1) " node on deposit wherein j data slice of i Backup Data (j be an integer, 1≤j≤L/K).
(i is an integer to four: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], in the current DHT overlay network node i d near " key=[Dj1～Djh]+size in N+i * j * Hash space/(K * L+1) " node on deposit wherein j data slice of i Backup Data (j be an integer, 1≤j≤L/K), N is the integer greater than zero.
Described step 43 specifically comprises:
Step 431: select x node from master data place node and Backup Data place node, (x is an integer, 1≤x≤K+1) to the request of this x node transmission updating user data.
Step 432: receive the return information of DHT node of the request of described reception updating user data,, then upgrade successfully when the number of the return information that receives during greater than W.Described W is an integer, 1≤W≤K+1.
In the described step 43, described nodal information comprises the nodal information at master data and Backup Data place.
In the described step 43, described user data update can be finished by described first node; Perhaps can notify described master data place node, finish by master data place node by described first node; Perhaps can notify described Backup Data place node, finish by Backup Data place node by described first node.
In order to realize above-mentioned user data operating function, the invention provides three following devices, these three devices can join in the DHT overlay network as a node separately, also can be arbitrarily made with a node and join in the DHT overlay network, promptly the node of DHT overlay network can provide the combination in any of the function of above-mentioned three devices.
Embodiments of the invention provide a kind of device of depositing the communication network user data, and as shown in Figure 8, this device comprises:
Receiving element receives user data to be deposited;
Data partitioning unit, user data described to be deposited is divided into L/K part as Backup Data, described L is more than or equal to the downlink bandwidth of the Section Point in the described DHT overlay network and the ratio of the upstream bandwidth that can be used for the data recovery, wherein Section Point can be a first node, or other node in the described DHT overlay network; Described K is total umber of Backup Data, and K is the integer greater than zero.
The deposit data unit, with user data described to be deposited as master data, with described master data and the Backup Data after K * L/K part cuts apart send to 1+K * L/K DHT node respectively.
Described deposit data unit specifically comprises:
The first data computation unit obtains the key value according to user data described to be deposited, and obtains and the immediate DHT node i of described key value d, and this node is selected as depositing the master data of described key value corresponding user data.
The second data computation unit, the DHT node of selecting to deposit the Backup Data after cutting apart according to rule one or rule two or rule three or rule four, wherein,
One: the i part Backup Data of rule (i is an integer, and 1≤i≤K) is divided into L/K part, wherein j data slice (j is an integer, 1≤j≤L/K), selection is left on the i * j adjacent node of master data place node in the current node that is in line states.
(i is an integer to two: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, and wherein (j is an integer, 1≤j≤L/K) for j data slice, selection is left on the i * j+N adjacent node of master data place node in the current node that is in line states, and N is the integer greater than zero.
(i is an integer to three: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], wherein (j is an integer to j data slice, 1≤j≤L/K), select to leave in node i d in the current node that is in line states near " key=[Dj1～Djh]+size in i * j * Hash space/(K * L+1) " node on.
Rule four: (i is an integer to four: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], wherein (j is an integer to j data slice, 1≤j≤L/K), select to leave in node i d in the current node that is in line states near " key=[Dj1～Djh]+size in N+i * j * Hash space/(K * L+1) " node on, N be greater than zero integer.
Send and preserve the unit, master data is left on the node of depositing master data of aforementioned selection, and the Backup Data sheet after K * L/K cut apart is respectively to K * L/K DHT node transmission;
Described deposit data unit also comprises:
Judging unit receives the return information of the DHT node of described reception Backup Data sheet, when the number of the return information that receives during greater than W, then deposits success.Described W is an integer, 1≤W≤L.
Embodiments of the invention also provide a kind of device of inquiring about the communication network user data, and as shown in Figure 9, this device comprises:
Receiving element receives the request of inquiring user data;
Computing unit according to described request, obtains the key value, is worth the DHT nodal information of the described user data of storage according to described key;
Query unit according to described DHT nodal information, finds and described key value corresponding user data.
Described computing unit comprises:
Second computing unit obtains and the immediate DHT node i of described key value d, has deposited the master data of described key value corresponding user data on this node; According to described master data place DHT node i d, obtain Backup Data place DHT node i d according to rule one or rule two or regular three or regular four, wherein,
One: the i part Backup Data of rule (i is an integer, 1≤i≤K) be divided into L/K part, and (j is an integer, 1≤j≤L/K) to deposit wherein j data slice of i Backup Data on the i * j adjacent node of master data place node.
(i is an integer to two: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer, and 1≤j≤L/K), N is the integer greater than zero to deposit wherein j data slice of i Backup Data on the i * j+N adjacent node of master data place node.
(i is an integer to three: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], in the current DHT overlay network node i d near " key=[Dj1～Djh]+size in i * j * Hash space/(K * L+1) " node on deposit wherein j data slice of i Backup Data (j be an integer, 1≤j≤L/K).
(i is an integer to four: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], in the current DHT overlay network node i d near " key=[Dj1～Djh]+size in N+i * j * Hash space/(K * L+1) " node on deposit wherein j data slice of i Backup Data (j be an integer, 1≤j≤L/K), N is the integer greater than zero.
Described query unit comprises:
Selected cell is selected x node from master data place node and Backup Data place node, (x is an integer, 1≤x≤K+1) to the request of this x node transmission inquiring user data.
Judging unit receives the return information of DHT node of the request of described reception inquiring user data, when the number of the return information that receives during greater than R, and successful inquiring then; User data in a plurality of return informations that comparison query obtains returns up-to-date user data as Query Result.Described R is an integer, 1≤R≤K+1.
In the described query unit, described nodal information comprises the nodal information at master data and Backup Data place.
Described query unit all belongs to same node with receiving element and computing unit, perhaps lays respectively at different nodes; Perhaps described query unit is positioned at described master data place node, and perhaps described query unit is positioned at described Backup Data place node.
Embodiments of the invention also provide a kind of device that upgrades the communication network user data, and as shown in figure 10, this device comprises:
Receiving element receives the request of updating user data;
Computing unit according to described request, obtains the key value, is worth the DHT nodal information of the described user data of storage according to described key;
Updating block according to described DHT nodal information, upgrades and described key value corresponding user data.
Described computing unit comprises:
Second computing unit obtains the DHT node i d of the most approaching described key value, has deposited the master data of the user data of described key value on this node; According to described master data place DHT node i d, obtain data place DHT node i d fully according to rule one or rule two or regular three or regular four, wherein,
One: the i part Backup Data of rule (i is an integer, 1≤i≤K) be divided into L/K part, and (j is an integer, 1≤j≤L/K) to deposit wherein j data slice of i Backup Data on the i * j adjacent node of master data place node.
(i is an integer to two: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer, and 1≤j≤L/K), N is the integer greater than zero to deposit wherein j data slice of i Backup Data on the i * j+N adjacent node of master data place node.
(i is an integer to three: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], in the current DHT overlay network node i d near " key=[Dj1～Djh]+size in i * j * Hash space/(K * L+1) " node on deposit wherein j data slice of i Backup Data (j be an integer, 1≤j≤L/K).
(i is an integer to four: the i part Backup Datas of rule, 1≤i≤K) is divided into L/K part, (j is an integer to j data slice, the key scope of 1≤j≤L/K) is [Dj1～Djh], in the current DHT overlay network node i d near " key=[Dj1～Djh]+size in N+i * j * Hash space/(K * L+1) " node on deposit wherein j data slice of i Backup Data (j be an integer, 1≤j≤L/K), N is the integer greater than zero.
Described updating block comprises:
Selected cell is selected x node from master data place node and Backup Data place node, (x is an integer, 1≤x≤K+1) to the request of this x node transmission updating user data.
Judging unit receives the return information of DHT node of the request of described reception updating user data, when the number of the return information that receives during greater than W, then upgrades successfully.Described W is an integer, 1≤W≤K+1.
In the described updating block, described nodal information comprises the nodal information at master data and Backup Data place.
Described updating block all belongs to same node with receiving element and computing unit, perhaps lays respectively at different nodes; Perhaps described updating block is positioned at described master data place node, and perhaps described updating block is positioned at described Backup Data place node.
Deposit data provided by the invention, inquiry and method for updating and device, can realize the distributed storage of telecommunication user data, significantly promoted the degree of concurrence that node recovers in the DHT stacking network, reduced the system resource of keeping for the maintenance work of DHT stacking network, improve the robustness of whole storage of subscriber data system, reduced in the DHT stacking network unnecessary messages expense between each node.
Claims (29)
1, a kind of method of depositing the communication network user data based on DHT is characterized in that, comprising:
First node in the DHT overlay network receives user data to be deposited;
User data described to be deposited is divided into L/K part as Backup Data, and described L is more than or equal to the downlink bandwidth of the Section Point in the described DHT overlay network and the ratio of the upstream bandwidth that can be used for the data recovery; Described K is total umber of Backup Data, and K is the integer greater than zero;
With user data described to be deposited as master data, with described master data and the Backup Data after K * L/K part cuts apart send to 1+K * L/K DHT node respectively.
2, method according to claim 1 is characterized in that, wherein Section Point can be a first node, or other node in the described DHT overlay network.
3, method according to claim 1 is characterized in that, described with described master data and the Backup Data after K * L/K part cuts apart send to 1+K * L/K DHT node respectively, specifically comprise:
Obtain the key value according to user data described to be deposited, obtain and the immediate DHT node i of described key value d, this node is selected as depositing the master data of described key value corresponding user data;
The DHT node of depositing of the Backup Data after cutting apart is selected according to rule one or rule two or regular three or regular four;
Master data is left on the node of depositing master data of aforementioned selection, and the Backup Data sheet after K * L/K cut apart is respectively to K * L/K DHT node transmission.
4, method according to claim 1 is characterized in that, described with described master data and the Backup Data after K * L/K part cuts apart respectively to 1+K * L/K DHT node, also comprise:
Receive the return information of the DHT node of described reception Backup Data sheet, when the number of the return information that receives during greater than W, then deposit success, described W is an integer, 1≤W≤L+1.
5, a kind of method of the inquiry communication network user data based on DHT is characterized in that, comprising:
First node in the DHT overlay network receives the request of inquiring user data;
According to described request, obtain the key value, be worth the DHT nodal information of the described user data of storage according to described key;
According to described DHT nodal information, find and described key value corresponding user data.
6, method according to claim 5 is characterized in that, the described DHT nodal information that is worth the described user data of storage according to described key specifically comprises:
Obtain and the immediate DHT node i of described key value d, deposited the master data of described key value corresponding user data on this node;
According to described master data place DHT node i d, obtain Backup Data place DHT node i d according to rule one or rule two or regular three or regular four.
7, method according to claim 5 is characterized in that, and is described according to described DHT nodal information, finds and described key value corresponding user data, specifically comprises:
Select x node from master data place node and Backup Data place node, to the request of this x node transmission inquiring user data, x is an integer, 1≤x≤K+1;
Receive the return information of DHT node of the request of described reception inquiring user data, when the number of the return information that receives during greater than R, successful inquiring then, described R is an integer, 1≤R≤K+1;
User data in a plurality of return informations that comparison query obtains returns up-to-date data as Query Result.
8, method according to claim 5 is characterized in that, described nodal information comprises the nodal information at master data and Backup Data place.
9, method according to claim 5 is characterized in that, and is described according to described DHT nodal information, find and described key value corresponding user data,
Can finish by described first node; Perhaps can notify described master data place node, finish by master data place node by described first node; Perhaps can notify described Backup Data place node, finish by Backup Data place node by described first node.
10, a kind of method of the renewal communication network user data based on DHT is characterized in that, comprising:
First node in the DHT overlay network receives the request of updating user data;
According to described request, obtain the key value, be worth the DHT nodal information of the described user data of storage according to described key;
According to described DHT nodal information, upgrade and described key value corresponding user data.
11, method according to claim 10 is characterized in that, and is described according to described request, obtains the key value, and the DHT nodal information according to described key is worth the described user data of storage specifically comprises:
Obtain the DHT node i d of the most approaching described key value, deposited the master data of the user data of described key value on this node;
According to described master data place DHT node i d, obtain data place DHT node i d fully according to rule one or rule two or regular three or regular four.
12, method according to claim 10 is characterized in that, and is described according to described DHT nodal information, upgrades and described key value corresponding user data, specifically comprises:
Select x node from master data place node and Backup Data place node, to the request of this x node transmission updating user data, x is an integer, 1≤x≤K+1.
Receive the return information of DHT node of the request of described reception updating user data, when the number of the return information that receives during greater than W, then upgrade successfully, described W is an integer, 1≤W≤K+1.
13, method according to claim 10 is characterized in that, described nodal information comprises the nodal information at master data and Backup Data place.
14, method according to claim 10 is characterized in that, and is described according to described DHT nodal information, upgrade and described key value corresponding user data,
Can finish by described first node; Perhaps can notify described master data place node, finish by master data place node by described first node; Perhaps can notify described Backup Data place node, finish by Backup Data place node by described first node.
15, a kind of device of depositing the communication network user data based on DHT is characterized in that, comprising:
Receiving element receives user data to be deposited;
Data partitioning unit is divided into L/K part with user data described to be deposited as Backup Data, and described L is greater than the downlink bandwidth of the Section Point in the described DHT overlay network and the ratio of the upstream bandwidth that can be used for the data recovery; Described K is total umber of Backup Data, and K is the integer greater than zero;
The deposit data unit, with user data described to be deposited as master data, with described master data and the Backup Data after K * L/K part cuts apart send to 1+K * L/K DHT node respectively.
16, device according to claim 15 is characterized in that, wherein Section Point can be a first node, or other node in the described DHT overlay network.
17, device according to claim 15 is characterized in that, described deposit data unit specifically comprises:
The first data computation unit obtains the key value according to user data described to be deposited, and obtains and the immediate DHT node i of described key value d, and this node is selected as depositing the master data of described key value corresponding user data;
The second data computation unit, the DHT node of selecting to deposit the Backup Data after cutting apart according to rule one or rule two or rule three or rule four;
Send and preserve the unit, master data is left on the node of depositing master data of aforementioned selection, and the Backup Data sheet after K * L/K cut apart is respectively to K * L/K DHT node transmission.
18, device according to claim 15 is characterized in that, described deposit data unit also comprises:
Judging unit receives the return information of the DHT node of described reception Backup Data sheet, when the number of the return information that receives during greater than W, then deposits success.Described W is an integer, 1≤W≤L.
19, a kind of device of the inquiry communication network user data based on DHT is characterized in that, comprising:
Receiving element receives the request of inquiring user data;
Computing unit according to described request, obtains the key value, is worth the DHT nodal information of the described user data of storage according to described key;
Query unit according to described DHT nodal information, finds and described key value corresponding user data.
20, device according to claim 19 is characterized in that, described computing unit comprises:
Second computing unit obtains and the immediate DHT node i of described key value d, has deposited the master data of described key value corresponding user data on this node; According to described master data place DHT node i d, obtain Backup Data place DHT node i d according to rule one or rule two or regular three or regular four.
21, device according to claim 19 is characterized in that, described query unit comprises:
Selected cell is selected x node from master data place node and Backup Data place node, to the request of this x node transmission inquiring user data, x is an integer, 1≤x≤K+1;
Judging unit receives the return information of DHT node of the request of described reception inquiring user data, when the number of the return information that receives during greater than R, and successful inquiring then; User data in a plurality of return informations that comparison query obtains returns up-to-date user data as Query Result; Described R is an integer, 1≤R≤K+1.
22, device according to claim 19 is characterized in that, in the described query unit, described nodal information comprises the nodal information at master data and Backup Data place.
23, device according to claim 19 is characterized in that, described query unit all belongs to same node with receiving element and computing unit, perhaps lays respectively at different nodes; Perhaps described query unit is positioned at described master data place node, and perhaps described query unit is positioned at described Backup Data place node.
24, a kind of device of the renewal communication network user data based on DHT is characterized in that, comprising:
Receiving element receives the request of updating user data;
Computing unit according to described request, obtains the key value, is worth the DHT nodal information of the described user data of storage according to described key;
Updating block according to described DHT nodal information, upgrades and described key value corresponding user data.
25, device according to claim 24 is characterized in that, described computing unit comprises:
Second computing unit obtains the DHT node i d of the most approaching described key value, has deposited the master data of the user data of described key value on this node; According to described master data place DHT node i d, obtain data place DHT node i d fully according to rule one or rule two or regular three or regular four.
26, device according to claim 24 is characterized in that, described updating block comprises:
Selected cell is selected x node from master data place node and Backup Data place node, to the request of this x node transmission updating user data, x is an integer, 1≤x≤K+1;
Judging unit receives the return information of DHT node of the request of described reception updating user data, when the number of the return information that receives during greater than W, then upgrades successfully, and described W is an integer, 1≤W≤K+1.
27, device according to claim 24 is characterized in that, in the described updating block, described nodal information comprises the nodal information at master data and Backup Data place.
28, device according to claim 24 is characterized in that, described updating block all belongs to same node with receiving element and computing unit, perhaps lays respectively at different nodes; Perhaps described updating block is positioned at described master data place node, and perhaps described updating block is positioned at described Backup Data place node.
29, a kind of communication apparatus is characterized in that, comprising:
Based on the device of depositing the communication network user data of DHT, perhaps
Based on the device of the inquiry communication network user data of DHT, perhaps
Device based on the renewal communication network user data of DHT;
The described device of depositing the communication network user data based on DHT comprises:
Receiving element receives user data to be deposited;
Data partitioning unit is divided into L/K part with user data described to be deposited as Backup Data, and described L is greater than the downlink bandwidth of the Section Point in the described DHT overlay network and the ratio of the upstream bandwidth that can be used for the data recovery; Described K is total umber of Backup Data, and K is the integer greater than zero;
The deposit data unit, with user data described to be deposited as master data, with described master data and the Backup Data after K * L/K part cuts apart send to 1+K * L/K DHT node respectively;
The device of described inquiry communication network user data based on DHT comprises:
Receiving element receives the request of inquiring user data;
Computing unit according to described request, obtains the key value, is worth the DHT nodal information of the described user data of storage according to described key;
Query unit according to described DHT nodal information, finds and described key value corresponding user data;
The device of described renewal communication network user data based on DHT comprises:
Receiving element receives the request of updating user data;
Computing unit according to described request, obtains the key value, is worth the DHT nodal information of the described user data of storage according to described key;
Updating block according to described DHT nodal information, upgrades and described key value corresponding user data.
Priority Applications (6)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810082876XA CN101505473B (en) | 2008-02-05 | 2008-02-29 | Method and apparatus for telecommunication network user data storage management |
| PCT/CN2008/072549 WO2009100636A1 (en) | 2008-02-05 | 2008-09-26 | A method and device for the storage management of the user data in the telecommunication network |
| AT08172134T ATE470325T1 (en) | 2008-02-05 | 2008-12-18 | METHOD AND DEVICES FOR PROCESSING AND MANAGING SUBSCRIBER DATA IN A TELECOMMUNICATIONS NETWORK |
| DE200860001432 DE602008001432D1 (en) | 2008-02-05 | 2008-12-18 | Methods and apparatus for processing and managing subscriber data in a telecommunications network |
| EP08172134A EP2088808B1 (en) | 2008-02-05 | 2008-12-18 | Methods and apparatuses for processing and managing subscriber data in telecommunication network |
| US12/338,309 US7916629B2 (en) | 2008-02-05 | 2008-12-18 | Methods and apparatuses for processing and managing subscriber data in telecommunication network |
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810065362 | 2008-02-05 | ||
| CN200810065362.3 | 2008-02-05 | ||
| CN200810082876XA CN101505473B (en) | 2008-02-05 | 2008-02-29 | Method and apparatus for telecommunication network user data storage management |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105669767A Division CN101997726B (en) | 2008-02-05 | 2008-02-29 | Method and device for storing and managing telecommunication network user data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101505473A true CN101505473A (en) | 2009-08-12 |
| CN101505473B CN101505473B (en) | 2011-05-04 |
Family
ID=40977489
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105669767A Active CN101997726B (en) | 2008-02-05 | 2008-02-29 | Method and device for storing and managing telecommunication network user data |
| CN200810082876XA Expired - Fee Related CN101505473B (en) | 2008-02-05 | 2008-02-29 | Method and apparatus for telecommunication network user data storage management |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105669767A Active CN101997726B (en) | 2008-02-05 | 2008-02-29 | Method and device for storing and managing telecommunication network user data |
Country Status (3)
| Country | Link |
|---|---|
| CN (2) | CN101997726B (en) |
| AT (1) | ATE470325T1 (en) |
| DE (1) | DE602008001432D1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103973810A (en) * | 2014-05-22 | 2014-08-06 | 华为技术有限公司 | Data processing method and device based on IP disk |
| CN108829539A (en) * | 2018-06-08 | 2018-11-16 | 中国联合网络通信集团有限公司 | Data backup, data reconstruction method and equipment |
| CN109660493A (en) * | 2017-10-11 | 2019-04-19 | 南京南瑞继保电气有限公司 | A kind of new energy collection control cloud storage method based on block chain |
| CN113010119A (en) * | 2021-04-27 | 2021-06-22 | 宏图智能物流股份有限公司 | Method for realizing distributed storage of voice data through main/standby mode |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110532271A (en) * | 2019-08-30 | 2019-12-03 | 北京浪潮数据技术有限公司 | Distributed storage method, control system and the device realized based on DHT algorithm |
| CN111352938B (en) * | 2020-02-26 | 2023-07-18 | 深圳市迅雷网络技术有限公司 | Data processing method, computer device and storage medium |
| CN113655969B (en) * | 2021-08-25 | 2022-09-16 | 北京中电兴发科技有限公司 | Data balanced storage method based on streaming distributed storage system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1331331C (en) * | 2004-04-27 | 2007-08-08 | 国家数字交换系统工程技术研究中心 | Method for implementing self-organizing network |
| CN101043695A (en) * | 2006-03-23 | 2007-09-26 | 上海宇梦通信科技有限公司 | Method for storing and maintaining user equipment information in mobile communication system |
-
2008
- 2008-02-29 CN CN2010105669767A patent/CN101997726B/en active Active
- 2008-02-29 CN CN200810082876XA patent/CN101505473B/en not_active Expired - Fee Related
- 2008-12-18 AT AT08172134T patent/ATE470325T1/en not_active IP Right Cessation
- 2008-12-18 DE DE200860001432 patent/DE602008001432D1/en active Active
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103973810A (en) * | 2014-05-22 | 2014-08-06 | 华为技术有限公司 | Data processing method and device based on IP disk |
| CN109660493A (en) * | 2017-10-11 | 2019-04-19 | 南京南瑞继保电气有限公司 | A kind of new energy collection control cloud storage method based on block chain |
| CN109660493B (en) * | 2017-10-11 | 2020-12-18 | 南京南瑞继保电气有限公司 | New energy centralized control cloud storage method based on block chain |
| CN108829539A (en) * | 2018-06-08 | 2018-11-16 | 中国联合网络通信集团有限公司 | Data backup, data reconstruction method and equipment |
| CN113010119A (en) * | 2021-04-27 | 2021-06-22 | 宏图智能物流股份有限公司 | Method for realizing distributed storage of voice data through main/standby mode |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101997726B (en) | 2012-10-03 |
| ATE470325T1 (en) | 2010-06-15 |
| CN101505473B (en) | 2011-05-04 |
| DE602008001432D1 (en) | 2010-07-15 |
| CN101997726A (en) | 2011-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101997726B (en) | Method and device for storing and managing telecommunication network user data | |
| US20120047244A1 (en) | Distributed Network Management System, Network Element Management Server, and Data Configuration Management Method | |
| CN101626563B (en) | Data storage system in communication network and information processing method | |
| EP2086204A2 (en) | Method and system for data synchronisation between network devices | |
| CN103902410B (en) | The data backup accelerated method of cloud storage system | |
| CN105025053A (en) | Distributed file upload method based on cloud storage technology and system | |
| CN102761861A (en) | Information updating method, server and information updating system | |
| CN101741830A (en) | Method, system, client and server for realizing multi-client data synchronization | |
| CN102799628A (en) | Method and device for data partitioning in key-value database | |
| US7860827B1 (en) | Data synchronization method for an application database available on multiple wirelessly connected platforms | |
| CN101635680B (en) | Service routing method and service routing system | |
| CN107734017B (en) | Data service method and system | |
| CN102306165A (en) | Ship electronic chart data multi-platform shared service device and construction method thereof | |
| CN105550306A (en) | Multi-copy data reading/writing method and system | |
| EP2088808B1 (en) | Methods and apparatuses for processing and managing subscriber data in telecommunication network | |
| CN103428288B (en) | Based on the copies synchronized method of subregion state table and coordinator node | |
| CN110311979A (en) | A kind of the task immigration method and relevant apparatus of MEC server | |
| CN114422331A (en) | Disaster tolerance switching method, device and system | |
| CN100407623C (en) | Method and system for user data transaction in communication system | |
| KR101342258B1 (en) | Deistributed data management system and method thereof | |
| CN101834914A (en) | Method for realizing mapping relation between identity and position | |
| WO2015074382A1 (en) | Method for optimizing index, master database node and subscriber database node | |
| CN109522294A (en) | A kind of distributed data cache system and data cache method | |
| CN111797166B (en) | Method and device for synchronizing quasi-real-time resume data, electronic equipment and medium | |
| CN104717262A (en) | Enterprise address book downloading method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110504 |