US6076121A — Method of network addressing and translation

Claim 1

Independent Claim 116 words

A method for establishing a path between points in a network, the method comprising: storing a first functional property code associated with a first point; storing a first address and a second functional property code associated with a second point; receiving the first address from the first point, the first address indicating a desire to establish a path between the first point and the second point; determining if the first point is compatible with the second point based on the first functional property code and the second functional property code; and determining a second address associated with the second point if the first point is compatible with the second point, the second address comprising a pseudo-address.

Claim 2

Independent Claim 116 words

A method for establishing a path between points in a network, the method comprising: storing a first functional property code associated with a first point; storing a first address and a second functional property code associated with a second point; receiving the first address from the first point, the first address indicating a desire to establish a path between the first point and the second point; determining if the first point is compatible with the second point based on the first functional property code and the second functional property code; and determining a second address associated with the second point if the first point is compatible with the second point, the second address comprising a pseudo-address.

Claim 3

Dependent Claim 22 words

The method of claim 1, further comprising establishing a path between the first point and the second point using the second address.

Claim 4

Dependent Claim 31 words

The method of claim 1, wherein the first functional property code is compatible with the second functional property code if the first functional property code matches the second functional property code.

Claim 5

Dependent Claim 35 words

The method of claim 1, wherein the first functional property code can be compatible with the second functional property code even if the first functional property code does not match the second functional property code.

Claim 6

Dependent Claim 74 words

The method of claim 1, wherein one of the first functional property code and the second functional property code, but not both, is a negated functional property code, and further comprising: determining if the first functional property code is compatible with the second functional property code; and refusing to establish a path between the first point and the second point if the first functional property code is compatible with the second functional property code.

Claim 7

Dependent Claim 82 words

The method of claim 1, further comprising: storing a third functional property code associated with a third point, the third point being associated with the first address; determining if the first point is compatible with the third point based on the first functional property code and the third functional property code; and determining a third address associated with the third point if the first point is compatible with the third point, the third address not being the same as the second address.

Claim 8

Dependent Claim 22 words

The method of claim 6, further comprising establishing a path between the first point and the third point using the third address.

Claim 9

Dependent Claim 31 words

The method of claim 6, further comprising establishing a path between the first point and both the second point, using the second address, and the third point, using the third address.

Claim 10

Dependent Claim 34 words

The method of claim 6, further comprising establishing a path only between the first point and the third point using the third address, even though the first point is compatible with the second point.

Claim 11

Dependent Claim 157 words

The method of claim 6, further comprising: sending a first signal to the second point using the second address, the first signal indicating that the first point wishes to establish a path to the second point; determining whether the second point responds that it is ready to establish a path; establishing a path between the first point and the second point if the second point responds that it is ready to establish a path; sending a second signal to the third point using the third address if the second point does not respond that it is ready to establish a path, the second signal indicating that the first point wishes to establish a path to the third point; determining whether the third point responds that it is ready to establish a path; and establishing a path between the first point and the third point if the third point responds that it is ready to establish a path.

Claim 12

Dependent Claim 113 words

The method of claim 6, further comprising: sending a first signal to the second point using the second address, the first signal indicating that the first point wishes to establish a path to the second point; sending a second signal to the third point using the third address, the second signal indicating that the first point wishes to establish a path to the third point; determining whether the second point or the third point responds first that it is ready to establish a path; and establishing a path between the first point and whichever of the second point and the third point that responds first that it is ready to establish a path.

Claim 13

Dependent Claim 12 words

The method of claim 1, wherein the network comprises a telecommunication network.

Claim 14

Dependent Claim 26 words

The method of claim 1, wherein: the first point and the second point comprise telephone network devices; and the first address comprises a dialable telephone number.

Claim 15

Dependent Claim 33 words

The method of claim 13, wherein the first functional property code indicates that the first point supports voice communication and the second functional property code indicates that the second point supports facsimile communication.

Claim 16

Dependent Claim 17 words

The method of claim 1, wherein the second address is not valid in the network addressing plan.

Claim 17

Dependent Claim 12 words

