[go: up one dir, main page]

CN101399688A - Publishing method and device for distributed region lookup zone - Google Patents

Publishing method and device for distributed region lookup zone Download PDF

Info

Publication number
CN101399688A
CN101399688A CNA2007101627053A CN200710162705A CN101399688A CN 101399688 A CN101399688 A CN 101399688A CN A2007101627053 A CNA2007101627053 A CN A2007101627053A CN 200710162705 A CN200710162705 A CN 200710162705A CN 101399688 A CN101399688 A CN 101399688A
Authority
CN
China
Prior art keywords
node
distributed area
interval
area search
search
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.)
Pending
Application number
CNA2007101627053A
Other languages
Chinese (zh)
Inventor
管红光
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CNA2007101627053A priority Critical patent/CN101399688A/en
Publication of CN101399688A publication Critical patent/CN101399688A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

本发明公开了一种分布式区域查找区间的发布方法，包括：根据分布式区域查找区间的上限和节点的节点标识，在分布式区域查找网络中选择待发布节点；向所述待发布节点发布所述分布式区域查找区间；向所述待发布节点的邻居节点发布所述分布式区域查找区间。本发明还公开了一种分布式区域的查找方法、一种分布式区域查找网络和一种节点。本发明通过将分布式区域查找区间在分布式区域查找网络上进行连续分段的分布式发布，查找时在最终路由到的节点里进行查找值和区间值的比较，实现了在无需目录服务器保存节点的共享资源的目录信息的情况下，进行在分布式区域查找网络上的分布式区域查找，减小了系统开销，提高了系统的可靠性和安全性。

The invention discloses a method for releasing a distributed area search interval, comprising: selecting a node to be released in a distributed area search network according to the upper limit of the distributed area search interval and the node identifier of the node; The distributed area search interval; publishing the distributed area search interval to the neighbor nodes of the node to be published. The invention also discloses a distributed area search method, a distributed area search network and a node. In the present invention, the distributed area search interval is continuously segmented and distributed on the distributed area search network, and the search value and the interval value are compared in the node to which the search is finally routed, so that the search area does not need to be saved by the directory server. In the case of the directory information of the shared resources of the nodes, the distributed area search is performed on the distributed area search network, which reduces the system overhead and improves the reliability and security of the system.

Description

