CN101202746B - Method for generating node identifier and method and device of load balancing - Google Patents
Method for generating node identifier and method and device of load balancing Download PDFInfo
- Publication number
- CN101202746B CN101202746B CN2006101680328A CN200610168032A CN101202746B CN 101202746 B CN101202746 B CN 101202746B CN 2006101680328 A CN2006101680328 A CN 2006101680328A CN 200610168032 A CN200610168032 A CN 200610168032A CN 101202746 B CN101202746 B CN 101202746B
- Authority
- CN
- China
- Prior art keywords
- node
- identifier
- identifier parameter
- parameter
- internet protocol
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Abstract
The invention discloses a node identifier generating method as well as a load balancing method and a device, which are used for improving the effect of load balancing. The node identifier generating method of the invention includes of getting a local network protocol address of the node; getting a first identifier parameter and a second identifier parameter according to a local network protocol address; combining the first identifier parameter and the second identifier parameter to form the node identifier. The load balancing method includes of getting the first identifier parameter and the second identifier according to the local network protocol address of the node and combining the first identifier parameter and the second identifier parameter to form the node identifier; selecting a node corresponding to a node identifier near the node identifier of an overloaded node; transferring the load of the overloaded node to the node. The invention also provides a load balancing device. The invention can effectively improve the effects of load balancing.
Description
Technical field
The present invention relates to the communications field, relate in particular to node identifier generation method and load-balancing method and device.
Background technology
Point-to-point (P2P, Peer to Peer) technology is a focus of present International Computer Network technical field research, and more and more is subjected to people's approval, and it provides a kind of method of new shared resource.In the P2P network environment, computer connected to one another all is in the status of equity, every main frame be resource requestor be again resource provider, can make response to the request of other computer, resource and service are provided voluntarily, and therefore every computer all is called as the Peer peer node.
Relation according to topological structure can be divided into the P2P network topology structure 4 kinds of forms: centralization topology, full distributed destructuring topology, all distributed structure topological sum half distribution topology.Wherein, all distributed structure topology is also referred to as distributed hash table (DHT, Distributed Hash Table) network.
System compares with non-structural P 2 P, based on the structured P 2 P system structure of DHT can the self adaptation node dynamic adding/withdraw from, good extensibility, robustness and self organization ability are arranged.
Structured P 2 P system adopts the certainty topological structure, adopts DHT can find resource accurately, efficiently.The DHT basic thought is: at first for each node in the network distributes virtual address VID, also be node ID, represent the shared content that it provides with a keyword KEY simultaneously.Get a hash function H, this function can convert KEY to a hashed value H (KEY).The definition that node is adjacent in the network is that hashed value is adjacent.When node releases news just (KEY, VID) two tuples are published to and have node identical with H (KEY) or close virtual address and get on, wherein VID has pointed out the memory location of document.Resource location time, just can be fast according to H (KEY) to index deposit obtain on the node two tuples (KEY, VID), thereby the actual stored position of acquisition document.
Because stacking network has adopted the certainty topological structure, DHT can accurately find resource.But because node identifier (ID, identity) between distance be irregular, so the load of some node may be system's average load O (logN) doubly.The hypothesis node capacity is identical among the DHT, but in fact the node capacity in the P2P network is widely different, and node capacity comprises CPU disposal ability, memory space, bandwidth etc.Caused the unbalanced problem of load like this, i.e. the ability of load of node and node does not conform to.In addition, have content very popular or that the frequency of occurrences is higher in the network, in these perhaps its index can deliver on the node of correspondence, cause some node overload; Because some supports the design of similar inquiry, cause the offered load inequality in addition.Therefore need carry out load balancing to system.
To guarantee that in the DHT network " Chord_AScalable Peer-to-peer Lookup Protocol for Internet Applications " document discloses a kind of node ID generation method into each node distributes a unique identifier:
The essence of structured P 2 P network is framework one deck Overlay network on physical network, in network topology, is the logic neighbouring relations between node; And the mode by self-organizing, set up routing table according to corresponding neighbouring relations.ID is obtained, is shown below by node Internet protocol (IP, Internet Protocol) address Hash usually:
ID＝hash(IP)
These ID generating modes produce a random number exactly, and its benefit is that randomness is more intense, and can not conflict.What use among the Chord is that the SHA-1 hash function carries out Hash, and what use among the pastry is the MD5 hash function.
But these ID generation method final purpose all just generate a unduplicated random number, and only Hash are carried out in the IP address and handle, and may cause the ID of the contiguous node of IP not contiguous, so can not well be applicable to load balancing.
Number of patent application is 200510126321.7, and name is called and discloses a kind of load-balancing method in the patent documentation of " distributed load equalizing method of structured P 2 P system ":
Node is collected partial load information information cycle according to adjacent node, the overload node by heuristic to non-overload node transferring load.This method has been utilized the proximity relations of node on physical network, makes load shift between the less node of link delay as far as possible, saves the network bandwidth.
But said method is to utilize the proximity relations of node on physical network on existing DHT basis, wherein mention by " immediate neighbor " and collect partial load information, but in structurized P2P network, neighbours define at the overlay layer, there is not " immediate neighbor " this notion in major part, because node route list is only stored neighbours or other nodal information of overlay layer, then there is not record as for node contiguous on the geographical position, so the unactual using value of this method.
Summary of the invention
The technical problem to be solved in the present invention provides node identifier generation method and load-balancing method and device, can improve the load balancing effect.
The node identifier generation method that the embodiment of the invention provides comprises: the local internet protocol address that obtains node; Obtain the first identifier parameter and the second identifier parameter according to described local internet protocol address; Node identifier with described first identifier parameter and the synthetic described node of the second identifier parameter group.
The node identifier generation method that the embodiment of the invention provides comprises: the public network Internet protocol address of obtaining node; Described public network Internet protocol address is carried out the Hash processing obtain the first identifier parameter; A unduplicated random number is set as the second identifier parameter; Node identifier with described first identifier parameter and the synthetic described node of the second identifier parameter group.
The load-balancing method that the embodiment of the invention provides comprises: according to the local internet protocol address of node obtain the first identifier parameter and the second identifier parameter and will the described first identifier parameter and the second identifier parameter group synthesize the node identifier of described node; Select the contiguous corresponding node of node identifier of node identifier with the overload node; With the load transfer of described overload node node to described selection.
The load balancing device that the embodiment of the invention provides comprises: identifier generation unit and load transfer unit; Described identifier generation unit is used for obtaining the first identifier parameter and the second identifier parameter and being connected the described first identifier parameter and the second identifier parameter forms described node identifier according to the Internet protocol address of node; Described load transfer unit is used to write down the node identifier of overload node, selects the node identifier corresponding node contiguous with the node identifier of described overload node, and with the load transfer of the described overload node node of described selection extremely.
Above technical scheme as can be seen, the present invention has the following advantages:
Node ID of the present invention is made of two parts, what a preceding part identified is the affiliated public network of node or the number of subnet, a back part is the unique identifier of node, so being in the ID of the node of same public network or subnet is identical in a preceding part, so when carrying out load balancing, can be relatively easy to find node contiguous on the physical network, help load transfer.
Description of drawings
Fig. 1 is the node identifier generation method first embodiment flow chart of the present invention;
Fig. 2 is the node identifier generation method second embodiment flow chart of the present invention;
Fig. 3 is the load-balancing method first embodiment flow chart of the present invention;
Fig. 4 is a load balancing device embodiment schematic diagram of the present invention.
Embodiment
The invention provides node identifier generation method and load-balancing method and device, be used to improve the load balancing effect.
Node identifier is made of two parts among the present invention, a preceding part is the contiguous physically total identifier of node, a back part is the unique identifier of node, so just can inquire node contiguous on the physical network and carry out load transfer when load balancing.
See also Fig. 1, node identifier generation method first embodiment of the present invention comprises:
101, obtain the local ip address of node;
102, obtain the first identifier parameter and the second identifier parameter according to described local ip address;
103, with the node identifier of the synthetic described node of the described first identifier parameter and the second identifier parameter group.
Wherein, if the first identifier parameter is that 10, the second identifier parameters are 20, then the node identifier of combination back formation can be 1020, be understandable that, can adopt other compound mode equally, the node identifier that only need embody final formation is divided into two parts and gets final product.
Wherein, step 102 is obtained the corresponding first identifier parameter and the second identifier parameter according to the different situations of local ip address, describes in detail among concrete acquisition process second embodiment below.
Wherein, step 102 can also replace with:
The public network IP address of node is carried out Hash to be handled and obtains the first identifier parameter; A unduplicated random number is set as the second identifier parameter.
Above-mentioned replacement is to be the situation of privately owned address at the IP address, and concrete flow process describes in detail equally in a second embodiment.
In addition, step 102 is specially: according to the corresponding meshed network information of the type of described local ip address inquiry, and described meshed network information handled obtain the first identifier parameter and the second identifier parameter.
Wherein, the type of meshed network information and local ip address is relevant, is specially:
When local ip address was privately owned address, meshed network information comprised the public network IP address and the private IP address of this node;
When local ip address was C class address, meshed network information comprised the network number and the host number of this node;
When local ip address was category-A or category-B address, meshed network information comprised the subnet number and the host number of this node.
See also Fig. 2, node identifier generation method second embodiment of the present invention comprises:
201, obtain local ip address;
202, judge whether described IP address has privately owned address, if then execution in step 203, if not, then execution in step 207;
Wherein, if local IP at 10.0.0.0～10.255.255.255,172.16.0.0～172.31.255.255 among 192.168.0.0～192.168.255.255, then can be judged as privately owned address.
203, inquiry public network IP;
Wherein, the gateway under described IP address is inquired about its public network IP address.
204, select random number;
205, public network IP address is carried out Hash and connects random number;
Wherein, public network IP address is carried out Hash handle,, random number as the second identifier parameter, is connected Hash result and random number as the first identifier parameter.
206, judge whether random number repeats, if repeat, then execution in step 204, if do not repeat, then execution in step 211;
Wherein, have with other node and conflict if add in the structured network its ID at node, then this random number repetition is selected a random number, more again till node ID is unique.
207, judge whether described IP address is C class address, if then execution in step 209, if not, then execution in step 208;
208, subnet number is carried out Hash;
Wherein, 1677214 main frames are arranged at most in the network of category-A address, the category-B address has 65534 main frames at most, and the network size of category-A address and category-B address correspondence is bigger, so category-A address and category-B address are divided into many subnets usually again.Main frame in the common local area network (LAN) is in a subnet, that is: its network prefix is identical.Subnet number is that the AND operation acquisition is carried out in IP address and mask.So its subnet number is carried out Hash as the first identifier parameter.
209, network number is carried out Hash;
Wherein, because the class c network scope is less, have only 254 computers at most, in general be separated by can be too not far away for physical location, so can directly carry out Hash as the first identifier parameter to its network number.
210, host number is carried out Hash;
Wherein, host number is carried out Hash as the second identifier parameter,
211, generate node identifier.
Wherein, connect the first identifier parameter and the second identifier parameter and form node identifier.
In the above-described embodiments, step 204 selects random number to be obtained by the Hash of private ip, so just need not judge whether repetition, because the privately owned address in the subnet is unduplicated.
In addition, the space of the node identifier that generates can change to some extent, and for example the ID space is 160 bits in chord, and the ID space that obtains by this new ID generation method is 320 bits so, ID among the same pastry is 128 bits, with the ID of this class methods generation 256 bits of ascending the throne.Can certainly do a little restrictions to the ID space,, make it be no more than 80 bits or the like such as the latter part of length of ID is intercepted.
The main purpose of above-mentioned node identifier generation method is to improve effect of load balance, below the load-balancing method that the present invention is based on above-mentioned node identifier generation method is described in detail, see also Fig. 3, load-balancing method embodiment of the present invention comprises:
301, generate node identifier;
Wherein, obtain the first identifier parameter and the second identifier parameter according to the node Internet protocol address and be connected the described first identifier parameter and the second identifier parameter forms described node identifier.
302, select neighbor node;
Wherein, when certain node becomes the overload node, trigger load transfer, at first need to select neighbor node according to node identifier, characteristic by structural P 2 P, can be by existing list item in the routing table, select the contiguous node of logic, such as the direct precursor that logical layer is just arranged in circuluses such as chord and follow-up, but in pastry and tapstry, there is not direct precursor and follow-up, so select leaf node in the routing table as neighbor node because leaf node be with the contiguous a certain scope of overload node ID in node.
Wherein, need determine the scope of selection according to ID space size and network density parameter, in general, under different practical situations, ID space size is all inequality with the network density parameter.Suppose to have 5 nodes, ID is respectively 1010,1030,1040,1050 and 1090, the preceding part of ID all is 10, illustrate that they belong to same subnet, a back part is a unique identifier, if ID is 1030 node overload, can be 1010 at ID then, select one or more neighbor nodes to carry out load transfer in 1040 and 1050 the node, if ID is the overload of 1050 node, then can in being 1030,1040 and 1090 node, ID select one or more neighbor nodes to carry out load transfer.
303, whether judge neighbor node and overload node at the same area, if then execution in step 306, if not, then execution in step 304;
Wherein, whether in the neighbor node of selecting, judging earlier has a plurality of nodes to add P2P networks (or whether the close node of ID is at same subnet) in the same subnet, and whether the preceding part by its identifier of comparison identical can learning.
304, send detection packet;
Wherein, if neighbor node and overload node then send the round-trip delay detection packet to each node not at the same area.
305, select the little node of time delay;
Wherein, select the little node of time delay according to the feedback information of each node that receives.
306, transferring load and record.
Wherein, if neighbor node with the overload node at the same area, the load transfer of the node that then will overload is to neighbor node;
If neighbor node and overload node be not at the same area, the load transfer of the node that then will overload is to the little node of the time delay of selecting.
Below load balancing device of the present invention is described in detail, see also Fig. 4, load balancing device embodiment of the present invention comprises:
Described identifier generation unit 401 is used for obtaining the first identifier parameter and the second identifier parameter and being connected the described first identifier parameter and the second identifier parameter forms described node identifier according to the Internet protocol address of node;
Described load transfer unit 402 is used for selecting neighbor node to carry out load transfer according to described node identifier.
Wherein, described load transfer unit 402 comprises:
Described selected cell 4021 is used for selecting preset routing table and the contiguous node of overload node identifier, and the information of described node is sent to judging unit;
Described judging unit 4022 be used for according to the information of the node that receives judge described node whether with the overload node at the same area, and judged result is sent to performance element;
Described buanch unit 4023 is used for carrying out load transfer according to the judged result that receives.
Wherein, described buanch unit 4023 comprises:
When the node of selecting with the overload node during at the same area, will the overload load transfer node of described selection extremely of node of performance element 40232;
When the node of selecting with the overload node during not at the same area, probe unit 40231 sends the round-trip delay detection packet to each node, selects the little node of time delay and notifies performance element 40232 according to the response time of each node; Described performance element 40232 will overload the load transfer of node to the little node of described time delay.
Said method and device are applicable to A, B, all kinds of subnets of C and pass through the NAT network.
More than node identifier generation method that the embodiment of the invention provided and load-balancing method and device are described in detail, used specific case herein principle of the present invention and execution mode are set forth, the explanation of above embodiment just is used for helping to understand method of the present invention and device; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, the part that all can change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (13)
1. a node identifier generation method is characterized in that, comprising:
Obtain the local internet protocol address of node;
Obtain the first identifier parameter and the second identifier parameter according to described local internet protocol address, the described first identifier parameter is the affiliated public network of node or the number of subnet, and the described second identifier parameter is the unique identifier of node;
Node identifier with described first identifier parameter and the synthetic described node of the second identifier parameter group.
2. node identifier generation method according to claim 1 is characterized in that, the described step of obtaining the first identifier parameter and the second identifier parameter according to described local internet protocol address comprises:
According to the corresponding meshed network information of the type of described local internet protocol address inquiry, and described meshed network information handled obtain the first identifier parameter and the second identifier parameter.
3. node identifier generation method according to claim 2, it is characterized in that, the described corresponding meshed network information of type inquiry according to described local internet protocol address, and described meshed network information is handled the step that obtains the first identifier parameter and the second identifier parameter comprise:
If described local internet protocol address is the private internet protocol address, then inquire about the public network Internet protocol address of described node correspondence;
Described public network Internet protocol address is carried out Hash handle and to obtain the first identifier parameter, the private internet protocol address of described node is carried out Hash handle and obtain the second identifier parameter.
4. node identifier generation method according to claim 2, it is characterized in that, the described corresponding meshed network information of type inquiry according to described local internet protocol address, and described meshed network information is handled the step that obtains the first identifier parameter and the second identifier parameter comprise:
If described local internet protocol address is C class address, then inquire about the network number and the host number of described node;
Described network number is carried out the Hash processing obtain the first identifier parameter, described host number is carried out the Hash processing obtain the second identifier parameter.
5. node identifier generation method according to claim 2, it is characterized in that, the described corresponding meshed network information of type inquiry according to described local internet protocol address, and described meshed network information is handled the step that obtains the first identifier parameter and the second identifier parameter comprise:
If described local internet protocol address is category-A or category-B address, then inquire about the subnet number and the host number of described node;
Described subnet number is carried out the Hash processing obtain the first identifier parameter, described host number is carried out the Hash processing obtain the second identifier parameter.
6. a node identifier generation method is characterized in that, comprising:
Obtain the public network Internet protocol address of node;
Described public network Internet protocol address is carried out the Hash processing obtain the first identifier parameter;
A unduplicated random number is set as the second identifier parameter;
Node identifier with described first identifier parameter and the synthetic described node of the second identifier parameter group.
7. a load-balancing method is characterized in that, comprising:
Obtain the local internet protocol address of node;
Obtain the first identifier parameter and the second identifier parameter according to described local internet protocol address, the described first identifier parameter is the affiliated public network of node or the number of subnet, and the described second identifier parameter is the unique identifier of node;
Node identifier with described first identifier parameter and the synthetic described node of the second identifier parameter group;
Select the contiguous corresponding node of node identifier of node identifier with the overload node;
With the load transfer of described overload node node to described selection.
8. load-balancing method according to claim 7 is characterized in that, the step of the node that the node identifier that described node identifier definite and the overload node is close to is corresponding comprises:
According to the node that is close to the overload node identifier in identifier space size and the network density parameter selection preset routing table.
9. according to claim 7 or 8 described load-balancing methods, it is characterized in that described load transfer with described overload node to the step of described node comprises:
Judge described node whether with the overload node at the same area, if, the load transfer of the node that then will overload if do not exist, is selected the node transferring load of correspondence to described node again according to prerequisite.
10. load-balancing method according to claim 9 is characterized in that, described step according to the corresponding node transferring load of prerequisite selection comprises:
Send the round-trip delay detection packet to each node;
Response time according to each node is selected the little node of time delay.
11. a load balancing device is characterized in that, comprising:
Identifier generation unit and load transfer unit;
Described identifier generation unit is used to obtain the local internet protocol address of node, obtain the first identifier parameter and the second identifier parameter according to described local internet protocol address, the described first identifier parameter is the affiliated public network of node or the number of subnet, the described second identifier parameter is the unique identifier of node, with the node identifier of described first identifier parameter and the synthetic described node of the second identifier parameter group;
Described load transfer unit is used to write down the node identifier of overload node, selects the node identifier corresponding node contiguous with the node identifier of described overload node, and with the load transfer of the described overload node node of described selection extremely.
12. load balancing device according to claim 11 is characterized in that, described load transfer unit comprises:
Selected cell, judging unit and buanch unit;
Described selected cell is used for selecting preset routing table and the contiguous node of overload node identifier, and the information of described node is sent to judging unit;
Described judging unit be used for according to the information of the node that receives judge described node whether with the overload node at the same area, and judged result is sent to performance element in the described buanch unit;
Described buanch unit is used for carrying out load transfer according to the judged result that receives.
13. load balancing device according to claim 12 is characterized in that, described buanch unit comprises:
Probe unit and performance element;
When the node of selecting with the overload node during at the same area, will the overload load transfer node of described selection extremely of node of performance element;
When the node of selecting with the overload node during not at the same area, probe unit sends the round-trip delay detection packet to each node, selects the little node of time delay and notifies performance element according to the response time of each node; Described performance element will overload the load transfer of node to the little node of described time delay.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101680328A CN101202746B (en) | 2006-12-15 | 2006-12-15 | Method for generating node identifier and method and device of load balancing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006101680328A CN101202746B (en) | 2006-12-15 | 2006-12-15 | Method for generating node identifier and method and device of load balancing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101202746A CN101202746A (en) | 2008-06-18 |
| CN101202746B true CN101202746B (en) | 2011-04-20 |
Family
ID=39517708
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006101680328A Active CN101202746B (en) | 2006-12-15 | 2006-12-15 | Method for generating node identifier and method and device of load balancing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101202746B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2477377A1 (en) * | 2011-01-14 | 2012-07-18 | Alcatel Lucent | Peer node and method for improved peer node selection |
| CN103188164B (en) * | 2011-12-31 | 2016-01-27 | 中国移动通信集团云南有限公司 | Based on method, the Apparatus and system of upgrade client node shunting peer node load |
| CN103685351B (en) * | 2012-09-04 | 2017-03-29 | 中国移动通信集团公司 | A kind of dispatching method and equipment of buffer service node based on cloud computing platform |
| CN104914745B (en) * | 2012-10-24 | 2017-12-05 | 青岛海信宽带多媒体技术有限公司 | Control the method and system of oscillograph |
| CN103731341B (en) * | 2013-12-30 | 2018-08-03 | 广州华多网络科技有限公司 | A kind of method and system that instant messaging business is handled |
| US9665617B1 (en) * | 2014-04-16 | 2017-05-30 | Google Inc. | Methods and systems for generating a stable identifier for nodes likely including primary content within an information resource |
| CN104917837B (en) * | 2015-06-11 | 2018-05-04 | 百度在线网络技术（北京）有限公司 | A kind of method and system for Message Processing |
| CN105472060B (en) * | 2016-01-25 | 2018-12-11 | 互联天下科技发展（深圳）有限公司 | A kind of node identifier generation method of Kademlia network |
| CN107132990B (en) * | 2016-02-26 | 2021-05-04 | 深信服科技股份有限公司 | Read IO scheduling method and device based on super-fusion storage |
| CN109842665B (en) * | 2017-11-29 | 2022-02-22 | 北京京东尚科信息技术有限公司 | Task processing method and device for task allocation server |
| CN110022222B (en) * | 2018-01-10 | 2022-02-25 | 中兴通讯股份有限公司 | Management method, network node, management node and system of DHT network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1529460A (en) * | 2003-10-14 | 2004-09-15 | 北京邮电大学 | Whole load equalizing method based on global network positioning |
| CN1531298A (en) * | 2003-03-17 | 2004-09-22 | 华为技术有限公司 | Method for processing items of address analyzing protocol table |
| CN1595906A (en) * | 2003-12-17 | 2005-03-16 | 浪潮电子信息产业股份有限公司 | Single address traffic distributor of cluster network |
| US6870849B1 (en) * | 2000-07-06 | 2005-03-22 | Ross W. Callon | Apparatus and method for efficient hashing in networks |
| CN1777120A (en) * | 2005-12-07 | 2006-05-24 | 中国科学院计算技术研究所 | Distributed load equalizing method for structured P2P system |
-
2006
- 2006-12-15 CN CN2006101680328A patent/CN101202746B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6870849B1 (en) * | 2000-07-06 | 2005-03-22 | Ross W. Callon | Apparatus and method for efficient hashing in networks |
| CN1531298A (en) * | 2003-03-17 | 2004-09-22 | 华为技术有限公司 | Method for processing items of address analyzing protocol table |
| CN1529460A (en) * | 2003-10-14 | 2004-09-15 | 北京邮电大学 | Whole load equalizing method based on global network positioning |
| CN1595906A (en) * | 2003-12-17 | 2005-03-16 | 浪潮电子信息产业股份有限公司 | Single address traffic distributor of cluster network |
| CN1777120A (en) * | 2005-12-07 | 2006-05-24 | 中国科学院计算技术研究所 | Distributed load equalizing method for structured P2P system |
Non-Patent Citations (2)
| Title |
|---|
| Ion Stoica,Robert Morris,David Liben-Nowell.Chord:A Scalable Peer-to-Peer Lookup ProtocolforInternetApplications.IEEE/ACM transactions on networking11 1.2003,11(1),全文. |
| Ion Stoica,Robert Morris,David Liben-Nowell.Chord:A Scalable Peer-to-Peer Lookup ProtocolforInternetApplications.IEEE/ACM transactions on networking11 1.2003,11(1),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101202746A (en) | 2008-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101202746B (en) | Method for generating node identifier and method and device of load balancing | |
| EP2230802B1 (en) | A method and apparatus for maintaining route information | |
| JP2009089369A (en) | Optimal operation of hierarchical peer-to-peer networks | |
| Gupta et al. | Efficient and adaptive epidemic-style protocols for reliable and scalable multicast | |
| WO2010127618A1 (en) | System and method for implementing streaming media content service | |
| CN1968164A (en) | Global Internet topology knowledge-based P2P application construction method | |
| JP4533923B2 (en) | Super-peer with load balancing function in hierarchical peer-to-peer system and method of operating the super-peer | |
| Dhara et al. | Overview of structured peer-to-peer overlay algorithms | |
| Zhang et al. | Capacity-aware multicast algorithms on heterogeneous overlay networks | |
| Ribe-Baumann | Combining resource and location awareness in dhts | |
| JP5287500B2 (en) | Node device and program for node device | |
| Zeinalipour-Yazti et al. | Structuring topologically aware overlay networks using domain names | |
| Park et al. | Proximity based peer-to-peer overlay networks (P3ON) with load distribution | |
| Li et al. | CAN Tree Routing for Content-Addressable Network | |
| Ndlovu et al. | A review of service discovery schemes in wireless mesh networks | |
| Guo et al. | Theory and network applications of balanced kautz tree structures | |
| Bo | Optimizing the network topology in gnutella p2p networks | |
| Hwang et al. | The impact of FQDN database updates on name-based routing architecture | |
| Zhang et al. | Measurement-based construction of locality-aware overlay networks | |
| Ktari et al. | Exploiting power-law node degree distribution in chord overlays | |
| Hsu et al. | Message transmission techniques for low traffic P2P services | |
| Zhu et al. | Using service taxonomy to facilitate efficient decentralized grid service discovery | |
| Hwang et al. | Context-Aware Service Discovery in the Internet of Things | |
| Dekar et al. | A resource discovery scheme for large scale ad hoc networks using a hypercube-based backbone | |
| Ding et al. | A chord-based load balancing algorithm for P2P network |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201130 Address after: Building 2, No. 3, Fuqian Road, Hailing District, Taizhou City, Jiangsu Province Patentee after: Taizhou Haitong Asset Management Co.,Ltd. Address before: Unit 2414-2416, main building, no.371, Wushan Road, Tianhe District, Guangzhou City, Guangdong Province Patentee before: GUANGDONG GAOHANG INTELLECTUAL PROPERTY OPERATION Co.,Ltd. Effective date of registration: 20201130 Address after: Unit 2414-2416, main building, no.371, Wushan Road, Tianhe District, Guangzhou City, Guangdong Province Patentee after: GUANGDONG GAOHANG INTELLECTUAL PROPERTY OPERATION Co.,Ltd. Address before: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Patentee before: HUAWEI TECHNOLOGIES Co.,Ltd. |
|
| TR01 | Transfer of patent right |