The method of claim 1, wherein the second address comprises non-decimal digits.

Claim 18

Dependent Claim 26 words

The method of claim 1, wherein the first functional property code and the second functional property code comprise language codes, organizational codes, or family relationship codes.

Claim 19

Dependent Claim 20 words

The method of claim 1, further comprising modifying at least the first functional property code using a graphical user interface.

Claim 20

Dependent Claim 40 words

The method of claim 1, further comprising: determining whether the first address satisfies an error protection code; and refusing to establish a path between the first point and the second point if the first address satisfies the error protection code.

Claim 21

Dependent Claim 47 words

The method of claim 1, further comprising: receiving an indication to establish a communication session from the first point; receiving a new functional property code entered at the first point; and substituting the new functional property code for the first functional property code for the communication session.

Claim 22

Dependent Claim 58 words

The method of claim 1, further comprising: receiving an indication to establish a communication session from the first point; receiving a new functional property code entered at the first point; and combining the new functional property code with the first functional property code such that the first point has multiple associated functional property codes for the communication session.

Claim 23

Dependent Claim 127 words

The method of claim 1, further comprising: storing a third functional property code associated with a third point, the third point being associated with the first address; receiving a new functional property code entered at the second point during a communication session; substituting the new functional property code for the first functional property code for the communication session; determining if the first point is compatible with the third point based on the first functional property code and the third functional property code; determining a third address associated with the third point if the first point is compatible-with the third point, the third address not being the same as the second address; and establishing a path between the first point and the third point using the third address.

Claim 24

Dependent Claim 144 words

The method of claim 1, further comprising: storing a third functional property code associated with a third point, the third point being associated with the first address; receiving a new functional property code entered at the second point during a communication session; combining the new functional property code with the first functional property code such that the first point has multiple associated functional property codes for the communication session; determining if the first point is compatible with the third point based on the multiple functional property codes associated with the first point and the third functional property code; determining a third address associated with the third point if the first point is compatible with the third point, the third address not being the same as the second address; and establishing a path between the first point and the third point using the third address.

Claim 25

Dependent Claim 17 words

The method of claim 1, wherein the second point has a plurality of second functional property codes.

Claim 26

Dependent Claim 23 words

The method of claim 24, wherein the second functional property codes comprise an origination functional property code and a destination functional property code.

Claim 27

Dependent Claim 33 words

The method of claim 25, wherein determining if the first point is compatible with the second point comprises determining whether the first functional property code is compatible with the destination functional property code.

Claim 28

Dependent Claim 24 words

The method of claim 25, wherein the origination functional property code and the destination functional property code of the second point are not identical.

Claim 29

Dependent Claim 162 words

A network for establishing a path between points, the network comprising: a first point having an associated first functional property code; a second point operable to be coupled to the first point, the second point having an associated first address and second functional property code; and a computer coupled to the first point, the computer comprising: a memory operable to store the first functional property code, the second functional property code, and the first address; and a processor coupled to the memory, the processor operable to receive the first address entered at the first point as an indication to establish a path between the first point and the second point, to determine if the first point is compatible with the second point based on the first functional property code and the second functional property code, and to determine a second address associated with the second point if the first point is compatible with the second point, the second address comprising a pseudo-address.

Claim 30

Dependent Claim 162 words

A network for establishing a path between points, the network comprising: a first point having an associated first functional property code; a second point operable to be coupled to the first point, the second point having an associated first address and second functional property code; and a computer coupled to the first point, the computer comprising: a memory operable to store the first functional property code, the second functional property code, and the first address; and a processor coupled to the memory, the processor operable to receive the first address entered at the first point as an indication to establish a path between the first point and the second point, to determine if the first point is compatible with the second point based on the first functional property code and the second functional property code, and to determine a second address associated with the second point if the first point is compatible with the second point, the second address comprising a pseudo-address.

Claim 31

Dependent Claim 30 words

The network of claim 28, wherein the processor is further operable to initiate the establishment of a path between the first point and the second point using the second address.

Claim 32

Dependent Claim 31 words

