Method of network addressing and translation

• US 6,076,121 A
• Filed: 03/13/1998
• Issued: 06/13/2000
• Est. Priority Date: 03/13/1998
• Status: Expired due to Term

• Current Assignee: Richard C. Levine
• Original Assignee: Richard C. Levine
• Inventors: Levine, Richard C.
• Primary Examiner(s): Lee, Thomas C.
• Assistant Examiner(s): Bui, Bing
• Application Number:
  US09/039,004
• Time in Patent Office: 823 Days
• Field of Search: 379/207, 379/211, 379/219, 379/220, 379/229, 379/230, 379/93.24, 379/100.08, 395/200.53, 709/220, 709/222, 710/62, 710/65
• US Class Current: 710/62
• CPC Class Codes: H04L 61/00 Network arrangements, protocols or services for addressing or naming
• CPC Class Codes: H04M 2203/2061 Language aspects
• CPC Class Codes: H04M 2203/2066 Call type detection of indication, e.g. voice or fax, mobile of fixed, PSTN or IP
• CPC Class Codes: H04M 3/42153 by subscriber
• CPC Class Codes: H04M 3/46 Arrangements for calling a number of substations in a predetermined sequence until an answer is obtained
• CPC Class Codes: H04M 3/58 Arrangements for transferring received calls from one subscriber to another; Arrangements affording interim conversations between either the calling or the called party and a third party substation line holding circuits H04M1/80
• CPC Class Codes: H04Q 3/0029 Provisions for intelligent networking

Abstract

The present invention provides a system and method of addressing and translating addresses in a network, such as a telecommunications, cellular or transportation network. The system and method in a telephone network assign a directory number to each user, and functional property code(s) to each device a user employs. The same directory number is then used to reach the user, whereby the system will automatically use the functional property code of each device to reach the user'"'"'s voice line, cellular line, fax line, data line or other telephone network device. The system and method apply to transportation networks such as airlines, busses, rail, and shipping, to pipeline networks such as the oil industry, delivery networks such as postal services, and to other networks in which symbolic addresses are used to designate a source and a destination of traffic.

Claims

1. 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.

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

3. 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.

4. 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.

5. 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.

6. 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.

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

8. 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.

9. 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.

10. 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.

11. 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.

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

13. 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.

14. 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.

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

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

17. 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.

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

19. 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.

20. 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.

21. 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.

22. 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.

23. 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.

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

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

26. 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.

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

28. 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.

29. 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.

30. 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.

31. 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.

32. 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.

33. 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.

34. 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.

35. 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.

36. 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.

37. 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.

38. 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.

39. 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.

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

41. 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.

42. 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.

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

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

45. 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.

46. 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.

47. 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.

48. 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.

49. 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.

50. 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.

51. 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.

52. 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.

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

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

55. 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.

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

57. 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.

58. 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.

59. 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.

60. 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.

61. 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.

62. 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.

63. 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.

64. 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.

65. 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.

66. 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.

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

68. 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.

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

70. 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.

71. 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.

72. 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.

73. 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.

74. 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.

75. 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.

76. 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.

77. 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.

78. 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.

79. 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.

80. 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.

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

82. 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.

83. 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.

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

85. 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.

86. 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.

87. 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.

88. 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.

89. 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.

90. 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.

91. 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.

92. 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.

93. 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.

94. 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.

95. 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.

96. 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.

97. 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.

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

99. 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.

100. 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.

101. 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.

102. 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.

103. 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.

104. 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.

105. 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.

106. 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.

107. 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.

108. 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.

109. 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.

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

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

112. 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.

113. 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.

114. 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.

115. 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.

116. 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.

117. 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.

118. 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.

119. 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.

120. 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.

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

122. 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.

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

124. 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.

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

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

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

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