CN1937557A - Structured reciprocal network system and its load query, transfer and resource seeking method - Google Patents
Structured reciprocal network system and its load query, transfer and resource seeking method Download PDFInfo
- Publication number
- CN1937557A CN1937557A CN 200610122064 CN200610122064A CN1937557A CN 1937557 A CN1937557 A CN 1937557A CN 200610122064 CN200610122064 CN 200610122064 CN 200610122064 A CN200610122064 A CN 200610122064A CN 1937557 A CN1937557 A CN 1937557A
- Authority
- CN
- China
- Prior art keywords
- load
- node
- peer
- information
- structured
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention provides a structured peer-to-peer network system able to assure load balancing and the load inquiring and transferring and resource finding methods thereof, where node equipment mainly comprises storage unit, load transferring processing unit and resource finding unit. And it stores the peer-to-peer network system load information in each node equipment, and when load of some node equipment is overhigh, selects a node equipment with lighter load according to the load information and transfers the overhigh load to the node equipment with lither load, thus able to assure the system keeps load balancing. As long as there is load allocation unbalance in the system, it can implement load balancing.
Description
Technical field
(Peer-to-Peer, P2P) technical field in particular, the present invention relates to a kind of structured p2p network system and load query, transfer and resource lookup method of proof load equilibrium to the present invention relates to peer-to-peer network.
Background technology
Peer-to-peer network is very popular at present application technology, and so-called peer-to-peer network is meant a kind of distributed network system (DNS), and in this network, all nodes all are reciprocity.Usually, different according to nodal information storage and way of search, many P2P networks can be divided into 2 big classes: structuring (Structured) peer-to-peer network and destructuring (Unstructured) peer-to-peer network system.In non-structured P2P system, the information or the information index (as pointer and IP address) of each node storage self, and in the structured P 2 P network system, each node is only stored the index of information specific or customizing messages.
Usually, structurized peer-to-peer network decides the memory address of each object by the method for Hash, therefore, once the many situations of object of certain Hash key assignments correspondence occur, the unbalanced phenomenon of partial load will appear in system, the structuring ring-type peer-to-peer network system of the responsive Hash of position-based for example, because the skewness of its object set own, the cryptographic Hash set later through the hash function computing of position sensing kept original skewness; Even equally distributed object set, through after the Hash operation of position sensing, still can be owing to some characteristic of these functions itself is brought the new skewness problem that weighs, cause in the peer-to-peer network system partial load overweight.
In order to solve the unbalanced problem of load in the peer-to-peer network system, available technology adopting the relevant node of a kind of load add mechanism, it considers initiate node is joined the heavy zone of system load to help to alleviate the unbalanced situation of load, it is node load information with reference near the node node region of its adding when adding, if near the heavier node of load is arranged, then consider to join the near place of the node heavier to share a part of load of the heavy node of this load apart from load.
But there is following defective in this kind method:
At first, if there is not node to add when load is overweight, then system solves the unbalanced problem of load with regard to having no idea;
Secondly, if in one section continuous node region node has been arranged, and their load is all overweight, even there is new node to add system, also can do nothing to help them and solves the overweight problem of load;
Once more, node all is added to high load area, owing to roll off the production line in the node meeting constantly, what then object can not stop gyrates between node, causes the instability of high load area.
Therefore, need a kind of more reasonably load-balancing method, can be with the adding of node/withdraw from the influence that brings to system to drop to minimum.
Summary of the invention
But the technical problem that the present invention solves provides a kind of structured p2p network system and load query, transfer and resource lookup method of proof load equilibrium, with the adding that alleviates node/withdraw from the influence that brings to system, keeps system stability.
For addressing the above problem, the node device of a kind of structured p2p network of the present invention system mainly includes:
Memory cell: store peer-to-peer network system routing information, peer-to-peer network system load information and load transfer recorded information;
Load transfer processing unit: shift the overweight load of this node device according to described peer-to-peer network system load information selected target load transfer node device and to described selected targeted loads transfering node equipment;
Resource lookup unit: carry out resource lookup according to described peer-to-peer network system routing information and described load transfer recorded information.
In addition, also comprise the renewal processing unit: the peer-to-peer network system load information of the described cell stores of regular update.
Alternatively, the described peer-to-peer network employing Chord of system ring, described peer-to-peer network system load information is node set and the load capacity thereof according to the load process allowance in each node identification zone of the node identification zone difference corresponding stored of each clauses and subclauses of Chord loop systems routing iinformation;
Described renewal processing unit comprises:
Load query processing unit: inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the node identification zone of each clauses and subclauses;
Updating block: according to the node set and the load capacity thereof of the load process allowance in the node identification zone of each clauses and subclauses of the Query Result update system load information of described load query processing unit.
Alternatively, described peer-to-peer network system adopts balanced binary tree, and described peer-to-peer network system load information be to distinguish the node set and the load capacity thereof of load process allowance in each subtree zone of corresponding stored according to the subtree zone of each clauses and subclauses of balanced binary tree system routing information;
Described renewal processing unit comprises:
Load query processing unit: inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the subtree zone of each clauses and subclauses;
Updating block: according to the node set and the load capacity thereof of the load process allowance in the subtree zone of each clauses and subclauses of the Query Result update system load information of described load query processing unit.
Alternatively, described load transfer processing unit specifically comprises:
Determining unit: determine targeted loads transfering node equipment according to described structured p2p network system load information;
Query unit: inquire about described definite targeted loads transfering node equipment and whether can accept load transfer;
Buanch unit: if Query Result is for being, then to described definite targeted loads transfering node equipment transferring load.
Wherein, the targeted loads transfering node equipment determined of described determining unit is a lightest node device of the load selected in the load process allowance node set or one or more node devices of selecting at random.
Accordingly, a kind of structured p2p network of the present invention system comprises a plurality of node devices, and described node device includes:
Memory cell: store peer-to-peer network system routing information, peer-to-peer network system load information and load transfer recorded information;
Load transfer processing unit: shift the overweight load of this node device according to described peer-to-peer network system load information selected target load transfer node device and to described selected targeted loads transfering node equipment;
Resource lookup unit: carry out resource lookup according to described peer-to-peer network system routing information and described load transfer recorded information.
In addition, described node device also comprises the renewal processing unit: the peer-to-peer network system load information of the described cell stores of regular update.
Alternatively, the described peer-to-peer network employing Chord of system ring, described peer-to-peer network system load information is node set and the load capacity thereof according to the load process allowance in each node identification zone of the node identification zone difference corresponding stored of each clauses and subclauses of Chord loop systems routing iinformation;
Described renewal processing unit comprises:
Load query processing unit: inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the node identification zone of each clauses and subclauses;
Updating block: according to the node set and the load capacity thereof of the load process allowance in the node identification zone of each clauses and subclauses of the Query Result update system load information of described load query processing unit.
Alternatively, described peer-to-peer network system adopts balanced binary tree, and described peer-to-peer network system load information be to distinguish the node set and the load capacity thereof of load process allowance in each subtree zone of corresponding stored according to the subtree zone of each clauses and subclauses of balanced binary tree system routing information;
Described renewal processing unit comprises:
Load query processing unit: inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the subtree zone of each clauses and subclauses;
Updating block: according to the node set and the load capacity thereof of the load process allowance in the subtree zone of each clauses and subclauses of the Query Result update system load information of described load query processing unit.
Wherein, described load transfer processing unit comprises:
Determining unit: determine targeted loads transfering node equipment according to described structured p2p network system load information;
Query unit: inquire about described definite targeted loads transfering node equipment and whether can accept load transfer;
Buanch unit: if Query Result is for being, then to described definite targeted loads transfering node equipment transferring load.
Wherein, the targeted loads transfering node equipment determined of described determining unit is the lightest one or more node devices of the load selected in the load process allowance node set or one or more node devices of selecting at random.
Correspondingly, node device load method for updating in a kind of structured p2p network of the present invention system, described structured p2p network system comprises a plurality of node devices, store in each node device according to the node identification zone of each clauses and subclauses of Chord loop systems the routing iinformation node set of the load process allowance in each node identification zone of corresponding stored and the system load information of load capacity thereof respectively, mainly comprise the steps:
Inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the node identification zone of each clauses and subclauses;
Upgrade the load process allowance node set and the load capacity thereof in the node identification zone of each clauses and subclauses according to Query Result.
Wherein, described node identification zone according to each clauses and subclauses is inquired about in each node identification zone load process allowance node set respectively and load capacity comprises:
Inquire load process allowance node and load capacity thereof in this node identification zones of node of node identification zone indication of each clauses and subclauses;
The system load information that the node device of the node identification of each clauses and subclauses zone indication is inquired about this node device is returned load process allowance node and the load capacity information thereof in the described node identification zone.
Correspondingly, node device load method for updating in a kind of structured p2p network of the present invention system, described structured p2p network system comprises a plurality of node devices, store in each node device according to the subtree zone of each clauses and subclauses of balanced binary tree the system routing information node set of the load process allowance in each subtree zone of corresponding stored and the system load information of load capacity thereof respectively, mainly comprise the steps:
Inquire about load process allowance node set and load capacity thereof in each subtree zone respectively according to the subtree zone of each clauses and subclauses;
Upgrade the load process allowance node set and the load capacity thereof in the subtree zone of each clauses and subclauses according to Query Result.
Wherein, described subtree zone according to each clauses and subclauses is inquired about in each subtree zone load process allowance node set respectively and load capacity comprises:
Inquire load process allowance node and load capacity thereof in this subtree zones of node of subtree zone indication of each clauses and subclauses;
The system load information that the node device of the subtree of each clauses and subclauses zone indication is inquired about this node device is returned load process allowance node and the load capacity information thereof in the described subtree zone.
Correspondingly, the load transfer method of node device in a kind of structured p2p network of the present invention system, described structured p2p network system comprises a plurality of node devices, and each node device stores described structured p2p network system load information, mainly comprises the steps:
It is overweight to be checked through the load of this node device, and query structure peer-to-peer network system load information is determined targeted loads transfering node equipment;
The load transfer that this node device is overweight is to the targeted loads transfering node equipment of determining.
Wherein, the load transfer with this node device also comprised before the targeted loads transfering node equipment of determining:
Whether query aim load transfer node device can accept transferring load, if, then carry out the load transfer of this node device to the targeted loads transfering node equipment of determining, otherwise, initiate again to shift after then waiting structured p2p network system load information to be updated.
Wherein, described definite targeted loads transfering node equipment is one or more node devices of selecting at random in the lightest one or more node devices of load or the set of load process allowance node device in the load process allowance node device set.
Correspondingly, resource lookup method in a kind of structured p2p network of the present invention system, described structured p2p network system comprises a plurality of node devices, and each node device stores described structured p2p network system load information and load transfer recorded information, mainly comprises the steps:
Determine the destination node equipment at resource place according to system routing information;
Whether the resource of judging described destination node equipment shifts, if judged result then shifts recorded information according to resource load and determines the node device that resource transfers is deposited for being, otherwise, determine that described destination node equipment is that resource is deposited node device.
Compared with prior art, the present invention has following beneficial effect:
Among the present invention by storing this peer-to-peer network system load information at each node device of structured p2p network system, when the load too high of certain node device, select the node device that load is lighter according to described peer-to-peer network system load information, and with this too high load transfer to the lighter node device of described load, thereby can the assurance system keep load balancing.It doesn't matter to adopt which kind of hash algorithm in the present invention and the structured p2p network system, as long as have the load allocating inequality in the system, just can use the present invention and realize load balancing.
Description of drawings
Fig. 1 is the principle schematic of load-balancing method of the present invention;
Fig. 2 is that the function relevant with load formed schematic diagram in the node device in the structured p2p network of the present invention system;
Fig. 3 is a kind of realization schematic diagram of load transfer processing unit of the present invention;
Fig. 4 is the schematic diagram that the present invention is based on Chord ring storage gathering system load information;
Fig. 5 is the schematic diagram that the present invention is based on balanced binary tree structure storage gathering system load information.
Embodiment
With reference to figure 1, core of the present invention is to store this peer-to-peer network system load information at each node device of structured p2p network system, when the load too high of certain node device, select the node device that load is lighter according to described peer-to-peer network system load information, and with this too high load transfer to the lighter node device of described load, thereby can the assurance system keep load balancing, the present invention is because with node adding/escape mechanism and the decoupling zero of load balance mechanism, avoided the relevant node of load to add the born defective of mechanism, can realize the load balancing of peer-to-peer network system, be described in detail below.
With reference to figure 2, this figure is the composition schematic diagram of the node device in the present invention structured p2p network system relevant with load.
As shown, the node device among the present invention in the structured p2p network system includes: memory cell 11, load transfer processing unit 12 and resource lookup unit 13, wherein
Load transfer processing unit 12, the processing unit of load transfer described in the present invention 12 can shift the overweight load of this node device according to the selected node device of described peer-to-peer network system load information and to described selected node device;
As a concrete realization, with reference to figure 3, described load transfer processing unit 12 can comprise:
Determining unit 121, described determining unit 121 are mainly used in according to described structured p2p network system load information determines targeted loads transfering node equipment;
Whether query unit 122, described query unit 122 are mainly used in the described definite targeted loads transfering node equipment of inquiry can accept load transfer;
In addition, also can comprise among the present invention and upgrade processing unit 14, but upgrade the peer-to-peer network system load information that the described memory cell 11 of processing unit 14 regular updates is stored described in the present invention, can adopt different update strategies during specific implementation, repeat no more here.
Can form structured p2p network of the present invention system by above-mentioned each node device, structured p2p network of the present invention system comprises a plurality of node devices, and the composition structure of described node device repeats no more as shown in Figure 2 here.
Need explanation, system load information can adopt the various forms storage among the present invention, but need guarantee to carry out load transfer in distributed system the time, needs to reduce as far as possible the expense that shifts; And the facility of inquiry work after fully taking into account.
Describe with embodiment below based on the system load information storage of the routing algorithm of Chord ring.
Routing mechanism based on the Chord ring in the present embodiment carries out the storage of system load information, and in the Chord ring, system routing information is with the form storage of System Routing Table, and its principle is as follows:
In a Chord ring of representing node ID with m position binary code, can hold 2 altogether
mIndividual node.When node adds system, get a number (0～2 at first at random
mBetween) as its ID, join system then, if this ID does not have node to take, then add smoothly; If the existing node of this ID takies, then find the vacant ID of this ID back minimum to add.First node adds fashionable in system, all clauses and subclauses all point to it oneself in its System Routing Table, all nodes are all safeguarded under the situation of System Routing Table separately in system like this, if there is a new node P to add, the System Routing Table construction method of this node is: generate m bar routing table entry, the corresponding ID of i bar clauses and subclauses is at [p+2
I-1, p+2
i) the minimum node ID of scope interior nodes numbering; If ID is not taken by node in this scope, then record is than the minimum node ID of numbering in the bigger node of this numbering.For example in Fig. 4, the 6th routing table entry (being the clauses and subclauses of i=6) of No. 8 nodes just shows [8+2
5, 8+2
6) in the scope, and promptly [40,72) the minimum node of numbering is No. 48 in the scope.And the 1st route entry (clauses and subclauses of i=1) just show [9,10) do not have node in the middle of the scope, and No. 14 nodes node that is minimums in the numbering node big than 9.In Chord ring, node rolls off the production line on can be constantly, so each node device will check constantly all whether every routing table entry information in the own System Routing Table is correct, thereby makes the whole system normal operation.
When a node i was wanted contact node j, it at first checked j in which zone of routing table, then the corresponding node of contact.With Fig. 4 is example, if node 8 is wanted contact node 51, can find to drop on the zone of the 6th System Routing Table No. 51, therefore goes to get in touch 48 earlier; Again by No. 48 nodes according to the System Routing Table of identical strategy and No. 48 node records itself and then find No. 51 nodes to carry out exchanges data.
In Chord ring, objects stored adopts consistency hash function (as SHA1) that object is transformed to an integer, then this object is left on the node with this integer-bit ID.If this node does not exist in the system, so just leave on the node of the numbering minimum bigger than this ID.With Fig. 4 is example, cryptographic Hash [9,13) object in the scope all is stored on No. 14 nodes, based on this and aforesaid routing policy, can guarantee that all objects can both be very fast found.
System load information is collected and the routing mechanism form that depends on Chord is adopted in storage in the present embodiment, safeguards that by each node device a system load table collects the overall load situation (being system load information) with register system.Concrete, system load information is node set and the load capacity thereof according to the load process allowance in each node identification zone of the node identification zone difference corresponding stored of each clauses and subclauses of Chord loop systems routing iinformation.
And concrete system load information update method is as follows:
At first, inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the node identification zone of each clauses and subclauses;
Each node note [log n] rule purpose system load table, these clauses and subclauses all are empty during system initialization.The i bar entry record of node p be [p+2
I-1, p+2
i) the lightest node identification of interval internal burden and the load capacity of this node.This information gets by the node in this node identification zone of indication in the inquiry system routing table.Concrete inquiry is to liking i bar clauses and subclauses indication node in the inquiry system routing table; The content of inquiry is from this node (comprising this node) back 2
I-1-1 node and load capacity thereof that the range of nodes internal burden is lighter after a node is received the request of query load, can be replied this inquiry by i-1 bar clauses and subclauses before the system load table of consulting oneself; The node device of initiating to upgrade like this can upgrade the load process allowance node set and the load capacity thereof in the node identification zone of each clauses and subclauses according to Query Result.
Realize above-mentioned renewal, as a kind of concrete realization, upgrading processing unit described in the present invention can comprise:
Load query processing unit: inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the node identification zone of each clauses and subclauses;
Updating block: according to the node set and the load capacity thereof of the load process allowance in the node identification zone of each clauses and subclauses of the Query Result update system load information of described load query processing unit.
If certain scope does not have node, be empty to deserved clauses and subclauses in the system load table so.Such system load table can allow each node can both know whom the light or the lightest node of load is in the whole network, so that shift a part of load to it when node surpasses load capacity.
With peer-to-peer network shown in Figure 4 is example, when the system load table is initialized, understands the clauses and subclauses of at first establishment and System Routing Table equal number, and every clauses and subclauses are all put sky.Then, each node begins these clauses and subclauses of regular update.With No. 8 nodes is example, between the 1st, 2,3,4,5,6 clauses and subclauses difference of its routing table recording areas [9,10), [10,12), [12,16), [16,24), [24,40), [40,72) but interior the lightest node device numbering and the load capacity of load.These information are by No. 8 node device regular updates the time, the information that inquiry obtains.With the 3rd is example, No. 8 node is found in the System Routing Table, routing iinformation points to No. 14 nodes, so No. 14 node devices of No. 8 node device inquiries: since No. 14 node devices (comprising node device No. 14), and year light or the lightest load process allowance node set and load capacity thereof in the scope of 3 node devices in back, No. 14 node device is received after such inquiry, preceding two rule purpose system load situations of relatively more own loading condition and its system load table centre return to node No. 8 with the information of load process allowance node set and load capacity thereof.Other clauses and subclauses of No. 8 nodes can obtain equally by similar inquiry, here repeat no more, same principle, each node device in the peer-to-peer network system also all is a system load table of safeguarding oneself by such inquiry, such benefit is, each node only need safeguard that very a spot of information just can know the roughly situation of the load in the whole system.
In addition, but among the present invention also memory load shift the recorded information form storage of system's transfer table (in the present embodiment with), system's transfer table has write down all should leave the actual storage situation of an object on the node in.With No. 8 nodes is example, owing to there are not 5,6, No. 7 nodes to have No. 8 actual all objects that are to blame cryptographic Hash in the 5-8 interval of node in the system.Therefore, it is overweight that No. 8 nodes may load occur, thus it to make a policy cryptographic Hash be that 100 objects of 5 are all transferred to No. 48 nodes and got on; With cryptographic Hash is that 120 objects of 6,7 are transferred to No. 51 nodes and got on.
Describe with embodiment below based on the system load information storage of the routing algorithm of balanced binary tree structure.
The balanced binary tree design feature is: the node that the leaf node representative is concrete; Middle node of divergence and the root of tree then are abstract nodes.As shown in Figure 5, black entity node represents to add the node of system, and blank node represents also not have system's reserved location of node adding.Get an ID at first at random when node adds,, then join this position if this position does not have node; Otherwise seeking a nearest room to the right adds, each joint structure routing table is in layer subtree structure up from the bottom, all looks for an alike tree to the right at every turn, seeks corresponding node then, if can not find, then look for the minimum node of right side numbering.With node 7 is example, the 0th corresponding upwards 0 layer the subtree of routing table, and turning right and finding alike node is No. 8, and it is recorded in the System Routing Table; Article 1, corresponding upwards 1 layer the subtree of routing table, turning right and finding alike node is No. 9, because No. 9 nodes also add, then finds node 11 to the right, is recorded in the System Routing Table 11; Article 2, corresponding upwards 2 layers the subtree of routing table is turned right and is found alike node No. 11, because No. 11 nodes exist, then is recorded in the System Routing Table.Article 2, corresponding upwards three layers the subtree of routing table is turned right and is found alike node No. 15, because No. 15 nodes do not exist, (returns 0 after crossing the border) then to the right and finds node 2, is recorded in the System Routing Table.The System Routing Table of other node (as 2 and 5) all can be adopted to use the same method and obtain, and repeats no more here.
When storage object and the Chord lopps seemingly, each object is through leaving in after Hash operation on the corresponding node.If node does not exist, then leave on the nearest node in right side.In Fig. 5, key assignments is that 0,1,2,15 object all leaves on the node 2, and key assignments is that 3,4,5 object leaves on the node 5, and key assignments is that 6,7 object leaves on the node 7.
The similar Chord ring of storage of system load table and information gathering in the present embodiment, different is that the implication of each bar record slightly changes.In the system load table of present embodiment, the information of record is that the corresponding node from a record of routing table begins to the lighter node set of load in the middle of (being in the subtree scope) that finishes (not comprising this node) of the node of bar routing table correspondence down, promptly stores in each node device according to the subtree zone of each clauses and subclauses of balanced binary tree the system routing information node set of the load process allowance in each subtree zone of corresponding stored and the system load information of load capacity thereof respectively, and be example with No. 7 nodes, the 1st, article 2,3,4, (first column information is respectively 0 to the system load table, 1,2,3) Dui Ying implication be respectively [8,9), [9,11), [11,15), { 15,0,1,2,3,4,5, the system load information of the node set of load process allowance and load capacity thereof in the scope of 6}.
The renewal of system load table still goes to upgrade by the mechanism of inquiring in the present embodiment, and each node receives that the later processing mode of inquiry is with the same in the Chord ring.
Its concrete system load information update method is as follows:
At first, inquire about load process allowance node set and load capacity thereof in each subtree zone respectively according to the subtree zone of each clauses and subclauses; Promptly inquire load process allowance node and load capacity thereof in this subtree zones of node of subtree zone indication of each clauses and subclauses; The node device of the subtree of each clauses and subclauses zone indication system load information of inquiring about this node device is returned load process allowance node and the load capacity information thereof in the described subtree zone then.
At last, upgrade the load process allowance node set and the load capacity thereof in the subtree zone of each clauses and subclauses according to Query Result.
Realize above-mentioned renewal, as a kind of concrete realization, upgrading processing unit described in the present invention can comprise:
Load query processing unit: inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the subtree zone of each clauses and subclauses;
Updating block: according to the node set and the load capacity thereof of the load process allowance in the subtree zone of each clauses and subclauses of the Query Result update system load information of described load query processing unit.
Can carry out load transfer according to the system load information of storage among the present invention, promptly be checked through the load of this node device when overweight when a node device, its system load table of at first inquiring about oneself is determined targeted loads transfering node equipment, and described definite targeted loads transfering node equipment is one or more node devices of selecting at random in the lightest one or more node devices of load or the set of load process allowance node device in the load process allowance node device set.
Behind definite targeted loads transfering node equipment, load transfer that can this node device is overweight is to the targeted loads transfering node equipment of determining.When shifting complexity, system pays the utmost attention to cryptographic Hash and equates or similar load, and cryptographic Hash is shifted together in all loads of a codomain (perhaps equating), simultaneously transfer case is recorded in the system load transfer table of this node.Needn't check all projects successively when so both can make inquiry, the record count in the system load transfer table is kept in the relative small range.When specifically carrying out load transfer, high capacity node device to be transferred inquires at first whether targeted loads transfering node equipment can accept load to be transferred; If can accept, then give targeted loads transfering node equipment with load transfer; If can not accept, then the system load information known to the explanation is out-of-date; Need to proceed load transfer behind the update system load information.If all do not have for a long time to find to admit the node device of these loads, illustrate that then the load of whole system all takes, palpus replenishment system resource, for example: expanding node.
Based on above-mentioned metastasis and transfer recorded information, when resource that is stored in the system of inquiry, need only at first calculate the cryptographic Hash of this object according to original hash method, find corresponding destination node equipment then.Do not taking place under the situation of load transfer, this object just leaves on this destination node equipment.Under the situation that load transfer takes place, the position that this object is deposited can obtain by searching the load transfer recorded information.When within the specific limits object of inquiry cryptographic Hash and search single object class seemingly, only need to find all objects in this cryptographic Hash scope.
Need explanation, a kind of extreme case may occur, both occur all overburdens of a lot of node devices in the system simultaneously, this moment, they all can attempt the lightest node device transferring load of load in system.For this reason, can be in the following way, at first, when the update system loading liquifier, in case when running into a plurality of node devices and be simultaneously node device the most idle in the system with identical load ability, node of recorded at random then, thus can reach certain shunting effect.Secondly, be in the system load information table, several idle node devices of the many records of each clauses and subclauses (being each system node identified areas) and their loading condition.That is to say and not only write down a lightest node device of load; But the lighter a plurality of node set of record load.The destination node equipment that can have more multi-load to shift like this is available.At last, in the destination node equipment of selecting load transfer, can take the strategy of the comparison golden mean of the Confucian school, be not to shift toward the lightest node device of system load; But all can bear that the one or more node devices of random choose carry out load transfer in the node device of preparing transferring load in all node devices in being recorded in the system load table of this node, the same like this situation that occurs running on a bank can avoided preferably.
The above only is a preferred implementation of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (20)
1, the node device of a kind of structured p2p network system is characterized in that, includes:
Memory cell: store peer-to-peer network system routing information, peer-to-peer network system load information and load transfer recorded information;
Load transfer processing unit: shift the overweight load of this node device according to described peer-to-peer network system load information selected target load transfer node device and to described selected targeted loads transfering node equipment;
Resource lookup unit: carry out resource lookup according to described peer-to-peer network system routing information and described load transfer recorded information.
2, the node device of structured p2p network according to claim 1 system is characterized in that, also comprises the renewal processing unit: the peer-to-peer network system load information of the described cell stores of regular update.
3, the node device of structured p2p network according to claim 2 system, it is characterized in that, the described peer-to-peer network employing Chord of system ring, described peer-to-peer network system load information is node set and the load capacity thereof according to the load process allowance in each node identification zone of the node identification zone difference corresponding stored of each clauses and subclauses of Chord loop systems routing iinformation;
Described renewal processing unit comprises:
Load query processing unit: inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the node identification zone of each clauses and subclauses;
Updating block: according to the node set and the load capacity thereof of the load process allowance in the node identification zone of each clauses and subclauses of the Query Result update system load information of described load query processing unit.
4, the node device of structured p2p network according to claim 2 system, it is characterized in that, described peer-to-peer network system adopts balanced binary tree, and described peer-to-peer network system load information be to distinguish the node set and the load capacity thereof of load process allowance in each subtree zone of corresponding stored according to the subtree zone of each clauses and subclauses of balanced binary tree system routing information;
Described renewal processing unit comprises:
Load query processing unit: inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the subtree zone of each clauses and subclauses;
Updating block: according to the node set and the load capacity thereof of the load process allowance in the subtree zone of each clauses and subclauses of the Query Result update system load information of described load query processing unit.
5, according to the node device of each described structured p2p network system of claim 1-4, it is characterized in that described load transfer processing unit specifically comprises:
Determining unit: determine targeted loads transfering node equipment according to described structured p2p network system load information;
Query unit: inquire about described definite targeted loads transfering node equipment and whether can accept load transfer;
Buanch unit: if Query Result is for being, then to described definite targeted loads transfering node equipment transferring load.
6, the node device of structured p2p network according to claim 5 system, it is characterized in that the targeted loads transfering node equipment that described determining unit is determined is a lightest node device of the load selected in the load process allowance node set or one or more node devices of selecting at random.
7, a kind of structured p2p network system comprises a plurality of node devices, it is characterized in that described node device includes:
Memory cell: store peer-to-peer network system routing information, peer-to-peer network system load information and load transfer recorded information;
Load transfer processing unit: shift the overweight load of this node device according to described peer-to-peer network system load information selected target load transfer node device and to described selected targeted loads transfering node equipment;
Resource lookup unit: carry out resource lookup according to described peer-to-peer network system routing information and described load transfer recorded information.
8, structured p2p network according to claim 7 system is characterized in that, also comprises the renewal processing unit: the peer-to-peer network system load information of the described cell stores of regular update.
9, structured p2p network according to claim 8 system, it is characterized in that, the described peer-to-peer network employing Chord of system ring, described peer-to-peer network system load information is node set and the load capacity thereof according to the load process allowance in each node identification zone of the node identification zone difference corresponding stored of each clauses and subclauses of Chord loop systems routing iinformation;
Described renewal processing unit comprises:
Load query processing unit: inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the node identification zone of each clauses and subclauses;
Updating block: according to the node set and the load capacity thereof of the load process allowance in the node identification zone of each clauses and subclauses of the Query Result update system load information of described load query processing unit.
10, structured p2p network according to claim 8 system, it is characterized in that, described peer-to-peer network system adopts balanced binary tree, and described peer-to-peer network system load information be to distinguish the node set and the load capacity thereof of load process allowance in each subtree zone of corresponding stored according to the subtree zone of each clauses and subclauses of balanced binary tree system routing information;
Described renewal processing unit comprises:
Load query processing unit: inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the subtree zone of each clauses and subclauses;
Updating block: according to the node set and the load capacity thereof of the load process allowance in the subtree zone of each clauses and subclauses of the Query Result update system load information of described load query processing unit.
11, according to each described structured p2p network system of claim 7-10, it is characterized in that described load transfer processing unit comprises:
Determining unit: determine targeted loads transfering node equipment according to described structured p2p network system load information;
Query unit: inquire about described definite targeted loads transfering node equipment and whether can accept load transfer;
Buanch unit: if Query Result is for being, then to described definite targeted loads transfering node equipment transferring load.
12, the node device of structured p2p network according to claim 11 system, it is characterized in that the targeted loads transfering node equipment that described determining unit is determined is the lightest one or more node devices of the load selected in the load process allowance node set or one or more node devices of selecting at random.
13, node device load method for updating in a kind of structured p2p network system, described structured p2p network system comprises a plurality of node devices, store in each node device according to the node identification zone of each clauses and subclauses of Chord loop systems the routing iinformation node set of the load process allowance in each node identification zone of corresponding stored and the system load information of load capacity thereof respectively, it is characterized in that, comprising:
Inquire about load process allowance node set and load capacity thereof in each node identification zone respectively according to the node identification zone of each clauses and subclauses;
Upgrade the load process allowance node set and the load capacity thereof in the node identification zone of each clauses and subclauses according to Query Result.
14, node device load update method in the structured p2p network according to claim 13 system, it is characterized in that load process allowance node set is inquired about in each node identification zone in described node identification zone according to each clauses and subclauses respectively and load capacity comprises:
Inquire load process allowance node and load capacity thereof in this node identification zones of node of node identification zone indication of each clauses and subclauses;
The system load information that the node device of the node identification of each clauses and subclauses zone indication is inquired about this node device is returned load process allowance node and the load capacity information thereof in the described node identification zone.
15, node device load method for updating in a kind of structured p2p network system, described structured p2p network system comprises a plurality of node devices, store in each node device according to the subtree zone of each clauses and subclauses of balanced binary tree the system routing information node set of the load process allowance in each subtree zone of corresponding stored and the system load information of load capacity thereof respectively, it is characterized in that, comprising:
Inquire about load process allowance node set and load capacity thereof in each subtree zone respectively according to the subtree zone of each clauses and subclauses;
Upgrade the load process allowance node set and the load capacity thereof in the subtree zone of each clauses and subclauses according to Query Result.
16, node device load update method in the structured p2p network according to claim 15 system is characterized in that, load process allowance node set is inquired about in each subtree zone in described subtree zone according to each clauses and subclauses respectively and load capacity comprises:
Inquire load process allowance node and load capacity thereof in this subtree zones of node of subtree zone indication of each clauses and subclauses;
The system load information that the node device of the subtree of each clauses and subclauses zone indication is inquired about this node device is returned load process allowance node and the load capacity information thereof in the described subtree zone.
17, the load transfer method of node device in a kind of structured p2p network system, described structured p2p network system comprises a plurality of node devices, each node device stores described structured p2p network system load information, it is characterized in that, comprising:
It is overweight to be checked through the load of this node device, and query structure peer-to-peer network system load information is determined targeted loads transfering node equipment;
The load transfer that this node device is overweight is to the targeted loads transfering node equipment of determining.
18, the load transfer method of node device in the structured p2p network according to claim 17 system is characterized in that, the load transfer of this node device was also comprised before the targeted loads transfering node equipment of determining:
Whether query aim load transfer node device can accept transferring load, if, then carry out the load transfer of this node device to the targeted loads transfering node equipment of determining, otherwise, initiate again to shift after then waiting structured p2p network system load information to be updated.
19, according to the load transfer method of node device in claim 17 or the 18 described structured p2p network systems, it is characterized in that described definite targeted loads transfering node equipment is one or more node devices of selecting at random in the lightest one or more node devices of load or the set of load process allowance node device in the load process allowance node device set.
20, resource lookup method in a kind of structured p2p network system, described structured p2p network system comprises a plurality of node devices, each node device stores described structured p2p network system load information and load transfer recorded information, it is characterized in that, comprising:
Determine the destination node equipment at resource place according to system routing information;
Whether the resource of judging described destination node equipment shifts, if judged result then shifts recorded information according to resource load and determines the node device that resource transfers is deposited for being, otherwise, determine that described destination node equipment is that resource is deposited node device.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101220644A CN100496004C (en) | 2006-09-05 | 2006-09-05 | Structured peer-to-peer network system and its load query, transfer and resource seeking method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101220644A CN100496004C (en) | 2006-09-05 | 2006-09-05 | Structured peer-to-peer network system and its load query, transfer and resource seeking method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1937557A true CN1937557A (en) | 2007-03-28 |
| CN100496004C CN100496004C (en) | 2009-06-03 |
Family
ID=37954837
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006101220644A Expired - Fee Related CN100496004C (en) | 2006-09-05 | 2006-09-05 | Structured peer-to-peer network system and its load query, transfer and resource seeking method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100496004C (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008134959A1 (en) * | 2007-05-08 | 2008-11-13 | Huawei Technologies Co., Ltd. | Method and system for realizing load balancing in packet network |
| CN101834897A (en) * | 2010-04-23 | 2010-09-15 | 哈尔滨工程大学 | DHT (Distributed Hash Table) network load balancing device and dummy node dividing method |
| CN101355473B (en) * | 2007-07-27 | 2010-09-22 | 华为技术有限公司 | Method for publishing and searching mobile self-networking resource as well as mobile self-networking network node equipment |
| CN101414962B (en) * | 2007-10-19 | 2011-01-05 | 华为技术有限公司 | Method and node for implementing load balance |
| CN101977162A (en) * | 2010-12-03 | 2011-02-16 | 电子科技大学 | Load balancing method of high-speed network |
| CN101399738B (en) * | 2007-09-28 | 2011-04-20 | 华为技术有限公司 | Method for providing download recommendation service, structured peer-to-peer network and node therein |
| CN101286920B (en) * | 2008-05-15 | 2011-04-20 | 华中科技大学 | Expandable resource lookup method in peer-to-peer network with structure |
| CN101098308B (en) * | 2007-06-26 | 2012-04-25 | 华为技术有限公司 | Node load sharing method and system in network |
| CN102970349A (en) * | 2012-11-02 | 2013-03-13 | 上海交通大学 | Distributed hash table (DHT) network storage load balancing method |
| CN103108019A (en) * | 2011-10-17 | 2013-05-15 | 株式会社日立制作所 | Service providing system |
| CN103188164A (en) * | 2011-12-31 | 2013-07-03 | 中国移动通信集团云南有限公司 | Method, device and system for shunting peer node load based on upgraded client node |
| CN103841185A (en) * | 2014-02-24 | 2014-06-04 | 北京二六三企业通信有限公司 | Load balancing method and device |
| US8914501B2 (en) | 2009-12-31 | 2014-12-16 | Huawei Technologies Co., Ltd. | Method, apparatus, and system for scheduling distributed buffer resources |
| CN104219163A (en) * | 2014-08-28 | 2014-12-17 | 杭州天宽科技有限公司 | Load balancing method for node dynamic forward based on dynamic replication method and virtual node method |
| US9232476B1 (en) | 2014-06-11 | 2016-01-05 | Empire Technology Development Llc | Task management across low-power wireless communications |
| CN104202349B (en) * | 2009-12-31 | 2016-04-13 | 华为技术有限公司 | The method of scheduling distributed buffer resources, Apparatus and system |
| WO2017000142A1 (en) * | 2015-06-29 | 2017-01-05 | 华为技术有限公司 | P-cscf load management method and pgw |
| CN109347758A (en) * | 2018-08-30 | 2019-02-15 | 赛尔网络有限公司 | A kind of method of message compression, equipment, system and medium |
| CN111245842A (en) * | 2020-01-14 | 2020-06-05 | 深圳市恒悦创客空间有限公司 | Park information processing method |
| CN112532754A (en) * | 2021-02-08 | 2021-03-19 | 浙江学海教育科技有限公司 | Method and system for rapidly serving school network files |
-
2006
- 2006-09-05 CN CNB2006101220644A patent/CN100496004C/en not_active Expired - Fee Related
Cited By (32)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008134959A1 (en) * | 2007-05-08 | 2008-11-13 | Huawei Technologies Co., Ltd. | Method and system for realizing load balancing in packet network |
| CN101098308B (en) * | 2007-06-26 | 2012-04-25 | 华为技术有限公司 | Node load sharing method and system in network |
| CN101355473B (en) * | 2007-07-27 | 2010-09-22 | 华为技术有限公司 | Method for publishing and searching mobile self-networking resource as well as mobile self-networking network node equipment |
| CN101399738B (en) * | 2007-09-28 | 2011-04-20 | 华为技术有限公司 | Method for providing download recommendation service, structured peer-to-peer network and node therein |
| CN101414962B (en) * | 2007-10-19 | 2011-01-05 | 华为技术有限公司 | Method and node for implementing load balance |
| CN101286920B (en) * | 2008-05-15 | 2011-04-20 | 华中科技大学 | Expandable resource lookup method in peer-to-peer network with structure |
| CN104202349B (en) * | 2009-12-31 | 2016-04-13 | 华为技术有限公司 | The method of scheduling distributed buffer resources, Apparatus and system |
| US8914501B2 (en) | 2009-12-31 | 2014-12-16 | Huawei Technologies Co., Ltd. | Method, apparatus, and system for scheduling distributed buffer resources |
| CN101834897A (en) * | 2010-04-23 | 2010-09-15 | 哈尔滨工程大学 | DHT (Distributed Hash Table) network load balancing device and dummy node dividing method |
| CN101834897B (en) * | 2010-04-23 | 2012-10-31 | 哈尔滨工程大学 | DHT (Distributed Hash Table) network load balancing device and dummy node dividing method |
| CN101977162A (en) * | 2010-12-03 | 2011-02-16 | 电子科技大学 | Load balancing method of high-speed network |
| CN101977162B (en) * | 2010-12-03 | 2012-01-18 | 电子科技大学 | Load balancing method of high-speed network |
| CN103108019A (en) * | 2011-10-17 | 2013-05-15 | 株式会社日立制作所 | Service providing system |
| CN103188164A (en) * | 2011-12-31 | 2013-07-03 | 中国移动通信集团云南有限公司 | Method, device and system for shunting peer node load based on upgraded client node |
| CN103188164B (en) * | 2011-12-31 | 2016-01-27 | 中国移动通信集团云南有限公司 | Based on method, the Apparatus and system of upgrade client node shunting peer node load |
| CN102970349B (en) * | 2012-11-02 | 2015-11-25 | 上海交通大学 | A kind of memory load equalization methods of DHT network |
| CN102970349A (en) * | 2012-11-02 | 2013-03-13 | 上海交通大学 | Distributed hash table (DHT) network storage load balancing method |
| CN103841185B (en) * | 2014-02-24 | 2017-05-17 | 北京二六三企业通信有限公司 | Load balancing method and device |
| CN103841185A (en) * | 2014-02-24 | 2014-06-04 | 北京二六三企业通信有限公司 | Load balancing method and device |
| US9232476B1 (en) | 2014-06-11 | 2016-01-05 | Empire Technology Development Llc | Task management across low-power wireless communications |
| US10285133B2 (en) | 2014-06-11 | 2019-05-07 | Empire Technology Development Llc | Task management across low-power wireless communications |
| US9485736B2 (en) | 2014-06-11 | 2016-11-01 | Empire Technology Development Llc | Task management across low-power wireless communications |
| US9900841B2 (en) | 2014-06-11 | 2018-02-20 | Empire Technology Development Llc | Task management across low-power wireless communications |
| CN104219163B (en) * | 2014-08-28 | 2016-08-17 | 杭州天宽科技有限公司 | The load-balancing method that a kind of node based on dynamic copies method and dummy node method dynamically moves forward |
| CN104219163A (en) * | 2014-08-28 | 2014-12-17 | 杭州天宽科技有限公司 | Load balancing method for node dynamic forward based on dynamic replication method and virtual node method |
| CN106464693A (en) * | 2015-06-29 | 2017-02-22 | 华为技术有限公司 | P-CSCF load management method and PGW |
| WO2017000142A1 (en) * | 2015-06-29 | 2017-01-05 | 华为技术有限公司 | P-cscf load management method and pgw |
| CN106464693B (en) * | 2015-06-29 | 2019-09-20 | 华为技术有限公司 | A kind of P-CSCF load management method and PGW |
| CN109347758A (en) * | 2018-08-30 | 2019-02-15 | 赛尔网络有限公司 | A kind of method of message compression, equipment, system and medium |
| CN111245842A (en) * | 2020-01-14 | 2020-06-05 | 深圳市恒悦创客空间有限公司 | Park information processing method |
| CN112532754A (en) * | 2021-02-08 | 2021-03-19 | 浙江学海教育科技有限公司 | Method and system for rapidly serving school network files |
| CN112532754B (en) * | 2021-02-08 | 2021-07-16 | 浙江学海教育科技有限公司 | Method and system for rapidly serving school network files |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100496004C (en) | 2009-06-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100496004C (en) | Structured peer-to-peer network system and its load query, transfer and resource seeking method | |
| CN100591028C (en) | Centralized service based distributed peer-to-peer network implementing method and system | |
| Godfrey et al. | Load balancing in dynamic structured P2P systems | |
| Cai et al. | Maan: A multi-attribute addressable network for grid information services | |
| CN102487397B (en) | Data based on node underlying security grade storage and method for routing and node | |
| Karger et al. | Simple efficient load-balancing algorithms for peer-to-peer systems | |
| CN110417883B (en) | Design method of point-to-point network structure applied to block chain | |
| Korzun et al. | Hierarchical architectures in structured peer-to-peer overlay networks | |
| Hauswirth et al. | An overlay network for resource discovery in grids | |
| CN101753405A (en) | Cluster server memory management method and system | |
| CN102013991A (en) | Method, management equipment and system for automatically expanding capacity | |
| CN101399765B (en) | Method and system for reducing hot node load in P2P network | |
| Li et al. | Ssw: A small-world-based overlay for peer-to-peer search | |
| CN101645831B (en) | Node organization method in P2P system | |
| Xu et al. | Adaptive and scalable load balancing for metadata server cluster in cloud-scale file systems | |
| US20070165619A1 (en) | Device and method for retrieving/storing electronic data in a system with a plurality of data processing units | |
| CN101414962B (en) | Method and node for implementing load balance | |
| EP1926276B1 (en) | Load balancing in a peer-to-peer system | |
| CN107547657A (en) | A kind of method, apparatus and storage medium numbered based on one point data in cloud storage system | |
| CN101360055B (en) | P2P network information resource location method having constant hop routing characteristic | |
| CN101917475A (en) | P2P (Peer-to-Peer) mode based PSRD (Program Support Requirements Document) universal service resource discovery method | |
| Nakazato et al. | Data allocation method considering server performance and data access frequency with consistent hashing | |
| CN106874218B (en) | A kind of distribution method and its device of mapped address space | |
| CN101420352A (en) | Method and system for key value transition in structured P2P network | |
| Soltani et al. | A LOAD BALANCING ALGORITHM BASED ON REPLICATION AND MOVEMENT OF DATA ITEMS FOR DYNAMIC STRUCTURED P2P SYSTEMS |
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: 20090603 Termination date: 20200905 |