The network of claim 28, wherein the first functional property code is compatible with the second functional property code if the first functional property code matches the second functional property code.

Claim 33

Dependent Claim 35 words

The network of claim 28, wherein the first functional property code can be compatible with the second functional property code even if the first functional property code does not match the second functional property code.

Claim 34

Dependent Claim 78 words

The network of claim 28, wherein one of the first functional property code and the second functional property code, but not both, is a negated functional property code, and the computer is further operable to: determine if the first functional property code is compatible with the second functional property code; and refuse to establish a path between the first point and the second point if the first functional property code is compatible with the second functional property code.

Claim 35

Dependent Claim 39 words

The network of claim 28, further comprising a switch coupled to the first point, the second point, and the computer, the switch operable to establish a path between the first point and the second point using the second address.

Claim 36

Dependent Claim 103 words

The network of claim 28, further comprising a third point operable to be coupled to the first point, the third point associated with the first address and having an associated third functional property code, and wherein the computer is further operable to: store the third functional property code; determine if the first point is compatible with the third point based on the first functional property code and the third functional property code; and determine a third address associated with the third point if the first point is compatible with the third point, the third address not being the same as the second address.

Claim 37

Dependent Claim 30 words

The network of claim 34, wherein the processor is further operable to initiate the establishment of a path between the first point and the third point using the third address.

Claim 38

Dependent Claim 39 words

The network of claim 34, wherein the computer is further operable to initiate the establishment of a path between the first point and both the second point, using the second address, and the third point, using the third address.

Claim 39

Dependent Claim 42 words

The network of claim 34, wherein the computer is further operable to initiate the establishment of a path only between the first point and the third point using the third address, even though the first point is compatible with the second point.

Claim 40

Dependent Claim 168 words

The network of claim 34, wherein the computer is further operable to: send a first signal to the second point using the second address, the first signal indicating that the first point wishes to establish a path to the second point; determine whether the second point responds that it is ready to establish a path; initiate the establishment of a path between the first point and the second point if the second point responds that it is ready to establish a path; send a second signal to the third point using the third address if the second point does not respond that it is ready to establish a path, the second signal indicating that the first point wishes to establish a path to the third point; determine whether the third point responds that it is ready to establish a path; and initiate the establishment of a path between the first point and the third point if the third point responds that it is ready to establish a path.

Claim 41

Dependent Claim 120 words

The network of claim 34, wherein the computer is further operable to: send a first signal the second point using the second address, the first signal indicating that the first point wishes to establish a path to the second point; send a second signal to the third point using the third address, the second signal indicating that the first point wishes to establish a path to the third point; determine whether the second point or the third point responds first that it is ready to establish a path; and initiate the establishment of a path between the first point and whichever of the second point and the third point that responds first that it is ready to establish a path.

Claim 42

Dependent Claim 12 words

The network of claim 28, wherein the network comprises a telecommunication network.

Claim 43

Dependent Claim 26 words

The network of claim 28, wherein: the first point and the second point comprise telephone network devices; and the first address comprises a dialable telephone number.

Claim 44

Dependent Claim 33 words

The network of claim 41, wherein the first functional property code indicates that the first point supports voice communication and the second functional property code indicates that the second point supports facsimile communication.

Claim 45

Dependent Claim 17 words

The network of claim 28, wherein the second address is not valid in the network addressing plan.

Claim 46

Dependent Claim 12 words

The network of claim 28, wherein the second address comprises non-decimal digits.

Claim 47

Dependent Claim 27 words

The network of claim 28, wherein the first functional property code and the second functional property code comprise language codes, departmental activity codes, or family relationship codes.

Claim 48

Dependent Claim 28 words

The network of claim 28, further comprising a graphical user interface coupled to the computer so that a user may modify at least the first functional property code.

Claim 49

Dependent Claim 45 words

The network of claim 28, wherein the computer is further operable to: determine whether the first address satisfies an error protection code; and refuse to establish a path between the first point and the second point if the first address satisfies the error protection code.

Claim 50

Dependent Claim 36 words

The network of claim 28, wherein: the first point is coupled to a first central office; the second point is coupled to a second central office; and the computer is located at a service control point.

