US6061734A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for determining if a message identifier could be equivalent to one of a set of predetermined indentifiers
Assignee: Hanger Solutions LLC
•
Filing: 1997-09-24
•
Granted: 2000-05-09
•
Expires: 2017-09-24
Abstract
Abstract A system and method for determining if a received identifier could be equivalent to one of a set of predetermined identifiers. Predetermined identifiers are encoded into an output. The coded output is stored on a node in a network. An identifier is received over the network and is tested against the coded output. The test reveals if the received identifier could be equivalent to one of a set of predetermined identifiers encoded into the output. An action can be taken that depends upon the outcome of the test. The present invention is useful in efficiently routing messages in a network, determining the authorization of user requests, and other applications.
Inventors
- 👤 Thomas Bennet London
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 20:14
CPC Classifications
H; H04; H04L; H04L63/00; H04L63/10; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99932
Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
260 words
A method for determining if a received message identifier could be equivalent to one of a set of predetermined identifiers on a network, comprising the steps of: (a) initializing a bit vector of length L bits to a predefined value; (b) carrying out a predefined coding method on a predetermined identifier to obtain a coded predetermined identifier comprising a sequence of n integers k 1 , k 2 , . . . k n , where 1≦n≦L, and where 1≦k i ≦L; (c) encoding a bit vector with the coded predetermined identifier by changing the value of each bit in position k i of the bit vector to the opposite of its initialized value for all 1≦i≦n; (d) storing the encoded bit vector in computer readable memory accessible to a first computer connected to the network; (e) receiving a message with an identifier at the first computer, the received message identifier corresponding to the predetermined message identifier of step a; (f) carrying out the predefined coding method of step a on the received message identifier to obtain a coded received message identifier; and (g) testing the coded received message identifier against the encoded bit vector to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers that has been encoded into the bit vector; and (h) performing a routing action based upon the results of the test to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers that has been encoded into the bit vector.
Claim 2
Independent Claim
260 words
A method for determining if a received message identifier could be equivalent to one of a set of predetermined identifiers on a network, comprising the steps of: (a) initializing a bit vector of length L bits to a predefined value; (b) carrying out a predefined coding method on a predetermined identifier to obtain a coded predetermined identifier comprising a sequence of n integers k 1 , k 2 , . . . k n , where 1≦n≦L, and where 1≦k i ≦L; (c) encoding a bit vector with the coded predetermined identifier by changing the value of each bit in position k i of the bit vector to the opposite of its initialized value for all 1≦i≦n; (d) storing the encoded bit vector in computer readable memory accessible to a first computer connected to the network; (e) receiving a message with an identifier at the first computer, the received message identifier corresponding to the predetermined message identifier of step a; (f) carrying out the predefined coding method of step a on the received message identifier to obtain a coded received message identifier; and (g) testing the coded received message identifier against the encoded bit vector to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers that has been encoded into the bit vector; and (h) performing a routing action based upon the results of the test to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers that has been encoded into the bit vector.
Claim 3
Dependent Claim
61 words
The method of claim 1, wherein carrying out the predefined coding method on an identifier to obtain a coded identifier comprises the steps of: (a) carrying out a predefined hash function on the identifier to obtain a seed value; and (b) using the seed value in a pseudo-random function to generate query integers k i (i=1,2, . . . , n).
Claim 4
Dependent Claim
49 words
The method of claim 1, wherein carrying out the predefined coding method on an identifier to obtain a coded identifier comprises the step of carrying out a set of predefined hash functions h i (i=1,2, . . . , n) on the identifier, where h i (identifier)=k i .
Claim 5
Dependent Claim
140 words
The method of claim 1, wherein testing the received message identifier against the encoded bit vector to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers comprises the steps of: (a) carrying out the predefined coding method on the received message identifier to obtain a coded received message identifier comprising a sequence of n integers k 1 ',k 2 ' . . . k n ', where 1≦n≦L, where 1≦k i '≦L; (b) determining if each bit in position k i ' has a value opposite to its initialized value for all 1≦i≦n; and (c) if every bit in position k i , has a value opposite to its initialized value for all 1≦i≦n, then determining that the received message identifier could be equivalent to one of a set of predetermined identifiers.
Claim 6
Dependent Claim
39 words
The method of claim 1, wherein the routing action includes sending a message to a node on the network if it is determined that the received message identifier could be equivalent to one of a set of predetermined identifiers.
Claim 7
Dependent Claim
116 words
The method of claim 1, wherein if it is determined that the received message identifier could be equivalent to one of a set of predetermined identifiers, the routing action includes: a. sending the received message from the first computer to a second computer connected to the network; b. determining if the received message is an authorized message at the second computer; c. if the received message is not authorized, then: i. sending a false positive message from the second computer to the first computer indicating that the received message has produced a false positive; and ii. storing the false positive received message identifier on an exceptions list in computer readable memory accessible to the first computer.
Claim 8
Dependent Claim
22 words
The method of claim 6, further comprising the step of sending a negative response message to the sender of the received message.
Claim 9
Dependent Claim
78 words
The method claim 1, wherein if it is determined that the received message identifier could be equivalent to one of a set of predetermined identifiers, then the routing action includes: a. determining if the received message identifier occurs on an exceptions list stored in computer readable memory accessible to the first computer; and b. if the received message identifier is not on the exceptions list, then sending the received message to a second computer connected to the network.
Claim 10
Dependent Claim
35 words
The method of claim 1, wherein if it is determined that the received message identifier could be equivalent to one of a set of predetermined identifiers, then the routing action includes initiating a telephone call.
Claim 11
Dependent Claim
36 words
The method of claim 1, wherein if it is determined that the received message identifier could be equivalent to one of a set of predetermined identifiers, then the routing action includes carrying out an electronic transaction.
Claim 12
Dependent Claim
48 words
The method of claim 1, wherein if the test determines that the received message identifier could be equivalent to one of a set of predetermined identifiers, then the routing action includes associating the message with an audience rating, and controlling its dissemination in accordance with the audience rating.
Claim 13
Dependent Claim
50 words
The method of claim 1, wherein if the test determines that the received message identifier could be equivalent to one of a set of predetermined identifiers, then the routing action includes associating the message with an optimal routing path, and routing the message in accordance with the optimal routing path.
Claim 14
Independent Claim
150 words
A system on a network for determining if a received message identifier could be equivalent to one of a set of predetermined identifiers, comprising: a. a first peer connected to the network that encodes a plurality of predetermined identifiers into a bit vector; and b. a second peer connected to the network including: i. computer readable memory that stores the bit vector; and ii a processor that receives a message having an identifier, tests the received message identifier against the stored bit vector to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers, and performs a routing action based upon the determination of whether the received message identifier could be equivalent to one of a set of predetermined identifiers, said processor coupled to said memory; and iii. a port adapted to be coupled to the network, said port coupled to said processor.
Claim 15
Independent Claim
150 words
A system on a network for determining if a received message identifier could be equivalent to one of a set of predetermined identifiers, comprising: a. a first peer connected to the network that encodes a plurality of predetermined identifiers into a bit vector; and b. a second peer connected to the network including: i. computer readable memory that stores the bit vector; and ii a processor that receives a message having an identifier, tests the received message identifier against the stored bit vector to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers, and performs a routing action based upon the determination of whether the received message identifier could be equivalent to one of a set of predetermined identifiers, said processor coupled to said memory; and iii. a port adapted to be coupled to the network, said port coupled to said processor.
Claim 16
Dependent Claim
43 words
The system of claim 13, further comprising a third peer, and wherein the routing action includes sending a message to said third peer if said second peer determines that the received message identifier could equivalent to one of a set of predetermined identifiers.
Claim 17
Dependent Claim
69 words
The system of claim 14, wherein said third peer determines if the message sent from said second peer is authorized, and if the message is determined by said third peer not to be authorized, then said third peer sends the message identifier to from said third peer to said second peer, where it is added to an exceptions list stored on said computer readable memory of said second peer.
Claim 18
Independent Claim
143 words
An apparatus on a network for determining if a received message identifier could be equivalent to one of a set of predetermined identifiers, comprising: a. a port to be connected to the network and through which a message with an identifier is received; b. computer readable memory that stores a bit vector and a computer program; c. a processor that tests the received message identifier against said bit vector to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers in accordance with instructions included in said computer program stored in said computer readable memory, and to perform a routing action based upon the determination of whether a received message identifier could be equivalent to one of a set of predetermined identifiers; and d. an electronic data bus interconnecting said processor, port and computer readable memory.
Claim 19
Independent Claim
143 words
An apparatus on a network for determining if a received message identifier could be equivalent to one of a set of predetermined identifiers, comprising: a. a port to be connected to the network and through which a message with an identifier is received; b. computer readable memory that stores a bit vector and a computer program; c. a processor that tests the received message identifier against said bit vector to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers in accordance with instructions included in said computer program stored in said computer readable memory, and to perform a routing action based upon the determination of whether a received message identifier could be equivalent to one of a set of predetermined identifiers; and d. an electronic data bus interconnecting said processor, port and computer readable memory.
Claim 20
Dependent Claim
84 words
The system of claim 16, wherein if said processor determines that the received message identifier could be equivalent to one of a set of predetermined identifiers, said processor performs a routing action that includes sending the received message to a second apparatus connected to the network, said second apparatus comprising a second port to be connected to the network, a second computer readable memory, a second processor, and a second electronic data bus interconnecting said second port, second computer readable memory, and second processor.
Claim 21
Dependent Claim
67 words
The system of claim 16, wherein said apparatus further comprises a port to be connected to a telephone network, said telephone port connected to said electronic data bus, and wherein if said processor determines that the received message identifier could be equivalent to one of a set of predetermined identifiers, then said processor performs a routing action that includes initiating a telephone call through said telephone port.
Claim 22
Independent Claim
102 words
A system for determining if a received message identifier could be equivalent to one of a set of predetermined identifiers, comprising: a. computer readable memory for storing a bit vector encoded with a plurality of predetermined identifiers; b. means for receiving the message; and c. means for testing the received message identifier against the bit vector to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers; and d. means for performing a routing action based upon the determination of whether the message identifier could be equivalent to one of a predetermined set of identifiers.
Claim 23
Independent Claim
102 words
A system for determining if a received message identifier could be equivalent to one of a set of predetermined identifiers, comprising: a. computer readable memory for storing a bit vector encoded with a plurality of predetermined identifiers; b. means for receiving the message; and c. means for testing the received message identifier against the bit vector to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers; and d. means for performing a routing action based upon the determination of whether the message identifier could be equivalent to one of a predetermined set of identifiers.
Claim 24
Dependent Claim
43 words
The system of claim 19, further comprising means to initiate a telephone call when said means for testing the received message identifier against the bit vector determine if the received message identifier could be equivalent to one of a set of predetermined identifiers.
Claim 25
Dependent Claim
12 words
The system of claim 19, further comprising means for routing a message.
Claim 26
Independent Claim
156 words
A method for determining if a received message identifier could be equivalent to one of a set of predetermined identifiers on a network, comprising the steps of: a. coding a plurality of predetermined identifiers to produce a coded output in accordance with a predefined coding method; b. storing the coded output in computer readable memory accessible to a first computer connected to the network; c. receiving a message with an identifier at the first computer; d. carrying out the predefined coding method of step a on the identifier of the received message to obtain a coded received message identifier; and e. testing the coded received message identifier against the coded output to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers; and f. performing a routing action based upon the determination of whether the received message identifier is equivalent to one of a set of predetermined message identifiers.
Claim 27
Independent Claim
156 words
A method for determining if a received message identifier could be equivalent to one of a set of predetermined identifiers on a network, comprising the steps of: a. coding a plurality of predetermined identifiers to produce a coded output in accordance with a predefined coding method; b. storing the coded output in computer readable memory accessible to a first computer connected to the network; c. receiving a message with an identifier at the first computer; d. carrying out the predefined coding method of step a on the identifier of the received message to obtain a coded received message identifier; and e. testing the coded received message identifier against the coded output to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers; and f. performing a routing action based upon the determination of whether the received message identifier is equivalent to one of a set of predetermined message identifiers.
Claim 28
Independent Claim
136 words
A system on a network for determining if a received message identifier could be equivalent to one of a set of predetermined identifiers, comprising: a. a first peer connected to the network that encodes a plurality of predetermined identifiers to produce a coded output; and b. a second peer connected to the network including: i. computer readable memory that stores the coded output; ii. a receiver that receives a message having an identifier; and iii. a tester that tests the received message identifier against the stored coded output to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers and iv. a processor that preforms a routing action based upon the results of determining if the received identifier could be equivalent to one of a predetermined set of identifiers.
Claim 29
Independent Claim
136 words
A system on a network for determining if a received message identifier could be equivalent to one of a set of predetermined identifiers, comprising: a. a first peer connected to the network that encodes a plurality of predetermined identifiers to produce a coded output; and b. a second peer connected to the network including: i. computer readable memory that stores the coded output; ii. a receiver that receives a message having an identifier; and iii. a tester that tests the received message identifier against the stored coded output to determine if the received message identifier could be equivalent to one of a set of predetermined identifiers and iv. a processor that preforms a routing action based upon the results of determining if the received identifier could be equivalent to one of a predetermined set of identifiers.
References Cited (Backward Citations)
US5301247A
Cited
US5659616A
Cited
US5701464A
Cited
US5638448A
Cited
US5684951A
Cited
US5778069A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-05-09 | 2003-11-08 | 2004-05-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-05-09 | 2007-11-08 | 2008-05-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-05-09 | 2011-11-08 | 2012-05-09 | $7700.00 | Window Closed / Lapsed |