CN101399688A - Publishing method and device for distributed region lookup zone - Google Patents
Publishing method and device for distributed region lookup zone Download PDFInfo
- 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
- regional search
- interval
- distributed
- released
- 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
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses an issue method of a distribution-typed region searching range, which comprises the steps as follows: according to the upper limit of the distribution-typed region searching range and the node identification of the node, nodes to be issued are selected in the distribution-typed region searching network; the distribution-typed region searching range is issued to the nodes to be issued; the distribution-typed region searching range is issued to the neighborhood nodes of the nodes to be issued. The invention also discloses a searching method used for the distribution-typed region, a distribution-typed region searching network and a node. The distribution-typed region searching range carries out the distribution-typed issuance by continuous section on the distribution-typed region searching network, and compares the searching value with the range value in the nodes reached by a final route during the searching process, and achieves the object that the distribution-typed region searching on the distribution-typed region searching network is carried out without saving the content information of the share resource of the nodes by a content server; therefore, the system expense is reduced, and the reliability and the safety of the system are improved.
Description
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, the dissemination method in a kind of distributed regional search interval is characterized in that, may further comprise the steps:
According to the upper limit in distributed regional search interval and the node identification of node, in distributed regional search network, select node to be released;
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.
2, the dissemination method in distributed according to claim 1 regional search interval is characterized in that described selection node to be released specifically comprises:
If the node identification of described node is more than or equal to the upper limit in described distributed regional search interval, and the node identification of the preceding continuous node of described node is less than the upper limit in described distributed regional search interval, and then described node is a node to be released.
3, the dissemination method in distributed according to claim 1 regional search interval is characterized in that, before described neighbor node to node to be released is issued distributed regional search interval, also comprises:
Whether the node identification of judging described node to be released is less than the lower limit in described distributed regional search interval, if then continue the described distributed regional search of issue interval.
4, as the dissemination method in distributed regional search interval as described in claim 1 or 3, it is characterized in that described neighbor node to node to be released is issued distributed regional search interval, specifically comprises:
Interval publisher node is from address that described node to be released obtains the neighbor node of described node to be released;
Interval publisher node is according to the address of the neighbor node of described node to be released, will be published to the neighbor node of described node to be released greater than the value of the node identification of described node to be released.
5, as the dissemination method in distributed regional search interval as described in claim 1 or 3, it is characterized in that described neighbor node to node to be released is issued distributed regional search interval, specifically comprises:
Described node to be released will be published to the neighbor node of described node to be released greater than the value of the node identification of described node to be released.
6, the dissemination method in distributed according to claim 1 regional search interval, it is characterized in that, if there is node to add described distributed regional search network, then the neighbor 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 neighbor node.
7, the dissemination method in distributed according to claim 1 regional search interval, it is characterized in that, if there is node to leave described distributed regional search network, the distributed regional search interval that node then to be left will be preserved is published to the described neighbor node of waiting to leave node.
8, a kind of lookup method of distributed zone is characterized in that, may further comprise the steps:
Node identification according to the value of searching and node obtains 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.
9, as the lookup method in distributed zone as described in the claim 8, it is characterized in that the described process of obtaining node to be found specifically comprises:
If the described value of searching is less than or equal to the node identification of node, and minimum to the distance of the node identification of described node, then described node is a node to be found.
As the lookup method in distributed zone as described in claim 8 or 9, it is characterized in that 10, the described interval that covers the value of searching that obtains specifically comprises:
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.
11, a kind of distributed regional search network is characterized in that, 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.
As distributed regional search network as described in the claim 11, it is characterized in that 12, the upper limit in the distributed regional search interval that node is preserved in the described 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.
13, as distributed regional search network as described in claim 11 or 12, it is characterized in that, if there is node to add described 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 described node to be added between the seek area that the neighbor node of described node to be added was preserved before described node to be added added; The neighbor node of described node to be added is limited to the left side of the node identification of described node to be added and opens interval closed at the right on the distributed regional search interval of described node adding back preservation to be added is.
14, as distributed regional search network as described in claim 11 or 12, it is characterized in that, if there is node to leave described distributed regional search network, wait then to leave that distributed regional search that the neighbor node of node preserves is interval waits to leave between the seek area that node preserves for described.
15, a kind of node is characterized in that, 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.
16, node as claimed in claim 15 is characterized in that, also comprises judging unit, is used to judge whether continue the described distributed regional search of issue interval, and judged result is sent to described release unit.
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)
| 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 |
| 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 |
| US10397101B1 (en) | 2012-12-27 | 2019-08-27 | Sitting Man, Llc | Routing methods, systems, and computer program products for mapping identifiers |
| 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 |
| 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 |
| 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 |
| US10419334B1 (en) | 2012-12-27 | 2019-09-17 | Sitting Man, Llc | Internet protocol routing methods, systems, and computer program products |
| 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 |
| 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 |
-
2007
- 2007-09-27 CN CNA2007101627053A patent/CN101399688A/en active Pending
Cited By (71)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| 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 |
| US10498642B1 (en) | 2012-12-27 | 2019-12-03 | 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 |
| 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 |
| 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 |
| US11012344B1 (en) | 2012-12-27 | 2021-05-18 | 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 |
| US10862791B1 (en) | 2012-12-27 | 2020-12-08 | Sitting Man, Llc | DNS methods, systems, and computer program products |
| US10841198B1 (en) | 2012-12-27 | 2020-11-17 | 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 |
| 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 |
| US10594594B1 (en) | 2012-12-27 | 2020-03-17 | 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 |
| 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 |
| US10389624B1 (en) | 2012-12-27 | 2019-08-20 | Sitting Man, Llc | Scoped identifier space 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 |
| US10397101B1 (en) | 2012-12-27 | 2019-08-27 | Sitting Man, Llc | Routing methods, systems, and computer program products for mapping identifiers |
| 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 |
| 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 |
| 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 |
| US10419334B1 (en) | 2012-12-27 | 2019-09-17 | Sitting Man, Llc | Internet protocol routing methods, systems, and computer program products |
| 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 |
| US10447575B1 (en) | 2012-12-27 | 2019-10-15 | Sitting Man, Llc | Routing methods, systems, and computer program products |
| US10757010B1 (en) | 2012-12-27 | 2020-08-25 | 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 |
| 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 |
| US10735306B1 (en) | 2012-12-27 | 2020-08-04 | Sitting Man, Llc | Routing methods, systems, and computer program products |
| 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 |
| 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 |
| US10708168B1 (en) | 2012-12-27 | 2020-07-07 | Sitting Man, Llc | Routing methods, systems, and computer program products |
| US10652150B1 (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 |
| US10652133B1 (en) | 2012-12-27 | 2020-05-12 | Sitting Man, Llc | Routing methods, systems, and computer program products |
| US10469325B2 (en) | 2013-03-15 | 2019-11-05 | Cisco Technology, Inc. | Segment routing: PCE driven dynamic setup of forwarding adjacencies and explicit path |
| US10764146B2 (en) | 2013-03-15 | 2020-09-01 | Cisco Technology, Inc. | Segment routing over label distribution protocol |
| US11784889B2 (en) | 2013-03-15 | 2023-10-10 | Cisco Technology, Inc. | Segment routing over label distribution protocol |
| CN105052090A (en) * | 2013-03-15 | 2015-11-11 | 思科技术公司 | Seamless segment routing |
| US10164838B2 (en) | 2013-03-15 | 2018-12-25 | Cisco Technology, Inc. | Seamless segment routing |
| CN105052090B (en) * | 2013-03-15 | 2018-03-27 | 思科技术公司 | The method and device of seamless Segment routing |
| US9979601B2 (en) | 2013-03-15 | 2018-05-22 | Cisco Technology, Inc. | Encoding explicit paths as segment routing segment lists |
| US11689427B2 (en) | 2013-03-15 | 2023-06-27 | Cisco Technology, Inc. | Segment routing over label distribution protocol |
| US11290340B2 (en) | 2013-03-15 | 2022-03-29 | Cisco Technology, Inc. | Segment routing over label distribution protocol |
| US10270664B2 (en) | 2013-03-15 | 2019-04-23 | 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 |
| 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 |
| 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 |
| US10341222B2 (en) | 2015-02-26 | 2019-07-02 | Cisco Technology, Inc. | Traffic engineering for bit indexed explicit replication |
| US10341221B2 (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 |
| US11671346B2 (en) | 2016-05-26 | 2023-06-06 | 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 |
| US10742537B2 (en) | 2016-05-26 | 2020-08-11 | Cisco Technology, Inc. | Enforcing strict shortest path forwarding using strict segment identifiers |
| US10263881B2 (en) | 2016-05-26 | 2019-04-16 | 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 |
| 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 | |
| CN107317879B (en) | A kind of distribution method and system of user's request | |
| CN103067521B (en) | Node in a kind of distributed reptile cluster and system | |
| CN104618506A (en) | Crowd-sourced content delivery network system, method and device | |
| Scherb et al. | Resolution strategies for networking the IoT at the edge via named functions | |
| CN109151824B (en) | Library data service expansion system and method based on 5G architecture | |
| CN102779308A (en) | Advertisement release method and system | |
| CN103107944B (en) | A kind of content positioning method and routing device | |
| CN101626392A (en) | Methods and systems for storing and searching data | |
| US20120317275A1 (en) | Methods and devices for node distribution | |
| CN116166690A (en) | Mixed vector retrieval method and device for high concurrency scene | |
| CN104376014B (en) | Resource issue and querying method in a kind of structured P 2 P network | |
| CN107562803A (en) | Data supply system and method, terminal | |
| CN111324429A (en) | Micro-service combination scheduling method based on multi-generation ancestry reference distance | |
| US11606415B2 (en) | Method, apparatus and system for processing an access request in a content delivery system | |
| RU2760243C2 (en) | System and method for improving request for creating distributed group of resources based on time delay | |
| CN110930092B (en) | Distribution route adjusting method and device, electronic equipment and storage medium | |
| KR20160081231A (en) | Method and system for extracting image feature based on map-reduce for searching image | |
| CN101917475B (en) | P2P (Peer-to-Peer) mode based PSRD (Program Support Requirements Document) universal service resource discovery method | |
| Xia et al. | Distributed resource management and admission control of stream processing systems with max utility | |
| CN111600929A (en) | Transmission line detection method, route strategy generation method and proxy server | |
| Podnar et al. | Beyond term indexing: A P2P framework for web information retrieval | |
| CN103491128A (en) | Optimal placement method for popular resource duplicates in peer-to-peer network | |
| CN101521655A (en) | Method for searching and releasing information, system and synonymy node clustering method and device therefor | |
| CN106202303A (en) | A kind of Chord routing table compression method and optimization file search method |
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 |