Claim 51

Dependent Claim 52 words

The network of claim 28, wherein the computer is further operable to: receive an indication to establish a communication session from the first point; receive a new functional property code entered at the first point; and substitute the new functional property code for the first functional property code for the communication session.

Claim 52

Dependent Claim 63 words

The network of claim 28, wherein the computer is further operable to: receive an indication to establish a communication session from the first point; receive a new functional property code entered at the first point; and combine the new functional property code with the first functional property code such that the first point has multiple associated functional property codes for the communication session.

Claim 53

Dependent Claim 152 words

The network of claim 28, further comprising a third point operable to be coupled to the first point, the third point associated with the first address and having an associated third functional property code, and wherein the computer is further operable to: store the third functional property code; receive a new functional property code entered at the second point during a communication session; substitute the new functional property code for the first functional property code for the communication session; determine if the first point is compatible with the third point based on the first functional property code and the third functional property code; determine a third address associated with the third point if the first point is compatible with the third point, the third address not being the same as the second address; and initiate the establishment of a path between the first point and the third point using the third address.

Claim 54

Dependent Claim 168 words

The network of claim 28, further comprising a third point operable to be coupled to the first point, the third point associated with the first address and having an associated third functional property code, and wherein the computer is further operable to: store the third functional property code; receive a new functional property code entered at the second point during a communication session; combine the new functional property code with the first functional property code such that the first point has multiple associated functional property codes for the communication session; determine if the first point is compatible with the third point based on the multiple functional property codes associated with the first point and the third functional property code; determine a third address associated with the third point if the first point is compatible with the third point, the third address not being the same as the second address; and initiate the establishment of a path between the first point and the third point using the third address.

Claim 55

Dependent Claim 18 words

The network of claim 28, wherein the second point has a plurality of associated second functional property codes.

Claim 56

Dependent Claim 23 words

The network of claim 53, wherein the second functional property codes comprise an origination functional property code and a destination functional property code.

Claim 57

Dependent Claim 35 words

The network of claim 54, wherein the processor determines if the first functional property code is compatible with the destination functional property code to determine if the first point is compatible with the second point.

Claim 58

Dependent Claim 24 words

The network of claim 54, wherein the origination functional property code and the destination functional property code of the second point are not identical.

Claim 59

Independent Claim 93 words

A method for establishing a path between points in a network, the method comprising: storing a first functional property code associated with a first point; storing a first address and at least two second functional property codes associated with a second point; receiving the first address from the first point, the first address indicating a desire to establish a path between the first point and the second point; and determining if the first point is compatible with the second point based on the first functional property code and the second functional property codes.

Claim 60

Independent Claim 93 words

A method for establishing a path between points in a network, the method comprising: storing a first functional property code associated with a first point; storing a first address and at least two second functional property codes associated with a second point; receiving the first address from the first point, the first address indicating a desire to establish a path between the first point and the second point; and determining if the first point is compatible with the second point based on the first functional property code and the second functional property codes.

Claim 61

Dependent Claim 28 words

The method of claim 57, further comprising establishing a path between the first point and the second point if the first point is compatible with the second point.

Claim 62

Dependent Claim 35 words

The method of claim 57, wherein the first functional property code is compatible with the second functional property codes if the first functional property code matches at least one of the second functional property codes.

Claim 63

Dependent Claim 37 words

The method of claim 57, wherein the first functional property code can be compatible with the second functional property codes even if the first functional property code does not match any of the second functional property codes.

Claim 64

Dependent Claim 83 words

The method of claim 57, wherein one of the first functional property code and the second functional property codes, but not the others, is a negated functional property code, and further comprising: determining if the first functional property code is compatible with one of the second functional property codes; and refusing to establish a path between the first point and the second point if either the first functional property code or the compatible second functional property code is the negated functional property code.

Claim 65

Dependent Claim 47 words

The method of claim 57, further comprising: receiving an indication to establish a communication session from the first point; receiving a new functional property code entered at the first point; and substituting the new functional property code for the first functional property code for the communication session.

