CN101867527A - Layering Chord routing method based on physical position - Google Patents
Layering Chord routing method based on physical position Download PDFInfo
- Publication number
- CN101867527A CN101867527A CN201010218742A CN201010218742A CN101867527A CN 101867527 A CN101867527 A CN 101867527A CN 201010218742 A CN201010218742 A CN 201010218742A CN 201010218742 A CN201010218742 A CN 201010218742A CN 101867527 A CN101867527 A CN 101867527A
- Authority
- CN
- China
- Prior art keywords
- node
- super
- resource
- chord
- information
- 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
Abstract
The invention provides a layering Chord routing method based on physical position; in the routing method, the information of the physical position of a base station is added in a Chord ring based on DHT principle, and a node with higher performance is set into a super node, the base station and the super node form an inner layer Chord ring; in the inquiry process, the practical physical position range of resources is firstly judged, so as to avoid traversal of all nodes of the whole network, accelerate rapid location of the resource and improve searching speed of the network; super nodes are utilized to control and manage other common nodes, under the condition of disabled base station, the nodes are connected and communicated by the super nodes, so as to improve the stability and safety of the network.
Description
Technical field
The present invention relates to the communication means in a kind of mobile P 2 P (Peer-to-Peer, end-to-end) environment, specifically, is a kind of layering Chord method for routing based on physical location.
Background technology
The generation of P2P technology and development have changed the resource-sharing mode of the Internet.In mobile P 2 P network one very important problem be how to realize the Search and Orientation of resource, Chord (band string shape topology) method for routing is exactly a kind of method that is used to realize the resource lookup location.In traditional Chord method, based on DHT (Distributed Hash Table, distributed hashtable) structured P 2 P system adopts unified compatible hash algorithm, set up NodeID (the Node Identification of node, node identifier) with KeyID (the Key Identification of Resource Key, keyword identifier) one-to-one relationship between, thus realize the storage of resource and search.Traditional Chord topological structure as shown in Figure 1, the route information table of node comprises the keyword message of node, start node information, interval nodal information and descendant node information, i list item of the look-up table of node n comprises the descendant node information I of node n:
I＝successor(n+2
i-1)mod(2
m)，1≤i≤m (1)
Wherein NodeID and KeyID the position long m=6.In Fig. 1, the descendant node of node N8 is N14, and routing node information comprises: 8+2
0, 8+2
1... 8+2
M-1Resource information is stored on KeyID number nearest descendant node, and being expressed as node N14 and N42 in Fig. 1, to have stored correspondent keyword identifier KeyID be the resource information of K10 and K38, and node N32 has stored K24 and K30.
The Chord method for routing is by becoming network virtual the topological structure of single annular, finished the quick search of information, improved search efficiency, but the problem that has following two aspects: the one, (Detouring) problem that detours of Chord network, the 2nd, do not consider joint behavior, comprise the difference on the performances such as computing capability, storage capacity, the network bandwidth, had a strong impact on the speed of stability of network and search information.
There have been some documents to propose the Chord method for routing is improved at present, wherein most representative is document " a kind of improved chord routing algorithm " (Jiang Shouxu, Han Xixian, Li Jianzhong. a kind of improved chord routing algorithm [J]. computer application, 2006,26 (4): 918-921.), its basic thought is the redundant information of removing in the routing table, the length of Chord be the initial routing table of m make up finish after, element in the his-and-hers watches is operated once more, redundant information in the delete list increases effective routing iinformation to improve the performance of system.But the problem that it exists is that average query path length does not have significant change, still is
Document " Dual-chord: a kind of more effectively distributed hashtable " (Zhang Hao, Jin Hai, .Dual-chord such as Nie Jiangwu: a kind of more effectively distributed hashtable [J]. small-sized microcomputer system, 2006,27 (8): 1450-1454.) the two-way route Chord of Ti Chuing is from the clockwise of front nodal point and counterclockwise makes up routing table simultaneously, reduced average inquiry route length, each node route list is original twice simultaneously, has increased the amount of information of Network Transmission.Document " based on the distributed route matrix research of worldlet level " (Zhu Xiaomei, Zhou Ya, Huang Guimin. based on the distributed route matrix research of worldlet level [J]. computer engineering, 2006,32 (15): 120-122.) characteristics of very strong level are arranged according to prefix assignment in the IPv6 network, utilize the segmentation of assigning to of the prefix of Hash node IP address and remainder to make up the identifier of node.Because it is close to have the node physical space of same prefix, realized effectively coincideing of logical space and physical topology, node with same territory is distributed in together better, has improved the efficient of inquiry to a certain extent, but has also destroyed the load balancing of original Chord.
Summary of the invention
At the deficiencies in the prior art, the purpose of this invention is to provide the high layering Chord method for routing of a kind of search efficiency based on physical location.
For this reason, the invention provides a kind of layering Chord method for routing based on physical location, may further comprise the steps: A. constitutes outer Chord ring by at least one base station and the node that belongs to the base station, and the node identifier of node is formed by the physical location sign of base station with through the logical place sign of this node of Hash operation; The ability scoring of B. calculating node in the outer Chord ring is W=aB+bS+cT+dC+eK, wherein, B is the scoring of meshed network bandwidth, S is the node point reliability scoring, and T is the average line duration scoring of node, and C is the scoring of node computing capability, K is the scoring of node storage capacity, a, b, c, d, e are weight coefficient, and the ability node that W is higher than predetermined threshold value of marking is set to super node, is constituted internal layer Chord ring and is set up routing table by super node and base station; C. inquire about the route of start node to resource, inquire the node identifier of corresponding destination node according to the keyword identifier of resource, if the node identifier of start node is identical with the node identifier of destination node, start node is designated as destination node, poll-final; Otherwise,, just super node is designated as destination node, poll-final if the node identifier of the super node under the start node is identical with the node identifier of destination node; Otherwise, the physical location sign is to find out the super node nearest apart from resource in the node identifier of query aim node, inquire about the node that this super node connects,, the routed path from the start node to the destination node is added in the routing table entry up to the destination node that inquires storage resources.
According to an aspect of the present invention, layering Chord method for routing based on physical location comprises that also new node adds step, new node adds step: obtain the physical location sign of the affiliated base station of new node and the logical place sign of new node, form the node identifier of new node; Select the guiding node of a node in the outer Chord ring as new node, if guiding node is a super node, guiding node provides precursor nodal information and descendant node information for new node, if guiding node is the ordinary node except that super node, guiding node provides precursor nodal information and descendant node information by this super node for new node after joining request of new node is transferred to super node under the guiding node.
According to another aspect of the present invention, layering Chord method for routing based on physical location comprises that also node withdraws from step, node withdraws from step: if super node need exit network, super node sends the information of withdrawing from and delivers the information of self preserving to precursor super node and follow-up super node, and the information of withdrawing from is sent in the base station under super node simultaneously; If the ordinary node except that super node need exit network, ordinary node sends the information of withdrawing to the precursor node, and the information of self preserving is handed to descendant node.
According to a further aspect of the invention, layering Chord method for routing based on physical location also comprises the hot point resource management process, the hot point resource management process is: node is periodically added up the visit situation of the resource of self-management, access times in the one-period are designated as hot point resource above the resource with all resource Average visits in one-period in the network, send on the affiliated super node of node, with on resources duplication all super nodes under the same base station, each super node is set up the hot point resource concordance list by super node.
According to a further aspect of the invention, the hot point resource management process also comprises: super node is periodically added up the visit situation of hot point resource in the hot point resource concordance list, and access times in the one-period are deleted from the hot point resource concordance list less than 50% hot point resource of Average visits in himself in first three cycle.
Compared with prior art, the invention has the beneficial effects as follows: should the base station be incorporated in the Chord ring based on the layering Chord method for routing of physical location, make and comprised actual physical location information in the node identifier, determine earlier during inquiry that resource belongs in the scope of which base station, no longer need to travel through all nodes of whole network, thereby accelerated the quick location of resource, introduce the notion of super node simultaneously, extracting the higher node of performance is directly managed by the base station, and other ordinary nodes are managed by super node, made full use of the outstanding service behaviour of super node, improved the search speed of network, under the situation about losing efficacy in the base station, can also get in touch and communicate by letter by super node between the node, improve stability of network and fail safe.
Description of drawings
The each side advantage that the present invention is above-mentioned can obviously and easily be understood from following accompanying drawing with to becoming the description of example, wherein:
Fig. 1 is the structural representation of Chord ring of the prior art;
Fig. 2 is the structural representation of PLHChord ring of the present invention;
Fig. 3 is the flow chart of the layering Chord method for routing based on physical location of the present invention;
Fig. 4 is the flow chart that adds step based on new node in the layering Chord method for routing of physical location of the present invention;
Fig. 5 is the average hop count schematic diagram of the layering Chord method for routing based on physical location of the present invention;
Fig. 6 is that the average route of the layering Chord method for routing based on physical location of the present invention postpones the range of extension schematic diagram.
Embodiment
Describe embodiments of the invention below in detail, the example of described embodiment is shown in the drawings, and wherein identical from start to finish or similar label is represented identical or similar device or the device with identical or similar functions.Below by the embodiment that is described with reference to the drawings is exemplary, only is used to explain the present invention, and can not be interpreted as limitation of the present invention.
Shown in Fig. 2 is PLHChord of the present invention (Physical Location Based HierarchicalChord, based on the layering Chord ring of physical location, the Tang Dynasty big, Chen Hongdan, Wang Heng, University Of Chongqing, Shao Yanqing, Chongqing College of Electronics Engineering) architecture.In the PLHChord model, the outer Chord ring of whole network is to be interconnected each other with the node that belongs to these base stations by at least one base station to constitute, the Chord ring that internal layer is made up of super node and base station, by NodeID number of node as can be seen node divide according to actual physical address, the geographical position that needs periodically to detect oneself to the base station changes the high-order information that is used to represent actual physical location among the NodeID.Node in the Chord ring is still formed structurized P2P network according to the rule of Chord agreement, can not finish communication by super node when having resource between the node in the same base station.
According to layering Chord method for routing of the present invention, may further comprise the steps:
A. at first constitute outer Chord ring by at least one base station and the node that belongs to the base station, the node identifier of node is formed by the physical location sign of base station with through the logical place sign of this node of Hash operation;
The ability scoring of B. calculating node in the outer Chord ring is:
W＝aB+bS+cT+dC+eK (2)
Wherein, B is the scoring of meshed network bandwidth, S is the node point reliability scoring, T is the average line duration scoring of node, C is the scoring of node computing capability, and K is the scoring of node storage capacity, and a, b, c, d, e are weight coefficient, the ability node that W is higher than predetermined threshold value of marking is set to super node, constitutes internal layer Chord ring by super node and base station.In one embodiment of the invention, scoring B, S, T, C and K assign to represent by 1,2,3,4 respectively, wherein 4 fens expression abilities are the highest, the expression ability was minimum in 1 minute, weight coefficient a, b, c, d, e are set to 1,1.5,3,2,2, if every score of a node N is followed successively by B=2, S=2, T=4, C=3 and K=4, the scoring of the ability of this node N is W=2 * 1+2 * 1.5+4 * 3+3 * 2+4 * 2=31 so.The threshold value of determining super node determines according to the real network environment, include 1024 nodes such as a base station, the ability of a super node is enough to manage 256 nodes, only need 4 super nodes so altogether, mark W by from big to small sort with the ability of all nodes this moment, make threshold value equal wherein the 5th W, thereby 4 nodes that will be higher than threshold value are extracted as super node.
As can be seen, super node is the high-performance node that has good computing capability, storage capacity and the network bandwidth in the node that connects of base station, so it has been endowed more responsibility, also network performance has been played bigger influence.Super node is set up routing table with preservation information, skin be responsible for preserving and its precursor super node between ordinary node and this base station in the information of super node, preserve the information of other super nodes according to the Chord route at internal layer, need to duplicate file popular in the present network simultaneously, the adding of new node also needs the assistance of super node.In the PLHChord ring, a base station is in charge of and is arrived next base station all nodes before thereafter, particularly, the control super node is directly managed in the base station, manage comprising certainly in the certain limit by each super node again in interior node, still be example with the above-mentioned base station that comprises 1024 nodes, if node N1, N300, N700, N1000 is a super node, super node N1 is directly managed in this base station so, N300, N700, N1000, again by super node N1 management node N1～N256, super node N300 management node N257～N512, super node N700 management node N513～N768, super node N1000 management node N769～N1024.
C. inquire about the route of start node then to resource, inquire the node identifier of corresponding destination node according to the keyword identifier of resource, if the node identifier of start node is identical with the node identifier of destination node, start node is designated as destination node, poll-final; Otherwise,, just super node is designated as destination node, poll-final if the node identifier of the super node under the start node is identical with the node identifier of destination node; Otherwise, the physical location of base station sign is to find out the super node nearest apart from resource in the node identifier of query aim node, inquire about the node that this super node connects,, the routed path from the start node to the destination node is added in the routing table entry up to the destination node that inquires storage resources.
Shown in Fig. 3 is the flow process of layering Chord method for routing of the present invention.A node N wants the routing procedure of the resource of key word of the inquiry key to be:
A. at first find with Hash operation after the corresponding node identifier NodeID of keyword identifier KeyID of resource, inquire about the Local table of start node N again, judge whether keyword key drops in the Local table scope, the Local table is the local routing table of node, the pointer gauge of node (Finger table) just, storage be the routing iinformation that connects other nodes.If just return the respective objects node, poll-final, otherwise turn to b.
B. by the supernode table inquiry is sent to super node.Super node is inquired about its Local table, Cache table and HotResource table.The Cache table is the buffering route information table, simultaneously also can download time many, relatively the resource information of focus store the HotResource table into, the information of buffer memory some is directly searched from the HotResource table when running into hot information and is got final product, save time, raise the efficiency.Just return destination node address if find, search end.Otherwise turn to c.
C. super node is inquired about its Finger table and Bucket shows, and finds out one respectively before keyword key and the super node nearest apart from key.Bucket table is the cache information table of the node stored in order, utilizes the physical location information that comprises among the NodeID can determine the scope which base station is resource be positioned at fast, has improved search speed.
D. this super node will be inquired about its Local table, and local informations such as Cache table and HotResource table send to this start node to information.
E. receive when inquiry when a destination node, it will be in the Bucket table buffer memory origin node address information.When an inquiry is finished, the nodal information of node notice super node and the success of copy caching query thereof.When table is filled the information of utilizing when expiring in LRU (Least Recently Used does not use rule recently at most) the replacement policy admin table.
Shown in Fig. 4 is that new node adds step in the layering Chord method for routing of the present invention, and new node adds step and is: obtain the physical location sign of the affiliated base station of new node N and the logical place sign of new node, form the node identifier NodeID of new node; Select the guiding node of a node M in the outer Chord ring as new node N, if guiding node M is a super node, guiding node M provides precursor nodal information and descendant node information for new node N, if guiding node M is the ordinary node except that super node, guiding node M provides precursor nodal information and descendant node information by this super node for new node after joining request of new node N is transferred to super node under the guiding node M.Node in the adding algorithm of new node N and the existing Chord model adds the class of algorithms seemingly, just manages control by super node, has improved the dynamic of P2P network.
Layering Chord method for routing comprises that also node withdraws from step, node withdraws from step: if super node need exit network, keep the integrality of Chord ring because not only will do the exit network work done of ordinary node, but also to safeguard the annexation that internal layer Chord encircles, so super node will send the information of withdrawing from and deliver the information of self preserving to its precursor super node and follow-up super node, the information of withdrawing from is sent in the base station under super node simultaneously; If the ordinary node except that super node need exit network, the node that only need follow the Chord agreement withdraws from the Chord ring that rule withdraws from its place base-station node and gets final product, because in the PLHChord model, ordinary node only need be safeguarded its position in our station, need not to know the information of other base-station nodes, directly do not get in touch with other station interior nodes, so ordinary node only needs to send the information of withdrawing to its precursor node, and the information of self preserving is handed to its descendant node.
In the actual queries process, some information may be inquired about continually and be formed hot point resource, therefore layering Chord method for routing also comprises the hot point resource management process, the hot point resource management process is: node is periodically added up the visit situation of the resource of self-management, the resource that access times in the one-period is surpassed all resource Average visits in the network is designated as hot point resource, send on the affiliated super node of node, with on resources duplication all super nodes under the same base station, each super node is set up the hot point resource concordance list by super node.When certain inquiry is routed to this base station, can select one of them super node to conduct interviews, can alleviate the burden of other super nodes.
The hot point resource concordance list is preserved the resource information of coming from other super node redundancy, super node is periodically added up the visit situation of hot point resource in the hot point resource concordance list, if certain hot point resource in one-period access times less than 50% of Average visits in himself in first three cycle, illustrate that it can not be considered to hot point resource again, need delete it from the hot point resource concordance list.
Adopt l-G simulation test to check the present invention to put the service behaviour of layering PLHChord method for routing, adopt BRITG (Boston university Representative Internet Topology Generator in the l-G simulation test, the typical network topology maker of Boston University) come the analog network topological structure, bottom-layer network topological structure and real network topological structure that BRITG generates are quite similar.Routing infrastructure is used the Waxman pattern.This l-G simulation test environment configurations is as follows: a pc machine, its cpu are Intel P42.6GHz, in save as 1G RAM, operating system is Redhat linux9.0.Simulation software development language: C++, developing instrument: ECLIPSE3.2.The nerve of a covering simulator of revising based on p2psim-0.3 has been installed, and m=32 is so identifier space is O～2
32-1.
In the l-G simulation test by more original the expanded Chord Routing Protocol of p2psim and the PLHChord Routing Protocol after improving in the difference aspect the resource positioning performance.After the p2psim operation, can obtain a lot of important data, comprise average hop count, on average search time of delay etc., only need to consider the data of this two aspect here from its output.
On average searching hop count is the important indicator of estimating the P2P system, and the hop count of on average searching of structuring DHT algorithm Chord model is
N
NodeBe number of network node.
The PLHChord model is based on the hierarchical network model of physical location, utilize base station physical position ID to realize the mutual coupling of the KeyID of the NodeID of node and resource, improve the position distance of physical network and the consistency of cover layer logic arrangement, reduced the hop count of inquiry by searching of internal layer.
Suppose a super node management M
NodeIndividual ordinary node, routed path is under the PLHChord model so: from ordinary node to the internal layer super node to resource under node.Maximum hop count is:
If super node is base-station node then jumps to affiliated resource base-station node by core net one that jumping figure is 4.Work as M
NodeGet 16,64,256, and the emulation that experimentizes during the stochastic simulation situation.Adopt 512,1024,2048,4096,6144,8192,10240 nodes that have seven groups of varying number scales altogether to carry out l-G simulation test respectively, wherein each node is stored 50 files respectively, each node mean random request 2 times.
Shown in Fig. 5 is the simulation result of the average hop count under the algorithms of different.As can be seen from Figure 5 PLHChord has reduced 22% to 38% than former Chord on average hop count.Node is provided with the qualification interval and super node comprises more nodal information owing to showing at Local, and the logical reach of its covering approaches target more than former Chord algorithm certainly, so the PLHChord system is greatly improved with respect to former Chord router efficiency.
The end-to-end routing delay of message (end-to-end latency) is an important parameter of weighing the actual routing performance of P2P system.Since query messages in overlay network process distance and in bottom-layer network actual distance inconsistent, so use average retardation range of extension (Latency Stretch) to represent ratio between the distance usually.Average retardation range of extension S is defined as the ratio of average logical delay of system and average physical delay, and the formula of embodying is:
In the formula, D
Chord(i is that logical network Chord lower node i is to the time-delay between the node j, D j)
IP(i is that physical network IP (Internet Protocol, Internet protocol) lower node i is to the time-delay between the node j, N j)
NodeBe the network node number.If it is big to postpone range of extension, illustrate that then overlay network and bottom-layer network are widely different, otherwise the delay range of extension is more little, illustrates that overlay network is consistent more with bottom-layer network.In actual Internet network, the time-delay in the territory always is far smaller than between the territory and delays time.Therefore the jumping figure expense is 20ms in the supposition station, and the jumping figure expense is 100ms between the station.For the accuracy of experimental data, the situation of seven groups of different scales such as employing 256,1024,2048,4096,6000,8192,10000 is carried out 1000 route queryings operation equally, and simulation result as shown in Figure 6.As can be seen from Figure 6, increase along with number of network node, HChord (Hierarchical Chord, layering Chord ring) method for routing is owing to considered the influence of super node, make its service behaviour significantly better than the Chord method for routing, and the PLHChord method for routing has been taken all factors into consideration the influence to network performance of super node and base station, and its service behaviour has had further raising again than the HChord method for routing.
Because the high-order information representation of node identifier NodeID cryptographic Hash is the base station physical positional information, can find the corresponding base station position according to resource KeyID, base-station node is at last to the target resource node under the resource again to affiliated base-station node to core net from initial query node in query path, and the route between the base-station node is consistent substantially.The average retardation range of extension of PLHChord tends towards stability substantially, and node physical distance delay range of extension far away more is all the better little.
In actual mobile P 2 P network environment, communication between the node can be subjected to the influence of multiple unfavorable factors such as the translational speed of multipath fading, barrier, node is fast, feasible communication is not smooth, cause searching time lengthening or communication disruption, judge back identification node failure through node, need to select new routed path.Make the whole resource query time lengthening of PLHChord method for routing under the both of these case, but average hop count and average retardation range of extension are not had much affect.On the contrary, the PLHChord method for routing utilizes super node can upgrade routing table faster, selects new path, and is more fast than Chord method for routing, is subjected to the influence of network environment littler.
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 (5)
1. layering Chord method for routing based on physical location is characterized in that may further comprise the steps:
A. constitute outer Chord ring by at least one base station and the node that belongs to described base station, the node identifier of described node is formed by the physical location sign of base station with through the logical place sign of this node of Hash operation;
The ability scoring of B. calculating node in the described outer Chord ring is W=aB+bS+cT+dC+eK, wherein, B is the scoring of meshed network bandwidth, S is the node point reliability scoring, and T is the average line duration scoring of node, and C is the scoring of node computing capability, K is the scoring of node storage capacity, a, b, c, d, e are weight coefficient, and the ability node that W is higher than predetermined threshold value of marking is set to super node, is constituted internal layer Chord ring and is set up routing table by described super node and described base station;
C. inquire about the route of start node to resource, inquire the node identifier of corresponding destination node according to the keyword identifier of described resource, if the node identifier of described start node is identical with the node identifier of described destination node, described start node is designated as destination node, poll-final; Otherwise,, just described super node is designated as destination node, poll-final if the node identifier of the super node under the described start node is identical with the node identifier of described destination node; Otherwise, inquire about in the node identifier of described destination node the physical location sign to find out the super node nearest apart from resource, inquire about the node that this super node connects, destination node up to inquiring the described resource of storage adds the routed path from described start node to described destination node the routing table entry.
2. the layering Chord method for routing based on physical location according to claim 1 is characterized in that: comprise that also new node adds step, described new node adds step and is:
Obtain the physical location sign of the affiliated base station of new node and the logical place sign of new node, form the node identifier of described new node;
Select the guiding node of a node in the described outer Chord ring as described new node, if described guiding node is a super node, described guiding node provides precursor nodal information and descendant node information for described new node, if described guiding node is the ordinary node except that super node, described guiding node provides precursor nodal information and descendant node information by this super node for described new node after joining request of described new node is transferred to super node under the described guiding node.
3. the layering Chord method for routing based on physical location according to claim 1 is characterized in that: comprise that also node withdraws from step, described node withdraws from step and is:
If super node need exit network, described super node sends the information of withdrawing from and delivers the information of self preserving to precursor super node and follow-up super node, and the information of withdrawing from is sent in the base station under described super node simultaneously;
If the ordinary node except that super node need exit network, described ordinary node sends the information of withdrawing to the precursor node, and the information of self preserving is handed to descendant node.
4. the layering Chord method for routing based on physical location according to claim 1 is characterized in that: also comprise the hot point resource management process, described hot point resource management process is:
Described node is periodically added up the visit situation of the resource of self-management, access times in the one-period are designated as hot point resource above the resource with all resource Average visits in one-period in the network, send on the affiliated super node of described node, with on described resources duplication all super nodes under the same base station, each super node is set up the hot point resource concordance list by described super node.
5. the layering Chord method for routing based on physical location according to claim 4, it is characterized in that: described hot point resource management process also comprises:
Described super node is periodically added up the visit situation of hot point resource in the described hot point resource concordance list, and access times in the one-period are deleted from described hot point resource concordance list less than 50% hot point resource of Average visits in himself in first three cycle.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102187423A CN101867527B (en) | 2010-07-06 | 2010-07-06 | Layering Chord routing method based on physical position |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102187423A CN101867527B (en) | 2010-07-06 | 2010-07-06 | Layering Chord routing method based on physical position |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101867527A true CN101867527A (en) | 2010-10-20 |
| CN101867527B CN101867527B (en) | 2012-08-08 |
Family
ID=42959096
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102187423A Expired - Fee Related CN101867527B (en) | 2010-07-06 | 2010-07-06 | Layering Chord routing method based on physical position |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101867527B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102201986A (en) * | 2011-05-10 | 2011-09-28 | 苏州两江科技有限公司 | Zonal routing method for non-relational database Cassandra |
| CN102572602A (en) * | 2012-01-16 | 2012-07-11 | 电子科技大学 | Distributed index achieving method in peer-to-peer (P2P) live stream system based on distributed hash table (DHT) |
| CN103246484A (en) * | 2013-05-03 | 2013-08-14 | 华为技术有限公司 | Data storing method, data storing device and data storing system |
| CN107239474A (en) * | 2016-03-29 | 2017-10-10 | 阿里巴巴集团控股有限公司 | A kind of data record method and device |
| CN107870877A (en) * | 2016-09-23 | 2018-04-03 | 伊姆西Ip控股有限责任公司 | For managing the method and system of data access within the storage system |
| CN108337170A (en) * | 2018-01-30 | 2018-07-27 | 浙江省公众信息产业有限公司 | Distributed resource lookup method and system |
| CN112019451A (en) * | 2019-05-29 | 2020-12-01 | 中国移动通信集团安徽有限公司 | Bandwidth allocation method, debugging network element, local cache server and computing equipment |
| CN112235401A (en) * | 2020-10-14 | 2021-01-15 | 北京理工大学 | Routing table information searching method and system based on chord algorithm |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101399743A (en) * | 2007-09-28 | 2009-04-01 | 华为技术有限公司 | Method and system for searching data in P2P network base on distributed Hash table |
| CN101605094A (en) * | 2009-04-29 | 2009-12-16 | 哈尔滨工程大学 | Ring model and routing algorithm thereof based on point to point network |
| CN101645922A (en) * | 2009-04-17 | 2010-02-10 | 中国科学院声学研究所 | CDN network system based on geographical position information encoding and distribution treatment method |
-
2010
- 2010-07-06 CN CN2010102187423A patent/CN101867527B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101399743A (en) * | 2007-09-28 | 2009-04-01 | 华为技术有限公司 | Method and system for searching data in P2P network base on distributed Hash table |
| CN101645922A (en) * | 2009-04-17 | 2010-02-10 | 中国科学院声学研究所 | CDN network system based on geographical position information encoding and distribution treatment method |
| CN101605094A (en) * | 2009-04-29 | 2009-12-16 | 哈尔滨工程大学 | Ring model and routing algorithm thereof based on point to point network |
Non-Patent Citations (4)
| Title |
|---|
| 《中国优秀硕士论文全文数据库 》 20100115 姜朝晖 P2P网络的搜索算法研究 I139-17 , 第1期 * |
| 《中国优秀硕士论文全文数据库 》 20100115 姜朝晖 P2P网络的搜索算法研究 I139-17 , 第1期 2 * |
| 《中国优秀硕士论文全文数据库》 20090115 成培 P2P对等网络资源定位技术的研究 I139-59 , 第1期 * |
| 《中国优秀硕士论文全文数据库》 20090115 成培 P2P对等网络资源定位技术的研究 I139-59 , 第1期 2 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102201986A (en) * | 2011-05-10 | 2011-09-28 | 苏州两江科技有限公司 | Zonal routing method for non-relational database Cassandra |
| CN102572602A (en) * | 2012-01-16 | 2012-07-11 | 电子科技大学 | Distributed index achieving method in peer-to-peer (P2P) live stream system based on distributed hash table (DHT) |
| CN102572602B (en) * | 2012-01-16 | 2016-06-29 | 电子科技大学 | In P2P live streaming system, the distributed index based on DHT realizes method |
| CN103246484A (en) * | 2013-05-03 | 2013-08-14 | 华为技术有限公司 | Data storing method, data storing device and data storing system |
| CN107239474B (en) * | 2016-03-29 | 2021-05-04 | 创新先进技术有限公司 | Data recording method and device |
| CN107239474A (en) * | 2016-03-29 | 2017-10-10 | 阿里巴巴集团控股有限公司 | A kind of data record method and device |
| CN107870877A (en) * | 2016-09-23 | 2018-04-03 | 伊姆西Ip控股有限责任公司 | For managing the method and system of data access within the storage system |
| US10846094B2 (en) | 2016-09-23 | 2020-11-24 | EMC IP Holding Company LLC | Method and system for managing data access in storage system |
| CN107870877B (en) * | 2016-09-23 | 2024-04-23 | 伊姆西Ip控股有限责任公司 | Method and system for managing data access in a storage system |
| CN108337170A (en) * | 2018-01-30 | 2018-07-27 | 浙江省公众信息产业有限公司 | Distributed resource lookup method and system |
| CN108337170B (en) * | 2018-01-30 | 2021-08-17 | 浙江省公众信息产业有限公司 | Distributed resource searching method and system |
| CN112019451B (en) * | 2019-05-29 | 2023-11-21 | 中国移动通信集团安徽有限公司 | Bandwidth allocation method, debugging network element, local cache server and computing device |
| CN112019451A (en) * | 2019-05-29 | 2020-12-01 | 中国移动通信集团安徽有限公司 | Bandwidth allocation method, debugging network element, local cache server and computing equipment |
| CN112235401A (en) * | 2020-10-14 | 2021-01-15 | 北京理工大学 | Routing table information searching method and system based on chord algorithm |
| CN112235401B (en) * | 2020-10-14 | 2021-09-24 | 北京理工大学 | Routing table information searching method and system based on chord algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101867527B (en) | 2012-08-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101867527B (en) | Layering Chord routing method based on physical position | |
| CN101997785B (en) | Gateway system and control method | |
| CN1331331C (en) | Method for implementing self-organizing network | |
| CN101640623A (en) | Method and equipment for searching resource in peer-to-peer network | |
| Zhou et al. | A hybrid P2P approach to service discovery in the cloud | |
| Wirawan et al. | Research in wireless sensor networks: optimization service discovery using attenuated bloom filter | |
| Guo et al. | Quasi-kautz digraphs for peer-to-peer networks | |
| Moeini et al. | Efficient caching for peer-to-peer service discovery in Internet of Things | |
| CN102378409B (en) | Hierarchical Chord packet network and organization method thereof in Internet of things | |
| Guo et al. | HDS: A fast hybrid data location service for hierarchical mobile edge computing | |
| Saravanan et al. | An effective model for QoS assessment in data caching in MANET environments | |
| Guclu et al. | Limited scale-free overlay topologies for unstructured peer-to-peer networks | |
| Bao et al. | An efficient trip planning algorithm under constraints | |
| Zheng et al. | An efficient random walks based approach to reducing file locating delay in unstructured P2P network | |
| Krishnan et al. | Delay reduction by providing location based services using hybrid cache in peer to peer networks | |
| Papapetrou et al. | Speeding-up cache lookups in wireless ad-hoc routing using bloom filters | |
| Chidambaram et al. | MELOC: Memory and location optimized caching model for small mobile ad hoc networks | |
| Wang et al. | A Routing Algorithm Based on the Prediction of Node Meeting Location in Opportunistic Networks | |
| Khakpour et al. | Chapar: A persistent overlay event system for manets | |
| Xun-Yi et al. | P2P Replica-tree based Consistency Maintenance Strategy | |
| Zöls et al. | The Impact of Content Distribution on Structured P2P Networks in Mobile Scenarios | |
| Shen et al. | Efficient Peer-to-peer Content Sharing for Learning in Virtual Worlds | |
| Jain et al. | Basic needs for designing a good cooperative caching management technique | |
| Araújo | Position-based distributed hash tables | |
| Varvello et al. | Range queries in manet: Can information-centric networking help? |
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 |
Granted publication date: 20120808 Termination date: 20150706 |
|
| EXPY | Termination of patent right or utility model |