The dissemination method and the device in a kind of distributed regional search interval
Technical field
The present invention relates to networking technology area, particularly relate to the dissemination method and the device in a kind of distributed regional search interval.
Background technology
Along with rapid development of network technique, the P2P of internet system (Peer-to-Peer, equity is calculated) pattern is widely used.In reciprocity computing system, need to realize the function of regional search.Regional search is meant for a specified value, finds that all cover the interval of this set-point in the system.For example in VOD (Video On Demand, program request), the time point of given program request 5 minutes then in the resource that all have been issued, is searched the interval that covered 5 minutes.
At present, generally adopt the catalogue centralized approach to carry out distributed regional search.This method is meant that all active nodes in the network all are published to the directory information of own shared resource on the LIST SERVER, when searching, carries out database lookup in LIST SERVER, thereby finds needed interval.When adopting this method, the directory information of the shared resource of all active nodes in the in store network of LIST SERVER.When needs were inquired about certain file, user node sent the file polling request to LIST SERVER, and LIST SERVER returns the destination node information that meets search request after retrieving accordingly and inquiring about.After user node receives and replys, connect according to destination node information and destination node, and the beginning file transfer.
The process of obtaining a music file with user node from network is an example, the music file index that all active nodes are uploaded in the in store network of the LIST SERVER in the network and the information of deposit position.When this user node need obtain a music file, at first be connected to LIST SERVER, retrieve at LIST SERVER, and return the information of the destination node that has this music file by LIST SERVER, this user node is directly linked destination node and is obtained this music file then.
In realizing process of the present invention, the inventor finds that there are the following problems at least in the prior art: when adopting the catalogue centralized approach to carry out distributed regional search, need LIST SERVER to deposit the directory information of the shared resource of all active nodes in the network, cause Single Point of Faliure easily, if LIST SERVER paralysis, then can cause the whole system collapse, reliability and fail safe are lower.And, cause the expense of LIST SERVER very big because the random adding of node and leaving needs constantly to upgrade directory information.
Summary of the invention
The problem that the embodiment of the invention will solve provides the dissemination method and the device in a kind of distributed regional search interval, preserves under the situation of directory information of shared resource of node need not LIST SERVER, can carry out distributed regional search.
For achieving the above object, the technical scheme of the embodiment of the invention provides the dissemination method in a kind of distributed regional search interval, may further comprise the steps:, in distributed regional search network, select node to be released according to the upper limit in distributed regional search interval and the node identification of node; Issue described distributed regional search interval to described node to be released; Issue described distributed regional search interval to the neighbor node of described node to be released.
The technical scheme of the embodiment of the invention also provides a kind of lookup method of distributed zone, may further comprise the steps: the node identification according to the value of searching and node, obtain node to be found in distributed regional search network; According to the upper limit of the described value of searching, obtain the interval that covers the described value of searching with the distributed regional search interval of described node preservation to be found.
The technical scheme of the embodiment of the invention also provides a kind of distributed regional search network, and the minimum node of node is identified to the scope between the maximum node sign in the described network, and correspondence is by the maximum magnitude in the zone to be found of traffic performance decision.
The technical scheme of the embodiment of the invention also provides a kind of node, comprises node selected cell to be released and release unit; Described node selected cell to be released is used for according to the upper limit in distributed regional search interval and the node identification of node, selects node to be released in distributed regional search network, and selection result is sent to described release unit; Described release unit is used for issuing described distributed regional search interval to the node of described distributed regional search network.
An embodiment in the technique scheme has following advantage: the embodiment of the invention is by carrying out distributed regional search interval the distributed post of contiguous segmentation on distributed regional search network, when searching final route to node in the comparison of the value of searching and interval value, realized preserving under the situation of directory information of shared resource of node need not LIST SERVER, carry out the distributed regional search on distributed regional search network, reduce overhead, improved the reliability and the fail safe of system.
Description of drawings
Fig. 1 is the structural representation of a kind of distributed regional search network of the embodiment of the invention;
Fig. 2 is the flow chart of dissemination method in a kind of distributed regional search interval of the embodiment of the invention;
Fig. 3 is the dissemination method schematic diagram in a kind of distributed regional search interval of the embodiment of the invention;
Fig. 4 is the dissemination method schematic diagram in the another kind of distributed regional search interval of the embodiment of the invention;
Fig. 5 is the structural representation after a kind of distributed regional search network of the embodiment of the invention adds ingress;
Fig. 6 is the structural representation after a kind of distributed regional search network of the embodiment of the invention leaves node;
Fig. 7 is the schematic diagram of lookup method in a kind of distributed zone of the embodiment of the invention;
Fig. 8 is the structural representation of a kind of node of the embodiment of the invention.
Embodiment
Below in conjunction with drawings and Examples, the specific embodiment of the present invention is described in further detail:
The distributed regional search network of the embodiment of the invention can be a class Chord ring, Pastry, CAN, structured P 2 P networks such as Tapestry, in this network the minimum node of node be identified to scope correspondence between the maximum node sign by the maximum magnitude in the zone to be found of traffic performance decision (for example in VOD, its traffic performance is that the length of film is 7200 seconds, then with this film corresponding distributed regional search network in, the node identification of the node of node identification minimum is 0, the node identification of the node of node identification maximum is 7200), and the routing mechanism of described network using structured p2p network.With class Chord loop network is that distributed regional search network is an example, a kind of distributed regional search network of the embodiment of the invention comprises 6 nodes as shown in Figure 1: node identification is that 0 node 0, node identification are that 3 node 3, node identification are that 7 node 7, node identification are that 13 node 13, node identification are that 20 node 20 and node identification are 50 node 50.The upper limit in the distributed regional search interval that node is preserved in this network is less than or equal to the node identification of described node, and greater than the node identification of the preceding continuous node of described node.The interval A[1 of the in store A distribution of resource formula regional search of node 3～35 wherein], the interval A of node 7 in store A distribution of resource formula regional search (3～35], the interval A of node 13 in store A distribution of resource formula regional search (7～35], the interval A of node 20 in store A distribution of resource formula regional search (13～35], the interval A of node 50 in store A distribution of resource formula regional search (20～35].
If there is node to add this distributed regional search network, the distributed regional search that node then to be added is preserved is interval to be between the seek area of the node identification that the upper limit is less than or equal to this node to be added between the seek area that the descendant node of this node to be added was preserved before this node to be added added; The descendant node of this node to be added is limited to the left side of the node identification of this node to be added and opens interval closed at the right on the distributed regional search interval of this node adding back preservation to be added is.With node identification be 5 node 5 to add these distributed regional search networks be example, the descendant node of node 5 is a node 7.After node 5 adds, the interval A of node 5 in store A distribution of resource formula regional search (3～35], the interval A of node 7 in store A distribution of resource formula regional search (5～35].
If there is node to leave this distributed regional search network, wait then to leave that distributed regional search that the descendant node of node preserves is interval waits to leave between the seek area of node preservation for this.Leaving this distributed regional search network with node 7 is example, after node 7 leaves, the interval A of node 13 in store A distribution of resource formula regional search (3～35].
Present embodiment is by on distributed regional search network, distributed regional search interval is preserved on contiguous segmentation ground, make when searching can final route to node in the comparison of the value of searching and interval value, realized preserving under the situation of directory information of shared resource of node need not LIST SERVER, carry out the distributed regional search on distributed regional search network, reduce overhead, improved the reliability and the fail safe of system.
The flow process of the dissemination method in a kind of distributed regional search interval of the embodiment of the invention supposes in the present embodiment that node 50 is published to distributed regional search network shown in Figure 1 with B distribution of resource formula regional search interval B [2,15] as shown in Figure 2.With reference to Fig. 2, present embodiment may further comprise the steps:
Step s201 according to the upper limit in distributed regional search interval and the node identification of node, selects node to be released in distributed regional search network.If the node identification of the node in the described distributed regional search network is more than or equal to the upper limit in described B distribution of resource formula regional search interval, and the node identification of the preceding continuous node of described node is less than the upper limit in described B distribution of resource formula regional search interval, and then described node is a node to be released.Because B distribution of resource formula regional search interval described in the present embodiment is B[2,15], be limited to 2 on it, and node identification 3 is greater than 2, and node identification 0 is less than 2, so selection node 3 is a node to be released.
Step s202 issues distributed regional search interval to node to be released.To be node 50 be published to node identification with described B distribution of resource formula regional search interval B [2,15] is 3 node.
Step s203 judges whether to continue the described distributed regional search of issue interval, if then change step s204, otherwise finish.Its deterministic process is: if the node identification of described node to be released, then continues the described distributed regional search of issue interval less than the lower limit in described distributed regional search interval.Be limited to 15 owing to the following of described B distribution of resource formula regional search interval in the present embodiment, and the node identification 3 of node 3 is less than 15, so continue issue described distributed regional search interval B [2,15].
Step s204 issues described distributed regional search interval to the descendant node of described node to be released, and changes step s203.Its dissemination method is divided into dual mode:
A kind of mode is: at first interval publisher node obtains the address of the descendant node of described node to be released from node to be released, interval then publisher node is according to the address of the descendant node of described node to be released, will be published to the descendant node of described node to be released greater than the value of the node identification of described node to be released.To be issued as example to node 7, node 3 sends to node 50 with the address of node 7, and node 50 will be published to node 7 greater than 3 value according to the address of node 7, be about to B distribution of resource formula regional search interval B (3～15] be published to node 7.Adopt this mode, the process that node 50 is published to this distributed regional search network with interval B [2,15] as shown in Figure 3.After issue is finished, node 3 in store B distribution of resource formula regional search interval B [2～15], node 7 in store B distribution of resource formula regional search interval B (3～15], node 13 in store B distribution of resource formula regional search interval B (7～15], node 20 in store B distribution of resource formula regional search interval B (13～15].
Another kind of mode is: node to be released will be published to the descendant node of described node to be released greater than the value of the node identification of described node to be released.To be issued as example to node 7, node 3 will be published to node 7 greater than 3 value, be about to B distribution of resource formula regional search interval B (3～15] be published to node 7.Adopt this mode, the process that node 50 is published to this distributed regional search network with interval B [2,15] as shown in Figure 4.After issue is finished, node 3 in store B distribution of resource formula regional search interval B [2～15], node 7 in store B distribution of resource formula regional search interval B (3～15], node 13 in store B distribution of resource formula regional search interval B (7～15], node 20 in store B distribution of resource formula regional search interval B (13～15].
If there is node to add distributed regional search network, then the descendant node of node to be added is published to described node to be added with the distributed regional search interval that the interval upper limit of distributed regional search is less than or equal to the node identification of node to be added, and interval closed at the right is opened on the left side that the node identification that is limited to described node to be added is revised as in the distributed regional search interval of described descendant node.When adopting shown in Figure 1 distributed regional search network, with node identification is that to add these distributed regional search networks be example to 5 node 5, node 7 with the interval A of A distribution of resource formula regional search (3～35] be published to node 5, and the A distribution of resource formula regional search interval of node 7 is revised as and is limited to a left side of 5 and opens interval closed at the right, promptly the node 7 A distribution of resource formula regional search interval of preserving become A (5～35].After node 5 added this distributed regional search network, the structure of this network as shown in Figure 5.The interval A[1 of the in store A distribution of resource formula regional search of node 3～35 wherein], the interval A of node 5 in store A distribution of resource formula regional search (3～35], the interval A of node 7 in store A distribution of resource formula regional search (5～35], the interval A of node 13 in store A distribution of resource formula regional search (7～35], the interval A of node 20 in store A distribution of resource formula regional search (13～35], the interval A of node 50 in store A distribution of resource formula regional search (20～35].
If there is node to leave distributed regional search network, the distributed regional search interval that node then to be left will be preserved is published to the described descendant node of waiting to leave node.When adopting shown in Figure 1 distributed regional search network, leaving this distributed regional search network with node 7 is example, node 7 with the interval A of the A distribution of resource formula regional search of preserving (3～35] be published to node 13.After node 7 left this distributed regional search network, the structure of this network as shown in Figure 6.The interval A[1 of the in store A distribution of resource formula regional search of node 3～35 wherein], the interval A of node 13 in store A distribution of resource formula regional search (3～35], the interval A of node 20 in store A distribution of resource formula regional search (13～35], the interval A of node 50 in store A distribution of resource formula regional search (20～35].
Present embodiment is by carrying out distributed regional search interval the distributed post of contiguous segmentation on distributed regional search network, make when searching can final route to node in the comparison of the value of searching and interval value, realized preserving under the situation of directory information of shared resource of node need not LIST SERVER, carry out the distributed regional search on distributed regional search network, reduce overhead, improved the reliability and the fail safe of system.
The lookup method in a kind of distributed zone of the embodiment of the invention as shown in Figure 7, hypothesis node 0 need be searched the value 5 of A resource in the present embodiment in distributed regional search network shown in Figure 1.With reference to Fig. 7, the search procedure of present embodiment is: at first according to the node identification of the value of searching and node, in distributed regional search network, obtain node to be found, if the described value of searching is less than or equal to the node identification of node, and arrive the distance minimum of the node identification of described node, then described node is a node to be found; Then according to the upper limit of the described value of searching with the distributed regional search interval of described node preservation to be found, obtain the interval that covers the described value of searching, if the described value of searching is the interval of described covering value of searching greater than the upper limit in the distributed regional search interval of described node preservation to be found between then described seek area.In the present embodiment, route according to Chord, the value of searching 5 is routed to node 7, because the value of searching 5 is less than node identification 7, and the value of searching 5 is minimum to the distance of node identification 7, further the interval A that preserves greater than this node of the value of searching 5 (3～35] the upper limit 3, therefore interval (3～35] covered the value of searching 5, issue this interval node 50 and can provide service for node 0.
The route of this distributed regional search network adopts the routing mechanism of Chord in the present embodiment, its routing procedure can be the successor (descendant node of in store this node of node in this distributed regional search network, the adjacent node of this node back on the clockwise direction) and predecessor (preceding continuous node, the adjacent node of this node front on the clockwise direction) information, when certain node will be searched the information of value 5 of A resource such as node 0, node 0 at first will find the node of the value 5 of being in charge of the A resource.At first node 0 is inquired the successor of node 0, and promptly node 3; If the value 5 of node 3 not responsible management A resources, then node 3 is inquired the successor of oneself, and promptly node 7.This operation is carried out repeatedly, until the node that finds the value 5 of being in charge of the A resource.
Present embodiment is by on the distributed regional search network in store distributed regional search interval, contiguous segmentation ground, carry out searching of distributed zone, make when searching can final route to node in the comparison of the value of searching and interval value, realized preserving under the situation of directory information of shared resource of node need not LIST SERVER, carry out the distributed regional search on distributed regional search network, reduce overhead, improved the reliability and the fail safe of system.
The structural representation of a kind of node of the embodiment of the invention comprises node selected cell 81 to be released, judging unit 82 and release unit 83 as shown in Figure 8; Wherein release unit 83 is connected with judging unit 82 with node selected cell 81 to be released respectively.Node selected cell 81 to be released is used for according to the upper limit in distributed regional search interval and the node identification of node, selects node to be released in distributed regional search network, and selection result is sent to release unit 83; Judging unit 82 is used to judge whether continue the distributed regional search of issue interval, and judged result is sent to release unit 83; Release unit 83 is used for issuing distributed regional search interval to the node of distributed regional search network.
Present embodiment by with the interval contiguous segmentation of distributed regional search be published on the node in the distributed regional search network, make when searching can final route to node in the comparison of the value of searching and interval value, realized preserving under the situation of directory information of shared resource of node need not LIST SERVER, carry out the distributed regional search on distributed regional search network, reduce overhead, improved the reliability and the fail safe of system.
Through the above description of the embodiments, those skilled in the art can be well understood to the present invention and can realize by the mode that software adds essential general hardware platform, can certainly pass through hardware, but the former is better execution mode under a lot of situation.Based on such understanding, the part that technical scheme of the present invention contributes to prior art in essence in other words can embody with the form of software product, this computer software product is stored in the storage medium, comprise that some instructions are with so that a computer equipment (can be a personal computer, server, the perhaps network equipment etc.) carry out the described method of each embodiment of the present invention.
The above only is embodiments 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 (16)