Claim 66

Dependent Claim 60 words

The method of claim 57, further comprising: receiving an indication to establish a communication session from the first point; receiving a new functional property code entered at the first point; and using the new functional property code in combination with the first functional property code such that the first point has multiple associated functional property codes for the communication session.

Claim 67

Dependent Claim 106 words

The method of claim 57, further comprising: storing at least two third functional property codes associated with a third point, the third point being associated with the first address; receiving a new functional property code entered at the second point during a communication session; substituting the new functional property code for the first functional property code for the communication session; determining if the first point is compatible with the third point based on the first functional property code and the third functional property code; and establishing a path between the first point and the third point if the first point is compatible with the third point.

Claim 68

Dependent Claim 121 words

The method of claim 57, further comprising: storing at least two third functional property codes associated with a third point, the third point being associated with the first address; receiving a new functional property code entered at the second point during a communication session; combining the new functional property code with the first functional property code such that the first point has multiple associated functional property codes for the communication session; determining if the first point is compatible with the third point based on multiple functional property codes associated with the first point and the third functional property codes; and establishing a path between the first point and the third point if the first point is compatible with the third point.

Claim 69

Dependent Claim 25 words

The method of claim 57, wherein one of the second functional property codes comprises a language code, an organizational code, or a family relationship code.

Claim 70

Dependent Claim 23 words

The method of claim 57, wherein the second functional property codes comprise an origination functional property code and a destination functional property code.

Claim 71

Dependent Claim 33 words

The method of claim 67, wherein determining if the first point is compatible with the second point comprises determining whether the first functional property code is compatible with the destination functional property code.

Claim 72

Dependent Claim 24 words

The method of claim 67, wherein the origination functional property code and the destination functional property code of the second point are not identical.

Claim 73

Dependent Claim 48 words

The method of claim 57, wherein: the first point has at least two first functional property codes; and the step of determining if the first point is compatible with the second point comprises determining if the first functional property codes are compatible with the second functional property codes.

Claim 74

Dependent Claim 39 words

The method of claim 70, wherein the first functional property codes are compatible with the second functional property codes if at least one of the first functional property codes matches at least one of the second functional property codes.

Claim 75

Dependent Claim 28 words

The method of claim 70, wherein at least one of the first functional property codes comprises a language code, a departmental activity code, or a family relationship code.

Claim 76

Dependent Claim 74 words

The method of claim 70, wherein: the first functional property codes comprise a first origination functional property code and a first destination functional property code; the second functional property codes comprise a second origination functional property code and a second destination functional property code; and the step of determining if the first point is compatible with the second point comprises comparing the first origination functional property code to the second destination functional property code.

Claim 77

Dependent Claim 26 words

The method of claim 73, wherein the first origination functional property code and the first destination functional property code of the first point are not identical.

Claim 78

Dependent Claim 54 words

The method of claim 57, further comprising: storing at least two third functional property codes associated with a third point, the third point being associated with the first address; and determining if the first point is compatible with the third point based on the first functional property code and the third functional property codes.

Claim 79

Dependent Claim 28 words

The method of claim 75, further comprising establishing a path between the first point and the third point if the first point is compatible with the third point.

Claim 80

Dependent Claim 38 words

The method of claim 75, further comprising establishing a path between the first point and both the second point and the third point if the first point is compatible with both the second point and the third point.

Claim 81

Dependent Claim 40 words

The method of claim 75, further comprising establishing a path only between the first point and the third point if the first point is compatible with the third point, even though the first point is compatible with the second point.

Claim 82

Dependent Claim 170 words

The method of claim 75, further comprising: sending a first signal to the second point if the second point is compatible with the first point, the first signal indicating that the first point wishes to establish a path to the second point; determining whether the second point responds that it is ready to establish a path; establishing a path between the first point and the second point if the second point responds that it is ready to establish a path; sending a second signal to the third point if the third point is compatible with the first point and if the second point does not respond that it is ready to establish a path, the second signal indicating that the first point wishes to establish a path to the third point; determining whether the third point responds that it is ready to establish a path; and establishing a path between the first point and the third point if the third point responds that it is ready to establish a path.

