Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
135 words
A method for routing a message encoded in a signal received by an electronic messaging system, the electronic messaging system including a data store of routing information, the message containing a user address having a plurality of address codes, the method comprising: (a) setting a search level indicator according to a number of address codes in the user address; (b) attempting to retrieve routing information associated with the plurality of address codes in the user address; (c) eliminating one of the plurality of address codes from the user address if no routing information is retrieved; (d) repeating steps (a) through (c) until routing information is successfully retrieved or the search level indicator equals a predetermined base level; and (e) in the event routing information is successfully retrieved, routing the message according to said routing information.
Claim 2
Independent Claim
135 words
A method for routing a message encoded in a signal received by an electronic messaging system, the electronic messaging system including a data store of routing information, the message containing a user address having a plurality of address codes, the method comprising: (a) setting a search level indicator according to a number of address codes in the user address; (b) attempting to retrieve routing information associated with the plurality of address codes in the user address; (c) eliminating one of the plurality of address codes from the user address if no routing information is retrieved; (d) repeating steps (a) through (c) until routing information is successfully retrieved or the search level indicator equals a predetermined base level; and (e) in the event routing information is successfully retrieved, routing the message according to said routing information.
Claim 3
Dependent Claim
33 words
The method of claim 1 wherein the one of the plurality of address codes eliminated from the user address corresponds to a most specific level of address information contained in the user address.
Claim 4
Dependent Claim
24 words
The method of claim 2 wherein the step of attempting to retrieve routing information includes a binary search of the routing information data store.
Claim 5
Dependent Claim
30 words
The method of claim 3 wherein the binary search includes pattern matching to determine whether a match for the plurality of address codes exists in the routing information data store.
Claim 6
Dependent Claim
27 words
The method of claim 2 further comprising the step of indicating an invalid user address if no routing information is retrieved within the predetermined number of attempts.
Claim 7
Independent Claim
162 words
A method for routing a message encoded in a signal received by an electronic messaging system, the electronic messaging system including a routing information database containing a plurality of routing path records keyed by user addresses, the message containing a user address having a plurality of address codes corresponding to different levels of specificity, the method comprising: (a) setting a search level indicator to a number of address codes in the user address of the message, the search level indicator corresponding to a current level of specificity; (b) formatting a search key using a set of address codes parsed from the user address and corresponding to the current level of specificity; (c) attempting to retrieve a routing path record associated with the search key; (d) decrementing the search level indicator if no routing path record is retrieved; and (e) repeating steps (b) through (d) until a routing path record is successfully retrieved or the search level indicator equals a predetermined base level.
Claim 8
Independent Claim
162 words
A method for routing a message encoded in a signal received by an electronic messaging system, the electronic messaging system including a routing information database containing a plurality of routing path records keyed by user addresses, the message containing a user address having a plurality of address codes corresponding to different levels of specificity, the method comprising: (a) setting a search level indicator to a number of address codes in the user address of the message, the search level indicator corresponding to a current level of specificity; (b) formatting a search key using a set of address codes parsed from the user address and corresponding to the current level of specificity; (c) attempting to retrieve a routing path record associated with the search key; (d) decrementing the search level indicator if no routing path record is retrieved; and (e) repeating steps (b) through (d) until a routing path record is successfully retrieved or the search level indicator equals a predetermined base level.
Claim 9
Dependent Claim
26 words
The method of claim 6 wherein the step of attempting to retrieve a path record comprises a binary search of the plurality of routing path records.
Claim 10
Dependent Claim
22 words
The method of claim 7 wherein the binary search includes pattern matching to determine whether a match for the search key exists.
Claim 11
Dependent Claim
23 words
The method of claim 6 further comprising the step of routing the message according to information contained in a retrieved routing path record.
Claim 12
Dependent Claim
25 words
The method of claim 9 further comprising the step of indicating an invalid user address when the search level indicator equals the predetermined base level.
Claim 13
Dependent Claim
137 words
A message transfer device for routing a message encoded in a signal received by an electronic messaging system including a memory and a routing information dataset stored therein, the routing information dataset associating communications paths with user addresses, the message including a user address comprising a plurality of address codes, the message transfer device comprising: (a) a search key generator adapted to format a search key comprising a set of address codes parsed from the user address of the message; (b) a database access module capable of retrieving routing information from the routing information dataset; and (c) a routing module coupled to the search key generator and the database access module, the routing module adapted to coordinate an iterative search of the routing information dataset using a search key comprising a progressively decreasing number of address codes.
Claim 14
Dependent Claim
137 words
A message transfer device for routing a message encoded in a signal received by an electronic messaging system including a memory and a routing information dataset stored therein, the routing information dataset associating communications paths with user addresses, the message including a user address comprising a plurality of address codes, the message transfer device comprising: (a) a search key generator adapted to format a search key comprising a set of address codes parsed from the user address of the message; (b) a database access module capable of retrieving routing information from the routing information dataset; and (c) a routing module coupled to the search key generator and the database access module, the routing module adapted to coordinate an iterative search of the routing information dataset using a search key comprising a progressively decreasing number of address codes.
Claim 15
Dependent Claim
25 words
The message transfer device of claim 11 wherein the iterative search uses a search key corresponding to a progressively less specific set of address codes.
Claim 16
Dependent Claim
27 words
The message transfer device of claim 12 wherein the routing module is adapted to transmit the message to an intended recipient according to the retrieved routing information.
Claim 17
Dependent Claim
24 words
The message transfer device of claim 13 wherein the database access module is adapted to perform a binary search of the routing information dataset.
Claim 18
Dependent Claim
257 words
A message transfer device for routing a message in an electronic messaging system including a memory, the message including a plurality of address codes, the message transfer device comprising: (a) a search key generator adapted to parse a subset of the plurality of address codes from the message and use the subset of the plurality of address codes to format a search key, the search key generator further adapted to reformat the search key by eliminating one of the subset of the plurality of address codes, wherein the search key generator maintains a search level indicator corresponding to a number of address codes in the search key; (b) a routing information dataset stored in the memory of the electronic messaging system, the routing information dataset containing a plurality of routing path records associating a communications path with user address information; (c) a data access module capable of retrieving a routing path record having user address information corresponding to the search key; and (d) a routing module coupled to the search key generator and the data access module, the routing module capable of transmitting a message along a communications path specified in a retrieved routing path record and adapted to coordinate an iterative operation comprising: (i) attempting to retrieve a routing path record corresponding to the search key using the data access module, (ii) indicating whether a routing path record was successfully retrieved by the data access module, and (iii) reformatting the search key using the search key generator if a routing path record was not successfully retrieved.
Claim 19
Dependent Claim
257 words
A message transfer device for routing a message in an electronic messaging system including a memory, the message including a plurality of address codes, the message transfer device comprising: (a) a search key generator adapted to parse a subset of the plurality of address codes from the message and use the subset of the plurality of address codes to format a search key, the search key generator further adapted to reformat the search key by eliminating one of the subset of the plurality of address codes, wherein the search key generator maintains a search level indicator corresponding to a number of address codes in the search key; (b) a routing information dataset stored in the memory of the electronic messaging system, the routing information dataset containing a plurality of routing path records associating a communications path with user address information; (c) a data access module capable of retrieving a routing path record having user address information corresponding to the search key; and (d) a routing module coupled to the search key generator and the data access module, the routing module capable of transmitting a message along a communications path specified in a retrieved routing path record and adapted to coordinate an iterative operation comprising: (i) attempting to retrieve a routing path record corresponding to the search key using the data access module, (ii) indicating whether a routing path record was successfully retrieved by the data access module, and (iii) reformatting the search key using the search key generator if a routing path record was not successfully retrieved.
Claim 20
Dependent Claim
20 words
The message transfer device of claim 15 wherein the routing information dataset comprises a dataset sorted by user address information.
Claim 21
Dependent Claim
23 words
The message transfer device of claim 16 wherein the data access module performs a binary search of the plurality of routing path records.
Claim 22
Dependent Claim
14 words
The message transfer device of claim 17 wherein the message conforms to X.400 standards.
Claim 23
Dependent Claim
22 words
The message transfer device of claim 15 wherein the routing information dataset comprises a direct access dataset keyed by user address information.
Claim 24
Dependent Claim
283 words
A message transfer device for routing a message in an electronic messaging system having a memory coupled thereto, the message including an externally meaningful address corresponding to an intended recipient, the message transfer device comprising: (a) an address translator adapted to convert an externally meaningful address to an internal address reflecting a configuration of the electronic messaging system; (b) a search key generator adapted to parse a set of address codes from the internal address and use the set of address codes to format an initial search key, the search key generator further adapted to reformat a search key by eliminating one of the set of address codes from the search key; (c) a routing information dataset stored in the memory coupled to the electronic messaging system, the routing information dataset containing a plurality of routing path records associating a communications path with user address information; (d) a data access module capable of retrieving a routing path record having user address information corresponding to the set of address codes in the search key; and (e) a routing module coupled to the search key generator and the data access module, the routing module capable of transmitting a message along a communications path specified in a retrieved routing path record and adapted to coordinate an iterative operation beginning with a search key formatted by the search key generator, the iterative operation comprising: (i) attempting to retrieve a routing path record corresponding to the search key using the data access module, (ii) indicating whether a routing path record was successfully retrieved by the data access module, and (iii) reformatting the search key using the search key generator if a routing path record was not successfully retrieved.
Claim 25
Dependent Claim
283 words
A message transfer device for routing a message in an electronic messaging system having a memory coupled thereto, the message including an externally meaningful address corresponding to an intended recipient, the message transfer device comprising: (a) an address translator adapted to convert an externally meaningful address to an internal address reflecting a configuration of the electronic messaging system; (b) a search key generator adapted to parse a set of address codes from the internal address and use the set of address codes to format an initial search key, the search key generator further adapted to reformat a search key by eliminating one of the set of address codes from the search key; (c) a routing information dataset stored in the memory coupled to the electronic messaging system, the routing information dataset containing a plurality of routing path records associating a communications path with user address information; (d) a data access module capable of retrieving a routing path record having user address information corresponding to the set of address codes in the search key; and (e) a routing module coupled to the search key generator and the data access module, the routing module capable of transmitting a message along a communications path specified in a retrieved routing path record and adapted to coordinate an iterative operation beginning with a search key formatted by the search key generator, the iterative operation comprising: (i) attempting to retrieve a routing path record corresponding to the search key using the data access module, (ii) indicating whether a routing path record was successfully retrieved by the data access module, and (iii) reformatting the search key using the search key generator if a routing path record was not successfully retrieved.
Claim 26
Dependent Claim
39 words
The message transfer device of claim 20 wherein the address translator comprises a conversion table stored in a memory of the electronic messaging system and including a plurality of table entries associating internal address codes with external address codes.
Claim 27
Independent Claim
168 words
A method for routing a signal received by a switching device, the switching device including a memory associating routing information with user address information, the signal containing an encoded representation of a user address comprising a plurality of address codes, the method comprising the steps of: (a) analyzing the received signal to identify the plurality of address codes encoded therein; (b) formatting a search key using the plurality of address codes; (c) setting a search level indicator according to the number of address codes in the search key; (d) attempting to retrieve routing information from the memory associated with the plurality of address codes in the search key; (e) eliminating one of the plurality of address codes from the search key if no routing information is successfully retrieved; (f) repeating steps (c) through (e) until routing information is successfully retrieved or the search level indicator equals a predetermined level; and (g) in the event routing information is successfully retrieved, routing the signal according to the retrieved routing information.
Claim 28
Independent Claim
168 words
A method for routing a signal received by a switching device, the switching device including a memory associating routing information with user address information, the signal containing an encoded representation of a user address comprising a plurality of address codes, the method comprising the steps of: (a) analyzing the received signal to identify the plurality of address codes encoded therein; (b) formatting a search key using the plurality of address codes; (c) setting a search level indicator according to the number of address codes in the search key; (d) attempting to retrieve routing information from the memory associated with the plurality of address codes in the search key; (e) eliminating one of the plurality of address codes from the search key if no routing information is successfully retrieved; (f) repeating steps (c) through (e) until routing information is successfully retrieved or the search level indicator equals a predetermined level; and (g) in the event routing information is successfully retrieved, routing the signal according to the retrieved routing information.
Claim 29
Dependent Claim
50 words
The method of claim 22 wherein the step of analyzing the received signal comprises parsing address codes from predetermined positions of the received signal, the predetermined positions corresponding to portions of an electronic messaging address in which each of a plurality of address codes represents a unique degree of specificity.