1、一种分布式区域查找区间的发布方法，其特征在于，包括以下步骤：1. A method for releasing a distributed area search interval, comprising the following steps: 根据分布式区域查找区间的上限和节点的节点标识，在分布式区域查找网络中选择待发布节点；According to the upper limit of the distributed area search interval and the node ID of the node, select the node to be published in the distributed area search network; 向所述待发布节点发布所述分布式区域查找区间；Publishing the distributed area search interval to the node to be released; 向所述待发布节点的邻居节点发布所述分布式区域查找区间。Publishing the distributed area search interval to neighbor nodes of the node to be released. 2、如权利要求1所述分布式区域查找区间的发布方法，其特征在于，所述选择待发布节点具体包括：2. The publishing method of the distributed area search interval according to claim 1, wherein the selection of nodes to be published specifically includes: 如果所述节点的节点标识大于或等于所述分布式区域查找区间的上限，且所述节点的前续节点的节点标识小于所述分布式区域查找区间的上限，则所述节点为待发布节点。If the node ID of the node is greater than or equal to the upper limit of the distributed area search interval, and the node ID of the node's predecessor node is less than the upper limit of the distributed area search interval, the node is a node to be published . 3、如权利要求1所述分布式区域查找区间的发布方法，其特征在于，在所述向待发布节点的邻居节点发布分布式区域查找区间之前，还包括：3. The publishing method of the distributed area search interval according to claim 1, characterized in that, before releasing the distributed area search interval to the neighbor nodes of the node to be released, further comprising: 判断所述待发布节点的节点标识是否小于所述分布式区域查找区间的下限，如果是，则继续发布所述分布式区域查找区间。Judging whether the node ID of the node to be released is smaller than the lower limit of the distributed area search interval, if yes, continue to release the distributed area search interval. 4、如权利要求1或3所述分布式区域查找区间的发布方法，其特征在于，所述向待发布节点的邻居节点发布分布式区域查找区间，具体包括：4. The publishing method of the distributed area search interval according to claim 1 or 3, wherein the publishing of the distributed area search interval to the neighbor nodes of the node to be released includes: 区间发布节点从所述待发布节点获取所述待发布节点的邻居节点的地址；The interval publishing node obtains the address of the neighbor node of the node to be published from the node to be published; 区间发布节点根据所述待发布节点的邻居节点的地址，将大于所述待发布节点的节点标识的值发布到所述待发布节点的邻居节点。The interval publishing node publishes a value greater than the node identifier of the node to be published to the neighbor nodes of the node to be published according to the address of the neighbor node of the node to be published. 5、如权利要求1或3所述分布式区域查找区间的发布方法，其特征在于，所述向待发布节点的邻居节点发布分布式区域查找区间，具体包括：5. The publishing method of the distributed area search interval according to claim 1 or 3, wherein the publishing of the distributed area search interval to the neighbor nodes of the node to be released includes: 所述待发布节点将大于所述待发布节点的节点标识的值发布到所述待发布节点的邻居节点。The to-be-published node publishes a value greater than the node identifier of the to-be-published node to neighbor nodes of the to-be-published node. 6、如权利要求1所述分布式区域查找区间的发布方法，其特征在于，如果有节点加入所述分布式区域查找网络，则待加入节点的邻居节点将分布式区域查找区间上限小于或等于待加入节点的节点标识的分布式区域查找区间发布到所述待加入节点，且所述邻居节点的分布式区域查找区间修改为上限为所述待加入节点的节点标识的左开右闭区间。6. The publishing method of the distributed area search interval according to claim 1, wherein if a node joins the distributed area search network, the neighbor nodes of the node to be added set the upper limit of the distributed area search interval to be less than or equal to The distributed area search interval of the node ID of the node to join is released to the node to join, and the distributed area search interval of the neighbor node is modified to a left-open right-closed interval whose upper limit is the node ID of the node to join. 7、如权利要求1所述分布式区域查找区间的发布方法，其特征在于，如果有节点离开所述分布式区域查找网络，则待离开节点将保存的分布式区域查找区间发布到所述待离开节点的邻居节点。7. The publishing method of the distributed area search interval according to claim 1, wherein if a node leaves the distributed area search network, the node to leave publishes the stored distributed area search interval to the waiting Neighbors of the leaving node. 8、一种分布式区域的查找方法，其特征在于，包括以下步骤：8. A search method for a distributed area, comprising the following steps: 根据查找值和节点的节点标识，在分布式区域查找网络中获取待查找节点；According to the search value and the node identification of the node, the node to be searched is obtained in the distributed area search network; 根据所述查找值和所述待查找节点保存的分布式区域查找区间的上限，获取覆盖所述查找值的区间。Acquiring an interval covering the search value according to the search value and the upper limit of the search interval in the distributed area saved by the node to be searched. 9、如权利要求8所述分布式区域的查找方法，其特征在于，所述获取待查找节点的过程具体包括：9. The search method for a distributed area according to claim 8, wherein the process of obtaining nodes to be searched specifically includes: 如果所述查找值小于或等于节点的节点标识，且到所述节点的节点标识的距离最小，则所述节点为待查找节点。If the search value is less than or equal to the node identifier of the node and the distance to the node identifier of the node is the smallest, then the node is the node to be searched. 10、如权利要求8或9所述分布式区域的查找方法，其特征在于，所述获取覆盖查找值的区间具体包括：10. The search method for a distributed area according to claim 8 or 9, wherein the interval for obtaining the coverage search value specifically includes: 如果所述查找值大于所述待查找节点保存的分布式区域查找区间的上限，则所述查找区间为所述覆盖查找值的区间。If the search value is greater than the upper limit of the search interval of the distributed area saved by the node to be searched, the search interval is an interval covering the search value. 11、一种分布式区域查找网络，其特征在于，所述网络中节点的最小节点标识到最大节点标识之间的范围，对应由业务特性决定的待查找区域的最大范围。11. A distributed area search network, characterized in that the range from the smallest node ID to the largest node ID of nodes in the network corresponds to the maximum range of the area to be searched determined by service characteristics. 12、如权利要求11所述分布式区域查找网络，其特征在于，所述网络中节点保存的分布式区域查找区间的上限小于或等于所述节点的节点标识，且大于所述节点的前续节点的节点标识。12. The distributed area search network according to claim 11, wherein the upper limit of the distributed area search interval saved by the nodes in the network is less than or equal to the node identifier of the node, and greater than the previous node ID of the node. The node ID of the node. 13、如权利要求11或12所述分布式区域查找网络，其特征在于，如果有节点加入所述分布式区域查找网络，则待加入节点保存的分布式区域查找区间为所述待加入节点加入前所述待加入节点的邻居节点保存的查找区间上限小于或等于所述待加入节点的节点标识的查找区间；所述待加入节点的邻居节点在所述待加入节点加入后保存的分布式区域查找区间为上限为所述待加入节点的节点标识的左开右闭区间。13. The distributed area search network according to claim 11 or 12, characterized in that, if a node joins the distributed area search network, the distributed area search interval saved by the node to be added is the node to join The upper limit of the search interval saved by the neighbor nodes of the node to be added is less than or equal to the search interval of the node identifier of the node to be added; the distributed area saved by the neighbor nodes of the node to be added after the node to be joined is The search interval is a left-open right-close interval whose upper limit is the node identifier of the node to be added. 14、如权利要求11或12所述分布式区域查找网络，其特征在于，如果有节点离开所述分布式区域查找网络，则待离开节点的邻居节点保存的分布式区域查找区间为所述待离开节点保存的查找区间。14. The distributed area search network according to claim 11 or 12, wherein if a node leaves the distributed area search network, the distributed area search interval saved by the neighbor node of the node to be left is the Leave the lookup interval saved by the node. 15、一种节点，其特征在于，包括待发布节点选择单元和发布单元；15. A node, characterized in that it includes a node selection unit to be published and a publishing unit; 所述待发布节点选择单元，用于根据分布式区域查找区间的上限和节点的节点标识，在分布式区域查找网络中选择待发布节点，并将选择结果发送到所述发布单元；The node selection unit to be published is configured to select a node to be published in the distributed area search network according to the upper limit of the distributed area search interval and the node identifier of the node, and send the selection result to the release unit; 所述发布单元，用于向所述分布式区域查找网络中的节点发布所述分布式区域查找区间。The issuing unit is configured to issue the distributed area search interval to nodes in the distributed area search network. 16、如权利要求15所述的节点，其特征在于，还包括判断单元，用于判断是否继续发布所述分布式区域查找区间，并将判断结果发送到所述发布单元。16. The node according to claim 15, further comprising a judging unit, configured to judge whether to continue publishing the distributed area search interval, and send the judging result to the publishing unit.
CNA2007101627053A 2007-09-27 2007-09-27 Publishing method and device for distributed region lookup zone Pending CN101399688A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNA2007101627053A CN101399688A (en) 2007-09-27 2007-09-27 Publishing method and device for distributed region lookup zone

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNA2007101627053A CN101399688A (en) 2007-09-27 2007-09-27 Publishing method and device for distributed region lookup zone