Claim 83

Dependent Claim 125 words

The method of claim 75, further comprising: sending a first signal to the second point if the second point is compatible with the first point, the first signal indicating that the first point wishes to establish a path to the second point; sending a second signal to the third point if the third point is compatible with the first point, the second signal indicating that the first point wishes to establish a path to the third point; determining whether the second point or the third point responds first that it is ready to establish a path; and establishing a path between the first point and whichever of the second point and the third point that responds first that it is ready to establish a path.

Claim 84

Dependent Claim 12 words

The method of claim 57, wherein the network comprises a telecommunication network.

Claim 85

Dependent Claim 25 words

The method of claim 57, wherein the first point and the second point comprise telephone network devices and the first address comprises a telephone number.

Claim 86

Dependent Claim 35 words

The method of claim 82, wherein the first functional property code indicates that the first point supports voice communication and one of the second functional property codes indicates that the second point supports facsimile communication.

Claim 87

Dependent Claim 20 words

The method of claim 57, further comprising modifying at least the first functional property code using a graphical user interface.

Claim 88

Dependent Claim 40 words

The method of claim 57, further comprising: determining whether the first address satisfies an error protection code; and refusing to establish a path between the first point and the second point if the first address satisfies the error protection code.

Claim 89

Dependent Claim 138 words

A network for establishing a path between points, the network comprising: a first point having an associated first functional property code; a second point operable to be coupled to the first point, the second point having an associated first address and at least two second functional property codes; and a computer coupled to the first point, the computer comprising: a memory operable to store the first functional property code, the second functional property codes, and the first address; and a processor coupled to the memory, the processor operable to receive the first address from the first point as an indication to establish a path between the first point and the second point and to determine if the first point is compatible with the second point based on the first functional property code and the second functional property codes.

Claim 90

Dependent Claim 138 words

A network for establishing a path between points, the network comprising: a first point having an associated first functional property code; a second point operable to be coupled to the first point, the second point having an associated first address and at least two second functional property codes; and a computer coupled to the first point, the computer comprising: a memory operable to store the first functional property code, the second functional property codes, and the first address; and a processor coupled to the memory, the processor operable to receive the first address from the first point as an indication to establish a path between the first point and the second point and to determine if the first point is compatible with the second point based on the first functional property code and the second functional property codes.

Claim 91

Dependent Claim 36 words

The network of claim 86, wherein the computer is further operable to initiate the establishment of a path between the first point and the second point if the first point is compatible with the second point.

Claim 92

Dependent Claim 35 words

The network of claim 86, wherein the first functional property code is compatible with the second functional property codes if the first functional property code matches at least one of the second functional property codes.

Claim 93

Dependent Claim 37 words

The network of claim 86, wherein the first functional property code can be compatible with the second functional property codes even if the first functional property code does not match any of the second functional property codes.

Claim 94

Dependent Claim 87 words

The network of claim 86, wherein one of the first functional property code and the second functional property codes, but not the others, is a negated functional property code, and the computer is further operable to: determine if the first functional property code is compatible with one of the second functional property codes; and refuse to establish a path between the first point and the second point if either the first functional property code or the compatible second functional property code is the negated functional property code.

Claim 95

Dependent Claim 52 words

The network of claim 86, wherein the computer is further operable to: receive an indication to establish a communication session from the first point; receive a new functional property code entered at the first point; and substitute the new functional property code for the first functional property code for the communication session.

Claim 96

Dependent Claim 65 words

The network of claim 86, wherein the computer is further operable to: receive an indication to establish a communication session from the first point; receive a new functional property code entered at the first point; and use the new functional property code in combination with the first functional property code such that the first point has multiple associated functional property codes for the communication session.

Claim 97

Dependent Claim 130 words

The network of claim 86, further comprising a third point operable to be coupled to the first point, the third point associated with the first address and having at least two associated third functional property codes, and wherein the computer is further operable to: store the third functional property codes; receive a new functional property code entered at the second point during a communication session; substitute the new functional property code for the first functional property code for the communication session; determine if the first point is compatible with the third point based on the first functional property code and the third functional property codes; and initiate the establishment of a path between the first point and the third point if the first point is compatible with the third point.

