US6498795B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for active information discovery and retrieval
Assignee: NEC Corp
•
Filing: 1999-05-28
•
Granted: 2002-12-24
•
Expires: 2019-05-28
Abstract
Abstract The present invention is built upon an active network framework and an ontology-based information hierarchy, and, in addition to the features found in current network models, it provides a symmetrical framework for information filtering and binding in the network. Queries from information requesters are directly routed to relevant information sources and contents from information providers are distributed to the destinations that expressed an interest in the information. The query packets and content packets can carry commands that are executed at the active network nodes encountered by the packets as they traverse the network.
Inventors
- 👤 Junbiao Zhang
- 👤 Maximilian Ott
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 05:17
CPC Classifications
H; H04; H04L; H04L67/00; H04L67/01; H04L67/10; G; G06; G06F; G06F16/00; G06F16/90; G06F16/95; G06F16/951; H04L9/00; H04L9/40; H04L69/00; H04L69/30; H04L69/32; H04L69/322; H04L69/329
Claims Analysis
Total Claims: 60
Claim 1
Independent Claim
324 words
A method of information routing, comprising: providing a plurality of information provider nodes, each having a plurality of stored information thereon; providing a plurality of information requestor nodes; providing a plurality of active network nodes and connecting each active network node to a subset of said plurality of information provider nodes, a subset of said plurality of information requester nodes and a subset of said plurality of said active network nodes; creating at least one content ontology instance tree and at least one query ontology instance tree on each of said plurality of active network nodes; injecting information content packets, each of said information content packets containing content data and content routing data to said plurality of stored information located on the information provider node that injected said information content packet; modifying said at least one content ontology instance tree at active network nodes traversed by said information content packets by inserting content data and content routing data contained within said information content packets in a branch of said at least one content ontology instance tree; injecting information query packets, each of said information query packets containing query data and query routing data to the information requester node that injected said information query packet; modifying said at least one query ontology instance tree at active network nodes traversed by said information query packets by inserting query data and query routing data contained within said information query packets into a branch of said at least one query ontology instance tree; and establishing an information route between at least one information requester node and at least one information provider node, said information route created after said information query packets search said at least one content ontology instance tree at each active network node traversed, thereby reaching an information provider node, or said information content packets search said at least one query ontology instance tree at each active network node traversed, thereby reaching an information requester node.
Claim 2
Independent Claim
324 words
A method of information routing, comprising: providing a plurality of information provider nodes, each having a plurality of stored information thereon; providing a plurality of information requestor nodes; providing a plurality of active network nodes and connecting each active network node to a subset of said plurality of information provider nodes, a subset of said plurality of information requester nodes and a subset of said plurality of said active network nodes; creating at least one content ontology instance tree and at least one query ontology instance tree on each of said plurality of active network nodes; injecting information content packets, each of said information content packets containing content data and content routing data to said plurality of stored information located on the information provider node that injected said information content packet; modifying said at least one content ontology instance tree at active network nodes traversed by said information content packets by inserting content data and content routing data contained within said information content packets in a branch of said at least one content ontology instance tree; injecting information query packets, each of said information query packets containing query data and query routing data to the information requester node that injected said information query packet; modifying said at least one query ontology instance tree at active network nodes traversed by said information query packets by inserting query data and query routing data contained within said information query packets into a branch of said at least one query ontology instance tree; and establishing an information route between at least one information requester node and at least one information provider node, said information route created after said information query packets search said at least one content ontology instance tree at each active network node traversed, thereby reaching an information provider node, or said information content packets search said at least one query ontology instance tree at each active network node traversed, thereby reaching an information requester node.
Claim 3
Dependent Claim
27 words
The method as set forth in claim 1 , wherein connecting each active network node includes building a routing tree for said plurality of active network nodes.
Claim 4
Dependent Claim
37 words
The method as set forth in claim 2 , wherein building a routing tree includes performing a depth first search to prevent the formation of loops between the individual nodes of said plurality of active network nodes.
Claim 5
Dependent Claim
38 words
The method as set forth in claim 1 , wherein modifying content ontology instance trees includes assigning confidence levels to nodes within said content ontology instance trees based upon said content data inserted by said information content packets.
Claim 6
Dependent Claim
34 words
The method as set forth in claim 4 , wherein modifying content ontology instance trees includes pruning of said branches of said content ontology instance trees based upon the confidence level of said nodes.
Claim 7
Dependent Claim
38 words
The method as set forth in claim 1 , wherein modifying query ontology instance trees includes assigning confidence levels to nodes within said query ontology instance trees based upon said query data inserted by said information query packets.
Claim 8
Dependent Claim
34 words
The method as set forth in claim 4 , wherein modifying query ontology instance trees includes pruning of said branches of said query ontology instance trees based upon the confidence level of said nodes.
Claim 9
Dependent Claim
53 words
The method as set forth in claim 1 , wherein injecting the information query packet includes: adding search filters to said information query packet; adding a search interest hierarchy to said information query packet; and adding function invocations to said information query packet that are recognized by said plurality of active network nodes.
Claim 10
Dependent Claim
53 words
The method as set forth in claim 1 , wherein injecting the information content packet includes: adding search filters to said information content packet; adding a search interest hierarchy to said information content packet; and adding function invocations to said information content packet that are recognized by said plurality of active network nodes.
Claim 11
Dependent Claim
28 words
The method as set forth in claim 1 , wherein injecting said information query packet includes assigning a predetermined amount of resource credit to said information query packet.
Claim 12
Dependent Claim
28 words
The method as set forth in claim 1 , wherein injecting said information content packet includes assigning a predetermined amount of resource credit to said information content packet.
Claim 13
Independent Claim
167 words
A method of creating an information route in a plurality of active network nodes, each active node containing at least one content ontology instance tree and at least one query ontology instance tree, comprising: receiving an information content packet at one of said plurality of active network nodes, said information content packet including residual content data; updating said at least one content ontology instance tree at one of said active network nodes with said residual data from said information content packet; searching said at least one query ontology instance tree and determining the next hop for said information content packet; receiving an information query packet at one of said plurality of active network nodes, said information query packet including residual query data; updating said at least one query ontology instance tree at one of said active network nodes with said query data from said information query packet; and searching said at least one content ontology instance tree and determining the next hop for said information query packet.
Claim 14
Independent Claim
167 words
A method of creating an information route in a plurality of active network nodes, each active node containing at least one content ontology instance tree and at least one query ontology instance tree, comprising: receiving an information content packet at one of said plurality of active network nodes, said information content packet including residual content data; updating said at least one content ontology instance tree at one of said active network nodes with said residual data from said information content packet; searching said at least one query ontology instance tree and determining the next hop for said information content packet; receiving an information query packet at one of said plurality of active network nodes, said information query packet including residual query data; updating said at least one query ontology instance tree at one of said active network nodes with said query data from said information query packet; and searching said at least one content ontology instance tree and determining the next hop for said information query packet.
Claim 15
Dependent Claim
37 words
The method as set forth in claim 12 , wherein updating said at least one content ontology instance tree includes assigning confidence levels to nodes within said content ontology instance tree based upon said residual content data.
Claim 16
Dependent Claim
37 words
The method as set forth in claim 13 , wherein updating said at least one content ontology instance tree further includes pruning branches of a content ontology instance tree based upon the confidence level of said nodes.
Claim 17
Dependent Claim
27 words
The method as set forth in claim 14 , wherein a pruned content ontology instance tree is sent from one active node to neighboring active network nodes.
Claim 18
Dependent Claim
30 words
The method as set forth in claim 13 , wherein the result said information content packet search of the at least one query ontology instance tree determines the next hop.
Claim 19
Dependent Claim
37 words
The method as set forth in claim 12 , wherein updating said at least one query ontology instance tree includes assigning confidence levels to nodes within said query ontology instance tree based upon said residual query data.
Claim 20
Dependent Claim
37 words
The method as set forth in claim 17 , wherein updating said at least one query ontology instance tree further includes pruning branches of a query ontology instance tree based upon the confidence level of said nodes.
Claim 21
Dependent Claim
27 words
The method as set forth in claim 18 , wherein a pruned query ontology instance tree is sent from one active node to neighboring active network nodes.
Claim 22
Dependent Claim
30 words
The method as set forth in claim 17 , wherein result from said information query packet search of the at least one content ontology instance tree determines the next hop.
Claim 23
Dependent Claim
27 words
The method as set forth in claim 12 , wherein processing said information content packets includes creating additional information content packets for posting on alternate information routes.
Claim 24
Dependent Claim
31 words
The method as set forth in claim 21 , wherein creating said additional information content packets further includes making a determination of resource credit allocation between said additional information content packets.
Claim 25
Dependent Claim
26 words
The method as set forth in claim 12 , wherein processing said information query packets includes creating additional information query packets for searching alternate information routes.
Claim 26
Dependent Claim
31 words
The method as set forth in claim 23 , wherein creating said additional information query packets further includes making a determination of resource credit allocation between said additional information query packets.
Claim 27
Dependent Claim
27 words
The method as set forth in claim 12 , wherein said residual data deposited by said information content packet remains for a predetermined time period before disposal.
Claim 28
Dependent Claim
27 words
The method as set forth in claim 12 , wherein said residual data deposited by said information query packet remains for a predetermined time period before disposal.
Claim 29
Dependent Claim
29 words
The method as set forth in claim 12 , wherein the resource credit allocation of said information query packet increments or decrements as it traverses an active network node.
Claim 30
Dependent Claim
24 words
The method as set forth in claim 27 , wherein said information query packet is deleted if its resource credit allocation decrements to zero.
Claim 31
Dependent Claim
30 words
The method as set forth in claim 12 , wherein th e resource credit allocation of said information content packet increments or decrements as it traverses an active network node.
Claim 32
Dependent Claim
24 words
The method as set forth in claim 12 , wherein said information content packet is deleted if its resource credit allocation decrements to zero.
Claim 33
Dependent Claim
35 words
The method as set forth in claim 27 , wherein multiple information query packets combine into a new single information query packet, and combine all resource credit allocations into said new single information query packet.
Claim 34
Dependent Claim
35 words
The method as set forth in claim 27 , wherein multiple information content packets combine into a new single information content packet, and combine all resource credit allocations into said new single information content packet.
Claim 35
Dependent Claim
45 words
The method as set forth in claim 12 , wherein said information content packets invoke pre-loaded functions that modify on said at least one content ontology instance tree and search said at least one query ontology instance tree at each of said active network nodes.
Claim 36
Dependent Claim
45 words
The method as set forth in claim 12 , wherein said information query packets invoke pre-loaded functions that modify on said at least one query ontology instance tree and search said at least one content ontology instance tree at each of said active network nodes.
Claim 37
Dependent Claim
184 words
A computer system adapted to creating an information route in a plurality of active network nodes, each active node containing at least one content ontology instance tree and at least one query ontology instance tree, comprising: a processor; a memory including software instructions adapted to enable the computer system to perform: receiving an information content packet at one of said plurality of active network nodes, said information content packet including residual content data; updating said at least one content ontology instance tree at one of said active network nodes with said residual data from said information content packet; searching said at least one query ontology instance tree and determining the next hop for said information content packet; receiving an information query packet at one of said plurality of active network nodes, said information query packet including residual query data; updating said at least one query ontology instance tree at one of said active network nodes with said query data from said information query packet; and searching said at least one content ontology instance tree and determining the next hop for said information query packet.
Claim 38
Dependent Claim
184 words
A computer system adapted to creating an information route in a plurality of active network nodes, each active node containing at least one content ontology instance tree and at least one query ontology instance tree, comprising: a processor; a memory including software instructions adapted to enable the computer system to perform: receiving an information content packet at one of said plurality of active network nodes, said information content packet including residual content data; updating said at least one content ontology instance tree at one of said active network nodes with said residual data from said information content packet; searching said at least one query ontology instance tree and determining the next hop for said information content packet; receiving an information query packet at one of said plurality of active network nodes, said information query packet including residual query data; updating said at least one query ontology instance tree at one of said active network nodes with said query data from said information query packet; and searching said at least one content ontology instance tree and determining the next hop for said information query packet.
Claim 39
Dependent Claim
199 words
A computer program product for enabling a computer to create an information route in a plurality of active network nodes, each active node containing at least one content ontology instance tree and at least one query ontology instance tree, comprising: software instructions for enabling the computer to perform predetermined operations, and a computer readable medium bearing the software instructions; the predetermined operations including the steps of: receiving an information content packet at one of said plurality of active network nodes, said information content packet including residual content data; updating said at least one content ontology instance tree at one of said active network nodes with said residual data from said information content packet; searching said at least one query ontology instance tree and determining the next hop for said information content packet; receiving an information query packet at one of said plurality of active network nodes, said information query packet including residual query data; updating said at least one query ontology instance tree at one of said active network nodes with said query data from said information query packet; and searching said at least one content ontology instance tree and determining the next hop for said information query packet.
Claim 40
Dependent Claim
199 words
A computer program product for enabling a computer to create an information route in a plurality of active network nodes, each active node containing at least one content ontology instance tree and at least one query ontology instance tree, comprising: software instructions for enabling the computer to perform predetermined operations, and a computer readable medium bearing the software instructions; the predetermined operations including the steps of: receiving an information content packet at one of said plurality of active network nodes, said information content packet including residual content data; updating said at least one content ontology instance tree at one of said active network nodes with said residual data from said information content packet; searching said at least one query ontology instance tree and determining the next hop for said information content packet; receiving an information query packet at one of said plurality of active network nodes, said information query packet including residual query data; updating said at least one query ontology instance tree at one of said active network nodes with said query data from said information query packet; and searching said at least one content ontology instance tree and determining the next hop for said information query packet.
Claim 41
Dependent Claim
155 words
A network of nodes for information searching, comprising: a plurality of information provider nodes, each having a plurality of stored information thereon; a plurality of information requestor nodes; a plurality of active network nodes, each active network node connected to a subset of said plurality of information provider nodes, a subset of said plurality of information requestor nodes and a subset of said plurality of active network nodes; a plurality of ontology instance trees, each one of said plurality of active network nodes having at least one content ontology instance tree and at least one query ontology instance tree, wherein each content ontology instance tree contains content data from information content packets and each query ontology instance tree contains query data from information query packets; and an active node service package at each one of said plurality of active network nodes for processing commands embedded within said information query packets and said information content packets.
Claim 42
Dependent Claim
155 words
A network of nodes for information searching, comprising: a plurality of information provider nodes, each having a plurality of stored information thereon; a plurality of information requestor nodes; a plurality of active network nodes, each active network node connected to a subset of said plurality of information provider nodes, a subset of said plurality of information requestor nodes and a subset of said plurality of active network nodes; a plurality of ontology instance trees, each one of said plurality of active network nodes having at least one content ontology instance tree and at least one query ontology instance tree, wherein each content ontology instance tree contains content data from information content packets and each query ontology instance tree contains query data from information query packets; and an active node service package at each one of said plurality of active network nodes for processing commands embedded within said information query packets and said information content packets.
Claim 43
Dependent Claim
22 words
The network as set forth in claim 37 , wherein said network includes a plurality of computers interconnected via a physical network.
Claim 44
Dependent Claim
22 words
The network as set forth in claim 37 , wherein said network includes a plurality of computers interconnected via a virtual network.
Claim 45
Dependent Claim
23 words
The network as set forth in claim 39 , wherein said virtual network consists only of participating nodes within a plurality of computers.
Claim 46
Dependent Claim
15 words
The network as set forth in claim 37 , wherein said network includes an Intranet.
Claim 47
Dependent Claim
21 words
The network as set forth in claim 37 , wherein said network includes a plurality of computers interconnected via the Internet.
Claim 48
Dependent Claim
28 words
The method as set forth in claim 37 , wherein the connected active network includes a routing tree for controlling routing among said plurality of active network nodes.
Claim 49
Dependent Claim
28 words
The method as set forth in claim 43 , wherein said routing tree does not contain loops between the individual nodes of said plurality of active network nodes.
Claim 50
Dependent Claim
26 words
The network as set forth in claim 37 , wherein said active node service package contains invocable pre-loaded functions at each of said active network nodes.
Claim 51
Dependent Claim
40 words
The network as set forth in claim 45 , wherein said invocable pre-loaded functions operate on said at least one content ontology instance tree and said at least one query ontology instance tree at each of said active network nodes.
Claim 52
Dependent Claim
42 words
The network as set forth in claim 45 , wherein said invocable pre-loaded functions support searching and modifying said at least one content ontology instance tree and said at least one query ontology instance tree at each of said active network nodes.
Claim 53
Dependent Claim
38 words
The network as set forth in claim 37 , wherein said at least one content ontology instance tree at each of said active network nodes contains routing information indicating the path to the origin of said content packets.
Claim 54
Dependent Claim
48 words
The network as set forth in claim 48 , wherein the branches of said at least one content ontology instance tree at each of said active network nodes have confidence levels assigned to the nodes of said content ontology instance tree based upon the content of said branches.
Claim 55
Dependent Claim
38 words
The network as set forth in claim 49 , wherein each of said plurality of active network nodes prunes branches of a content ontology instance tree based upon the confidence level of said content ontology instance tree nodes.
Claim 56
Dependent Claim
29 words
The network as set forth in claim 50 , wherein a pruned content ontology instance tree is sent to from one active network node to neighboring active network nodes.
Claim 57
Dependent Claim
38 words
The network as set forth in claim 37 , wherein said at least one query ontology instance tree at each of said active network nodes contains routing information indicating the path to the origin of said query packets.
Claim 58
Dependent Claim
48 words
The network as set forth in claim 52 , wherein the branches of said at least one query ontology instance tree at each of said active network nodes have confidence levels assigned to the nodes of said query ontology instance tree based upon the content of said branches.
Claim 59
Dependent Claim
38 words
The network as set forth in claim 53 , wherein each of said plurality of active network nodes prunes branches of a query ontology instance tree based upon the confidence level of said query ontology instance tree nodes.
Claim 60
Dependent Claim
29 words
The network as set forth in claim 54 , wherein a pruned query ontology instance tree is sent to from one active network node to neighboring active network nodes.
References Cited (Backward Citations)
US6263335B1
Cited
US6282537B1
Cited
US6389409B1
Cited
US6292894B1
Cited
US5953718A
Cited
US6178416B1
Cited
US6192364B1
Cited
US6424973B1
Cited
US6363378B1
Cited
US6370542B1
Cited
US6295535B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-12-23 | 2006-06-24 | 2006-12-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-12-23 | 2010-06-24 | 2010-12-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-12-23 | 2014-06-24 | 2014-12-24 | $7700.00 | Window Closed / Lapsed |