Publications (1)

Publication Number Publication Date
CN101399688A true CN101399688A (en) 2009-04-01

Family

ID=40517968

Family Applications (1)

Application Number Title Priority Date Filing Date
CNA2007101627053A Pending CN101399688A (en) 2007-09-27 2007-09-27 Publishing method and device for distributed region lookup zone

Country Status (1)

Country Link
CN (1) CN101399688A (en)

Cited By (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105052090A (en) * 2013-03-15 2015-11-11 思科技术公司 Seamless segment routing
US9749227B2 (en) 2012-10-05 2017-08-29 Cisco Technology, Inc. MPLS segment-routing
US10063475B2 (en) 2014-03-06 2018-08-28 Cisco Technology, Inc. Segment routing extension headers
US10122614B2 (en) 2015-02-26 2018-11-06 Cisco Technology, Inc. Failure protection for traffic-engineered bit indexed explicit replication
US10178022B2 (en) 2014-07-17 2019-01-08 Cisco Technology, Inc. Segment routing using a remote forwarding adjacency identifier
US10212076B1 (en) 2012-12-27 2019-02-19 Sitting Man, Llc Routing methods, systems, and computer program products for mapping a node-scope specific identifier
US10263881B2 (en) 2016-05-26 2019-04-16 Cisco Technology, Inc. Enforcing strict shortest path forwarding using strict segment identifiers
US10367737B1 (en) 2012-12-27 2019-07-30 Sitting Man, Llc Routing methods, systems, and computer program products
US10374938B1 (en) 2012-12-27 2019-08-06 Sitting Man, Llc Routing methods, systems, and computer program products
US10397101B1 (en) 2012-12-27 2019-08-27 Sitting Man, Llc Routing methods, systems, and computer program products for mapping identifiers
US10397100B1 (en) 2012-12-27 2019-08-27 Sitting Man, Llc Routing methods, systems, and computer program products using a region scoped outside-scope identifier
US10404583B1 (en) 2012-12-27 2019-09-03 Sitting Man, Llc Routing methods, systems, and computer program products using multiple outside-scope identifiers
US10404582B1 (en) 2012-12-27 2019-09-03 Sitting Man, Llc Routing methods, systems, and computer program products using an outside-scope indentifier
US10411998B1 (en) 2012-12-27 2019-09-10 Sitting Man, Llc Node scope-specific outside-scope identifier-equipped routing methods, systems, and computer program products
US10411997B1 (en) 2012-12-27 2019-09-10 Sitting Man, Llc Routing methods, systems, and computer program products for using a region scoped node identifier
US10419335B1 (en) 2012-12-27 2019-09-17 Sitting Man, Llc Region scope-specific outside-scope indentifier-equipped routing methods, systems, and computer program products
US10419334B1 (en) 2012-12-27 2019-09-17 Sitting Man, Llc Internet protocol routing methods, systems, and computer program products
US10447575B1 (en) 2012-12-27 2019-10-15 Sitting Man, Llc Routing methods, systems, and computer program products
US10476787B1 (en) 2012-12-27 2019-11-12 Sitting Man, Llc Routing methods, systems, and computer program products
US10587505B1 (en) 2012-12-27 2020-03-10 Sitting Man, Llc Routing methods, systems, and computer program products
US11722404B2 (en) 2019-09-24 2023-08-08 Cisco Technology, Inc. Communicating packets across multi-domain networks using compact forwarding instructions

Cited By (71)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10469370B2 (en) 2012-10-05 2019-11-05 Cisco Technology, Inc. Segment routing techniques
US9929946B2 (en) 2012-10-05 2018-03-27 Cisco Technology, Inc. Segment routing techniques
US10218610B2 (en) 2012-10-05 2019-02-26 Cisco Technology, Inc. MPLS segment routing
US9749227B2 (en) 2012-10-05 2017-08-29 Cisco Technology, Inc. MPLS segment-routing
US10498642B1 (en) 2012-12-27 2019-12-03 Sitting Man, Llc Routing methods, systems, and computer program products
US10841198B1 (en) 2012-12-27 2020-11-17 Sitting Man, Llc Routing methods, systems, and computer program products
US12058042B1 (en) 2012-12-27 2024-08-06 Morris Routing Technologies, Llc Routing methods, systems, and computer program products
US11784914B1 (en) 2012-12-27 2023-10-10 Morris Routing Technologies, Llc Routing methods, systems, and computer program products
US11196660B1 (en) 2012-12-27 2021-12-07 Sitting Man, Llc Routing methods, systems, and computer program products
US11012344B1 (en) 2012-12-27 2021-05-18 Sitting Man, Llc Routing methods, systems, and computer program products
US10862791B1 (en) 2012-12-27 2020-12-08 Sitting Man, Llc DNS methods, systems, and computer program products
US10587505B1 (en) 2012-12-27 2020-03-10 Sitting Man, Llc Routing methods, systems, and computer program products
US10805204B1 (en) 2012-12-27 2020-10-13 Sitting Man, Llc Routing methods, systems, and computer program products
US10785143B1 (en) 2012-12-27 2020-09-22 Sitting Man, Llc Routing methods, systems, and computer program products
US10764171B1 (en) 2012-12-27 2020-09-01 Sitting Man, Llc Routing methods, systems, and computer program products
US10367737B1 (en) 2012-12-27 2019-07-30 Sitting Man, Llc Routing methods, systems, and computer program products
US10374938B1 (en) 2012-12-27 2019-08-06 Sitting Man, Llc Routing methods, systems, and computer program products
US10382327B1 (en) 2012-12-27 2019-08-13 Sitting Man, Llc Methods, systems, and computer program products for routing using headers including a sequence of node scope-specific identifiers
US10757010B1 (en) 2012-12-27 2020-08-25 Sitting Man, Llc Routing methods, systems, and computer program products
US10389624B1 (en) 2012-12-27 2019-08-20 Sitting Man, Llc Scoped identifier space routing methods, systems, and computer program products
US10389625B1 (en) 2012-12-27 2019-08-20 Sitting Man, Llc Routing methods, systems, and computer program products for using specific identifiers to transmit data
US10594594B1 (en) 2012-12-27 2020-03-17 Sitting Man, Llc Routing methods, systems, and computer program products
US10397100B1 (en) 2012-12-27 2019-08-27 Sitting Man, Llc Routing methods, systems, and computer program products using a region scoped outside-scope identifier
US10404583B1 (en) 2012-12-27 2019-09-03 Sitting Man, Llc Routing methods, systems, and computer program products using multiple outside-scope identifiers
US10404582B1 (en) 2012-12-27 2019-09-03 Sitting Man, Llc Routing methods, systems, and computer program products using an outside-scope indentifier
US10411998B1 (en) 2012-12-27 2019-09-10 Sitting Man, Llc Node scope-specific outside-scope identifier-equipped routing methods, systems, and computer program products
US10411997B1 (en) 2012-12-27 2019-09-10 Sitting Man, Llc Routing methods, systems, and computer program products for using a region scoped node identifier
US10419335B1 (en) 2012-12-27 2019-09-17 Sitting Man, Llc Region scope-specific outside-scope indentifier-equipped routing methods, systems, and computer program products
US10419334B1 (en) 2012-12-27 2019-09-17 Sitting Man, Llc Internet protocol routing methods, systems, and computer program products
US10447575B1 (en) 2012-12-27 2019-10-15 Sitting Man, Llc Routing methods, systems, and computer program products
US10757020B2 (en) 2012-12-27 2020-08-25 Sitting Man, Llc Routing methods, systems, and computer program products
US10735306B1 (en) 2012-12-27 2020-08-04 Sitting Man, Llc Routing methods, systems, and computer program products
US10476787B1 (en) 2012-12-27 2019-11-12 Sitting Man, Llc Routing methods, systems, and computer program products
US10476788B1 (en) 2012-12-27 2019-11-12 Sitting Man, Llc Outside-scope identifier-equipped routing methods, systems, and computer program products
US10212076B1 (en) 2012-12-27 2019-02-19 Sitting Man, Llc Routing methods, systems, and computer program products for mapping a node-scope specific identifier
US10574562B1 (en) 2012-12-27 2020-02-25 Sitting Man, Llc Routing methods, systems, and computer program products
US10721164B1 (en) 2012-12-27 2020-07-21 Sitting Man, Llc Routing methods, systems, and computer program products with multiple sequences of identifiers
US10708168B1 (en) 2012-12-27 2020-07-07 Sitting Man, Llc Routing methods, systems, and computer program products
US10397101B1 (en) 2012-12-27 2019-08-27 Sitting Man, Llc Routing methods, systems, and computer program products for mapping identifiers
US10652150B1 (en) 2012-12-27 2020-05-12 Sitting Man, Llc Routing methods, systems, and computer program products
US10652133B1 (en) 2012-12-27 2020-05-12 Sitting Man, Llc Routing methods, systems, and computer program products
US10652134B1 (en) 2012-12-27 2020-05-12 Sitting Man, Llc Routing methods, systems, and computer program products
US11290340B2 (en) 2013-03-15 2022-03-29 Cisco Technology, Inc. Segment routing over label distribution protocol
US9979601B2 (en) 2013-03-15 2018-05-22 Cisco Technology, Inc. Encoding explicit paths as segment routing segment lists
CN105052090B (en) * 2013-03-15 2018-03-27 思科技术公司 The method and device of seamless Segment routing
US10469325B2 (en) 2013-03-15 2019-11-05 Cisco Technology, Inc. Segment routing: PCE driven dynamic setup of forwarding adjacencies and explicit path
US10164838B2 (en) 2013-03-15 2018-12-25 Cisco Technology, Inc. Seamless segment routing
CN105052090A (en) * 2013-03-15 2015-11-11 思科技术公司 Seamless segment routing
US11784889B2 (en) 2013-03-15 2023-10-10 Cisco Technology, Inc. Segment routing over label distribution protocol
US10764146B2 (en) 2013-03-15 2020-09-01 Cisco Technology, Inc. Segment routing over label distribution protocol
US11689427B2 (en) 2013-03-15 2023-06-27 Cisco Technology, Inc. Segment routing over label distribution protocol
US11424987B2 (en) 2013-03-15 2022-08-23 Cisco Technology, Inc. Segment routing: PCE driven dynamic setup of forwarding adjacencies and explicit path
US10270664B2 (en) 2013-03-15 2019-04-23 Cisco Technology, Inc. Segment routing over label distribution protocol
US11374863B2 (en) 2014-03-06 2022-06-28 Cisco Technology, Inc. Segment routing extension headers
US10382334B2 (en) 2014-03-06 2019-08-13 Cisco Technology, Inc. Segment routing extension headers
US11336574B2 (en) 2014-03-06 2022-05-17 Cisco Technology, Inc. Segment routing extension headers
US10063475B2 (en) 2014-03-06 2018-08-28 Cisco Technology, Inc. Segment routing extension headers
US10601707B2 (en) 2014-07-17 2020-03-24 Cisco Technology, Inc. Segment routing using a remote forwarding adjacency identifier
US10178022B2 (en) 2014-07-17 2019-01-08 Cisco Technology, Inc. Segment routing using a remote forwarding adjacency identifier
US10341222B2 (en) 2015-02-26 2019-07-02 Cisco Technology, Inc. Traffic engineering for bit indexed explicit replication
US10693765B2 (en) 2015-02-26 2020-06-23 Cisco Technology, Inc. Failure protection for traffic-engineered bit indexed explicit replication
US10958566B2 (en) 2015-02-26 2021-03-23 Cisco Technology, Inc. Traffic engineering for bit indexed explicit replication
US10122614B2 (en) 2015-02-26 2018-11-06 Cisco Technology, Inc. Failure protection for traffic-engineered bit indexed explicit replication
US10341221B2 (en) 2015-02-26 2019-07-02 Cisco Technology, Inc. Traffic engineering for bit indexed explicit replication
US10263881B2 (en) 2016-05-26 2019-04-16 Cisco Technology, Inc. Enforcing strict shortest path forwarding using strict segment identifiers
US11671346B2 (en) 2016-05-26 2023-06-06 Cisco Technology, Inc. Enforcing strict shortest path forwarding using strict segment identifiers
US11323356B2 (en) 2016-05-26 2022-05-03 Cisco Technology, Inc. Enforcing strict shortest path forwarding using strict segment identifiers
US10742537B2 (en) 2016-05-26 2020-08-11 Cisco Technology, Inc. Enforcing strict shortest path forwarding using strict segment identifiers
US11489756B2 (en) 2016-05-26 2022-11-01 Cisco Technology, Inc. Enforcing strict shortest path forwarding using strict segment identifiers
US11722404B2 (en) 2019-09-24 2023-08-08 Cisco Technology, Inc. Communicating packets across multi-domain networks using compact forwarding instructions
US11855884B2 (en) 2019-09-24 2023-12-26 Cisco Technology, Inc. Communicating packets across multi-domain networks using compact forwarding instructions

Similar Documents

Publication Publication Date Title
CN101399688A (en) Publishing method and device for distributed region lookup zone
CN108833468B (en) Video processing method, device, equipment and medium based on mobile edge calculation
JP4277918B2 (en) Data search device, data search method, and data search program
KR101942566B1 (en) Method for transmitting and caching information data in secure surveilance network, recordable medium, apparatus for caching information data in secure surveilance network, and secure surveilance network system
Scherb et al. Resolution strategies for networking the IoT at the edge via named functions
US20110099226A1 (en) Method of requesting for location information of resources on network, user node and server for the same
EP2612487B1 (en) Method and arrangement in a peer-to-peer network
CN103067521B (en) Node in a kind of distributed reptile cluster and system
CN108337170B (en) Distributed resource searching method and system
CN100534059C (en) A Method for Optimizing Routing in Tree Topology Overlay Networks
CN102891872B (en) The method and system of data storage and query in a kind of peer-to-peer network
US20120317275A1 (en) Methods and devices for node distribution
CN103107944B (en) A kind of content positioning method and routing device
CN104380289A (en) Service-aware distributed hash table routing
CN109495565A (en) High concurrent service request processing method and equipment based on distributed ubiquitous computation
CN113347212B (en) Trusted service scheduling method, device, equipment and storage medium based on block chain
CN101267449B (en) A tree structure P2P system resource transmission method based on mobile agent mechanism
US11606415B2 (en) Method, apparatus and system for processing an access request in a content delivery system
CN101753567A (en) Resource sharing method for operation business actively participating peer-to-peer network
CN100474809C (en) File transfer method and apparatus
CN101916291B (en) A method for crawling eDonkey network shared files and client information
Hsieh et al. KMSSA optimization algorithm for bandwidth allocation in internet of vehicles based on edge computing
CN101770500B (en) Data transfer method, data transfer device, data searching method and data searching device
Barjini et al. HybridFlood: minimizing the effects of redundant messages and maximizing search efficiency of unstructured peer-to-peer networks
CN101521655A (en) Method for searching and releasing information, system and synonymy node clustering method and device therefor

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Open date: 20090401