Claim 98

Dependent Claim 146 words

The network of claim 86, further comprising a third point operable to be coupled to the first point, the third point associated with the first address and having at least two associated third functional property codes, and wherein the computer is further operable to: store the third functional property codes; receive a new functional property code entered at the second point during a communication session; combine the new functional property code with the first functional property code such that the first point has multiple associated functional property codes for the communication session; determine if the first point is compatible with the third point based on the multiple functional property codes associated with the first point and the third functional property codes; and initiate the establishment of a path between the first point and the third point if the first point is compatible with the third point.

Claim 99

Dependent Claim 27 words

The network of claim 86, wherein at least one of the second functional property codes is a language code, an organizational code, or a family relationship code.

Claim 100

Dependent Claim 27 words

The network of claim 86, wherein at least one of the second functional property codes comprises an origination functional property code and a destination functional property code.

Claim 101

Dependent Claim 35 words

The network of claim 96, wherein the processor determines if the first functional property code is compatible with the destination functional property code to determine if the first point is compatible with the second point.

Claim 102

Dependent Claim 20 words

The network of claim 96, wherein the origination functional property code and the destination functional property code are not identical.

Claim 103

Dependent Claim 40 words

The network of claim 86, wherein the first point has at least two associated first functional property codes and the computer is further operable to determine if the first functional property codes are compatible with the second functional property codes.

Claim 104

Dependent Claim 39 words

The network of claim 99, wherein the first functional property codes are compatible with the second functional property codes if at least one of the first functional property codes matches at least one of the second functional property codes.

Claim 105

Dependent Claim 28 words

The network of claim 99, wherein at least one of the first functional property codes comprises a language code, a departmental activity code, or a family relationship code.

Claim 106

Dependent Claim 76 words

The network of claim 99, wherein: the first functional property codes comprise a first origination functional property code and a first destination functional property code; the second functional property codes comprise a second origination functional property code and a second destination functional property code; and the processor determines if the first origination functional property code is compatible with the second destination functional property code to determine if the first point is compatible with the second point.

Claim 107

Dependent Claim 26 words

The network of claim 102, wherein the first origination functional property code and the first destination functional property code of the first point are not identical.

Claim 108

Dependent Claim 75 words

The network of claim 86, further comprising a third point operable to be coupled to the first point, the third point associated with the first address and having at least two associated third functional property codes, and wherein the computer is further operable to: store the third functional property codes; and determine if the first point is compatible with the third point based on the first functional property code and the third functional property codes.

Claim 109

Dependent Claim 36 words

The network of claim 104, wherein the processor is further operable to initiate the establishment of a path between the first point and the third point if the first point is compatible with the third point.

Claim 110

Dependent Claim 46 words

The network of claim 104, wherein the processor is further operable to initiate the establishment of a path between the first point and both the second point and the third point if the first point is compatible with both the second point and the third point.

Claim 111

Dependent Claim 48 words

The network of claim 104, wherein the processor is further operable to initiate the establishment of a path only between the first point and the third point if the first point is compatible with the third point, even though the first point is compatible with the second point.

Claim 112

Dependent Claim 178 words

The network of claim 104, wherein the processor is further operable to: send a first signal to the second point if the second point is compatible with the first point, the first signal indicating that the first point wishes to establish a path to the second point; determine whether the second point responds that it is ready to establish a path; initiate the establishment of a path between the first point and the second point if the second point responds that it is ready to establish a path; send a second signal to the third point if the third point is compatible with the first point and if the second point does not respond that it is ready to establish a path, the second signal indicating that the first point wishes to establish a path to the third point; determine whether the third point responds that it is ready to establish a path; and establish a path between the first point and the third point if the third point responds that it is ready to establish a path.

Claim 113

Dependent Claim 130 words

The network of claim 104, wherein the processor is further operable to: send a first signal to the second point if the second point is compatible with the first point, the first signal indicating that the first point wishes to establish a path to the second point; send a second signal to the third point if the third point is compatible with the first point, the second signal indicating that the first point wishes to establish a path to the third point; determine whether the second point or the third point responds first that it is ready to establish a path; and establish a path between the first point and whichever of the second point and the third point that responds first that it is ready to establish a path.

Claim 114

Dependent Claim 12 words

The network of claim 86, wherein the network comprises a telecommunication network.

Claim 115

Dependent Claim 14 words

The network of claim 86, wherein the memory comprises random access memory and registers.

Claim 116

Dependent Claim 25 words

The network of claim 86, wherein the first point and the second point comprise telephone network devices and the first address comprises a telephone number.

Claim 117

Dependent Claim 35 words

The network of claim 112, wherein the first functional property code indicates that the first point supports voice communication and one of the second functional property codes indicates that the second point supports facsimile communication.

Claim 118

Dependent Claim 28 words

The network of claim 86, further comprising a graphical user interface coupled to the computer so that a user may modify at least the first functional property code.

Claim 119

Dependent Claim 36 words

The network of claim 86, wherein: the first point is coupled to a first central office; the second point is coupled to a second central office; and the computer is located at a service control point.

Claim 120

Dependent Claim 45 words

The network of claim 86, wherein the computer is further operable to: determine whether the first address satisfies an error protection code; and refuse to establish a path between the first point and the second point if the first address satisfies the error protection code.

Claim 121

Independent Claim 57 words

A method for programming and using a functional property code for a communication device, the method comprising: receiving in a programming session at a communication device a functional property code; communicating the functional property code to a storage location for storage; terminating the programming session; and initiating a communication session in accordance with the functional property code.

Claim 122

Independent Claim 57 words

A method for programming and using a functional property code for a communication device, the method comprising: receiving in a programming session at a communication device a functional property code; communicating the functional property code to a storage location for storage; terminating the programming session; and initiating a communication session in accordance with the functional property code.

Claim 123

Dependent Claim 37 words

The method of claim 117, wherein initiating a communication session in accordance with the functional property code comprises: receiving a first address associated with a second communication device; and communicating the first address to the storage location.

Claim 124

Dependent Claim 40 words

The method of claim 117, wherein initiating a communication session comprises: receiving a new functional property code to substitute for the stored functional property code for the communication session; and communicating the new functional property code to the storage location.

Claim 125

Dependent Claim 54 words

The method of claim 117, wherein initiating a communication session comprises: receiving a new functional property code to be used in combination with the stored functional property code such that the communication device has multiple associated functional property codes for the communication session; and communicating the new functional property code to the storage location.

Claim 126

Dependent Claim 21 words

The method of claim 117, wherein the communication device has a plurality of functional property codes stored at the storage location.

Claim 127

Dependent Claim 51 words

The method of claim 121, wherein the functional property codes comprise an origination functional property code and a destination functional property code, the origination functional property code for use in initiating communications from the communication device and the destination functional property code for use in receiving communications at the communication device.

Claim 128

Dependent Claim 20 words

The method of claim 122, wherein the origination functional property code and the destination functional property code are not identical.

Claim 129

Dependent Claim 38 words

The method of claim 122, wherein: the origination functional property code indicates a type of department to be reached in an organization; and the destination functional property code indicates a type of department associated with the communication device.

Claim 130

Dependent Claim 15 words

The method of claim 117, wherein the storage location is part of a telecommunication network.

Claim 131

Dependent Claim 22 words

The method of claim 117, wherein the functional property code comprises a language code, an organizational code, or a family relationship code.

Claim 132

Dependent Claim 14 words

The method of claim 117, wherein the communication device comprises a telephone network device.

Claim 133

Dependent Claim 20 words

The method of claim 117, further comprising modifying at least the first functional property code using a graphical user interface.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2003-06-13	2003-12-13	2004-06-13	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2007-06-13	2007-12-13	2008-06-13	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2011-06-13	2011-12-13	2012-06-13	$7700.00	Window Closed / Lapsed

Method of network addressing and translation

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag